/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:31:13,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:31:13,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:31:13,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:31:13,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:31:13,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:31:13,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:31:13,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:31:13,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:31:13,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:31:13,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:31:13,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:31:13,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:31:13,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:31:13,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:31:13,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:31:13,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:31:13,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:31:13,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:31:13,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:31:13,978 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:31:13,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:31:13,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:31:13,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:31:13,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:31:13,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:31:13,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:31:13,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:31:13,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:31:13,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:31:13,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:31:13,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:31:13,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:31:14,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:31:14,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:31:14,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:31:14,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:31:14,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:31:14,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:31:14,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:31:14,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:31:14,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:31:14,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:31:14,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:31:14,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:31:14,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:31:14,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:31:14,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:31:14,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:31:14,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:31:14,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:31:14,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:31:14,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:31:14,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:31:14,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:31:14,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:31:14,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:31:14,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:31:14,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:31:14,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:31:14,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:31:14,018 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:31:14,018 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:31:14,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:31:14,018 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:31:14,018 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:31:14,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:31:14,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:31:14,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:31:14,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:31:14,205 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:31:14,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-15 12:31:14,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236f8484c/c1c490508b27487b9604130f148ada55/FLAGd1f414ecc [2022-04-15 12:31:14,601 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:31:14,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-15 12:31:14,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236f8484c/c1c490508b27487b9604130f148ada55/FLAGd1f414ecc [2022-04-15 12:31:15,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236f8484c/c1c490508b27487b9604130f148ada55 [2022-04-15 12:31:15,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:31:15,033 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:31:15,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:31:15,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:31:15,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:31:15,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:31:15" (1/1) ... [2022-04-15 12:31:15,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42450afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15, skipping insertion in model container [2022-04-15 12:31:15,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:31:15" (1/1) ... [2022-04-15 12:31:15,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:31:15,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:31:15,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i[893,906] [2022-04-15 12:31:15,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:31:15,181 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:31:15,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i[893,906] [2022-04-15 12:31:15,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:31:15,200 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:31:15,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15 WrapperNode [2022-04-15 12:31:15,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:31:15,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:31:15,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:31:15,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:31:15,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15" (1/1) ... [2022-04-15 12:31:15,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15" (1/1) ... [2022-04-15 12:31:15,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15" (1/1) ... [2022-04-15 12:31:15,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15" (1/1) ... [2022-04-15 12:31:15,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15" (1/1) ... [2022-04-15 12:31:15,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15" (1/1) ... [2022-04-15 12:31:15,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15" (1/1) ... [2022-04-15 12:31:15,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:31:15,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:31:15,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:31:15,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:31:15,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15" (1/1) ... [2022-04-15 12:31:15,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:31:15,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:31:15,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:31:15,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:31:15,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:31:15,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:31:15,285 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:31:15,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:31:15,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:31:15,285 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:31:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:31:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:31:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:31:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:31:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:31:15,346 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:31:15,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:31:15,506 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:31:15,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:31:15,513 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 12:31:15,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:31:15 BoogieIcfgContainer [2022-04-15 12:31:15,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:31:15,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:31:15,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:31:15,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:31:15,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:31:15" (1/3) ... [2022-04-15 12:31:15,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4bec34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:31:15, skipping insertion in model container [2022-04-15 12:31:15,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:15" (2/3) ... [2022-04-15 12:31:15,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4bec34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:31:15, skipping insertion in model container [2022-04-15 12:31:15,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:31:15" (3/3) ... [2022-04-15 12:31:15,529 INFO L111 eAbstractionObserver]: Analyzing ICFG nested6.i [2022-04-15 12:31:15,533 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:31:15,533 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:31:15,568 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:31:15,574 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:31:15,575 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:31:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:31:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:31:15,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:15,596 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:15,596 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash -380972064, now seen corresponding path program 1 times [2022-04-15 12:31:15,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:15,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1577323266] [2022-04-15 12:31:15,612 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:31:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash -380972064, now seen corresponding path program 2 times [2022-04-15 12:31:15,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:15,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151021766] [2022-04-15 12:31:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:15,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {33#true} is VALID [2022-04-15 12:31:15,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 12:31:15,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #98#return; {33#true} is VALID [2022-04-15 12:31:15,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:15,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {33#true} is VALID [2022-04-15 12:31:15,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 12:31:15,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #98#return; {33#true} is VALID [2022-04-15 12:31:15,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-15 12:31:15,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {33#true} is VALID [2022-04-15 12:31:15,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume !!(~n~0 < 1000000); {33#true} is VALID [2022-04-15 12:31:15,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume ~k~0 == ~n~0; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-15 12:31:15,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#(<= main_~n~0 main_~k~0)} ~i~0 := 0; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-15 12:31:15,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(<= main_~n~0 main_~k~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-15 12:31:15,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(<= main_~n~0 main_~k~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-15 12:31:15,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(<= main_~n~0 main_~k~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-15 12:31:15,860 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#(<= main_~n~0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:31:15,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:31:15,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {34#false} is VALID [2022-04-15 12:31:15,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-15 12:31:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:31:15,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:15,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151021766] [2022-04-15 12:31:15,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151021766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:15,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:15,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:31:15,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:15,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1577323266] [2022-04-15 12:31:15,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1577323266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:15,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:15,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:31:15,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728324702] [2022-04-15 12:31:15,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:31:15,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:15,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:15,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:15,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:31:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:15,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:31:15,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:31:15,920 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:16,279 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2022-04-15 12:31:16,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:31:16,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:31:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-15 12:31:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-15 12:31:16,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2022-04-15 12:31:16,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:16,363 INFO L225 Difference]: With dead ends: 58 [2022-04-15 12:31:16,363 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:31:16,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:31:16,367 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:16,367 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:31:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:31:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 12:31:16,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:16,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:16,395 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:16,395 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:16,398 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 12:31:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 12:31:16,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:16,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:16,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 12:31:16,399 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 12:31:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:16,400 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 12:31:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 12:31:16,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:16,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:16,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:16,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-15 12:31:16,403 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2022-04-15 12:31:16,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:16,404 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-15 12:31:16,404 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:16,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-15 12:31:16,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 12:31:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:31:16,430 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:16,430 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:16,430 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:31:16,430 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:16,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash 580085489, now seen corresponding path program 1 times [2022-04-15 12:31:16,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:16,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1767038223] [2022-04-15 12:31:16,432 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:31:16,432 INFO L85 PathProgramCache]: Analyzing trace with hash 580085489, now seen corresponding path program 2 times [2022-04-15 12:31:16,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:16,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647738040] [2022-04-15 12:31:16,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:16,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:16,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:16,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {284#true} is VALID [2022-04-15 12:31:16,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#true} assume true; {284#true} is VALID [2022-04-15 12:31:16,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {284#true} {284#true} #98#return; {284#true} is VALID [2022-04-15 12:31:16,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:16,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {284#true} is VALID [2022-04-15 12:31:16,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2022-04-15 12:31:16,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #98#return; {284#true} is VALID [2022-04-15 12:31:16,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret7 := main(); {284#true} is VALID [2022-04-15 12:31:16,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {284#true} is VALID [2022-04-15 12:31:16,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#true} assume !!(~n~0 < 1000000); {284#true} is VALID [2022-04-15 12:31:16,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#true} assume ~k~0 == ~n~0; {284#true} is VALID [2022-04-15 12:31:16,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#true} ~i~0 := 0; {284#true} is VALID [2022-04-15 12:31:16,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {289#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-15 12:31:16,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#(<= (* main_~i~0 2) main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {289#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-15 12:31:16,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#(<= (* main_~i~0 2) main_~j~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {290#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-15 12:31:16,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {290#(<= (* main_~i~0 2) main_~k~0)} assume !!(~k~0 < ~n~0); {290#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-15 12:31:16,499 INFO L272 TraceCheckUtils]: 13: Hoare triple {290#(<= (* main_~i~0 2) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {291#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:31:16,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {292#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:31:16,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {285#false} is VALID [2022-04-15 12:31:16,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {285#false} assume !false; {285#false} is VALID [2022-04-15 12:31:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:31:16,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:16,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647738040] [2022-04-15 12:31:16,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647738040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:16,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:16,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:31:16,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:16,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1767038223] [2022-04-15 12:31:16,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1767038223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:16,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:16,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:31:16,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957862965] [2022-04-15 12:31:16,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:16,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:31:16,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:16,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:16,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:16,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:31:16,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:16,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:31:16,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:31:16,514 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:16,890 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 12:31:16,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:31:16,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:31:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-15 12:31:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-15 12:31:16,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-15 12:31:16,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:16,930 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:31:16,930 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:31:16,930 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:31:16,931 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:16,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:31:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:31:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-15 12:31:16,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:16,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:16,953 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:16,953 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:16,955 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-15 12:31:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-15 12:31:16,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:16,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:16,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-15 12:31:16,956 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-15 12:31:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:16,958 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-15 12:31:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-15 12:31:16,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:16,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:16,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:16,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-15 12:31:16,960 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-04-15 12:31:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:16,960 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-15 12:31:16,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:16,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-15 12:31:16,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 12:31:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:31:16,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:16,988 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:16,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:31:16,989 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:16,989 INFO L85 PathProgramCache]: Analyzing trace with hash -132185391, now seen corresponding path program 1 times [2022-04-15 12:31:16,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:16,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1978440219] [2022-04-15 12:31:16,990 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:31:16,990 INFO L85 PathProgramCache]: Analyzing trace with hash -132185391, now seen corresponding path program 2 times [2022-04-15 12:31:16,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:16,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140069434] [2022-04-15 12:31:16,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:16,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:17,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:17,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {532#true} is VALID [2022-04-15 12:31:17,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-15 12:31:17,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {532#true} {532#true} #98#return; {532#true} is VALID [2022-04-15 12:31:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 12:31:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:17,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-15 12:31:17,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-15 12:31:17,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-15 12:31:17,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {537#(<= main_~k~0 main_~n~0)} #94#return; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-15 12:31:17,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} call ULTIMATE.init(); {544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:17,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {532#true} is VALID [2022-04-15 12:31:17,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-15 12:31:17,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} #98#return; {532#true} is VALID [2022-04-15 12:31:17,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} call #t~ret7 := main(); {532#true} is VALID [2022-04-15 12:31:17,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {532#true} is VALID [2022-04-15 12:31:17,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#true} assume !!(~n~0 < 1000000); {532#true} is VALID [2022-04-15 12:31:17,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#true} assume ~k~0 == ~n~0; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-15 12:31:17,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {537#(<= main_~k~0 main_~n~0)} ~i~0 := 0; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-15 12:31:17,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(<= main_~k~0 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-15 12:31:17,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {537#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-15 12:31:17,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {537#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-15 12:31:17,049 INFO L272 TraceCheckUtils]: 12: Hoare triple {537#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {532#true} is VALID [2022-04-15 12:31:17,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-15 12:31:17,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-15 12:31:17,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-15 12:31:17,050 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {532#true} {537#(<= main_~k~0 main_~n~0)} #94#return; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-15 12:31:17,050 INFO L272 TraceCheckUtils]: 17: Hoare triple {537#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:31:17,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {542#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {543#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:31:17,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {543#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {533#false} is VALID [2022-04-15 12:31:17,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {533#false} assume !false; {533#false} is VALID [2022-04-15 12:31:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:31:17,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:17,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140069434] [2022-04-15 12:31:17,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140069434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:17,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:17,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:31:17,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:17,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1978440219] [2022-04-15 12:31:17,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1978440219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:17,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:17,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:31:17,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581777771] [2022-04-15 12:31:17,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:17,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 12:31:17,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:17,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:17,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:17,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:31:17,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:17,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:31:17,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:31:17,065 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:17,309 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-04-15 12:31:17,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:31:17,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 12:31:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 12:31:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 12:31:17,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-15 12:31:17,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:17,351 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:31:17,351 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:31:17,352 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:31:17,352 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:17,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 42 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:31:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:31:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 12:31:17,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:17,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:31:17,395 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:31:17,395 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:31:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:17,397 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-15 12:31:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-15 12:31:17,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:17,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:17,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-15 12:31:17,398 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-15 12:31:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:17,399 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-15 12:31:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-15 12:31:17,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:17,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:17,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:17,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:31:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-15 12:31:17,401 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2022-04-15 12:31:17,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:17,402 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-15 12:31:17,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:17,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 50 transitions. [2022-04-15 12:31:17,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-15 12:31:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:31:17,445 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:17,445 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:17,445 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:31:17,445 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:17,445 INFO L85 PathProgramCache]: Analyzing trace with hash -512108736, now seen corresponding path program 1 times [2022-04-15 12:31:17,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:17,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2095142944] [2022-04-15 12:31:17,555 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:31:17,557 INFO L158 Benchmark]: Toolchain (without parser) took 2524.79ms. Allocated memory was 183.5MB in the beginning and 250.6MB in the end (delta: 67.1MB). Free memory was 131.3MB in the beginning and 142.5MB in the end (delta: -11.2MB). Peak memory consumption was 56.1MB. Max. memory is 8.0GB. [2022-04-15 12:31:17,558 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:31:17,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.16ms. Allocated memory was 183.5MB in the beginning and 250.6MB in the end (delta: 67.1MB). Free memory was 131.1MB in the beginning and 227.2MB in the end (delta: -96.0MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-04-15 12:31:17,558 INFO L158 Benchmark]: Boogie Preprocessor took 32.04ms. Allocated memory is still 250.6MB. Free memory was 227.1MB in the beginning and 225.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:31:17,558 INFO L158 Benchmark]: RCFGBuilder took 280.99ms. Allocated memory is still 250.6MB. Free memory was 225.1MB in the beginning and 211.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 12:31:17,559 INFO L158 Benchmark]: TraceAbstraction took 2037.06ms. Allocated memory is still 250.6MB. Free memory was 211.4MB in the beginning and 142.5MB in the end (delta: 68.9MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. [2022-04-15 12:31:17,560 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 165.16ms. Allocated memory was 183.5MB in the beginning and 250.6MB in the end (delta: 67.1MB). Free memory was 131.1MB in the beginning and 227.2MB in the end (delta: -96.0MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.04ms. Allocated memory is still 250.6MB. Free memory was 227.1MB in the beginning and 225.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 280.99ms. Allocated memory is still 250.6MB. Free memory was 225.1MB in the beginning and 211.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2037.06ms. Allocated memory is still 250.6MB. Free memory was 211.4MB in the beginning and 142.5MB in the end (delta: 68.9MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:31:17,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...