/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test09.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:02:04,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:02:04,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:02:04,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:02:04,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:02:04,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:02:04,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:02:04,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:02:04,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:02:04,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:02:04,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:02:04,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:02:04,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:02:04,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:02:04,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:02:04,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:02:04,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:02:04,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:02:04,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:02:04,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:02:04,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:02:04,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:02:04,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:02:04,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:02:04,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:02:04,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:02:04,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:02:04,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:02:04,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:02:04,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:02:04,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:02:04,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:02:04,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:02:04,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:02:04,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:02:04,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:02:04,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:02:04,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:02:04,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:02:04,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:02:04,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:02:04,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:02:04,516 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:02:04,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:02:04,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:02:04,518 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:02:04,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:02:04,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:02:04,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:02:04,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:02:04,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:02:04,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:02:04,520 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:02:04,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:02:04,520 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:02:04,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:02:04,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:02:04,521 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:02:04,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:02:04,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:02:04,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:02:04,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:02:04,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:02:04,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:02:04,523 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:02:04,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:02:04,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:02:04,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:02:04,841 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:02:04,841 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:02:04,842 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test09.c [2020-07-10 19:02:04,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f457fb4/3ccf1d4087ce4a5c83143c78d68d0685/FLAG98caf08cd [2020-07-10 19:02:05,348 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:02:05,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test09.c [2020-07-10 19:02:05,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f457fb4/3ccf1d4087ce4a5c83143c78d68d0685/FLAG98caf08cd [2020-07-10 19:02:05,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f457fb4/3ccf1d4087ce4a5c83143c78d68d0685 [2020-07-10 19:02:05,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:02:05,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:02:05,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:02:05,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:02:05,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:02:05,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:02:05" (1/1) ... [2020-07-10 19:02:05,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430027b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05, skipping insertion in model container [2020-07-10 19:02:05,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:02:05" (1/1) ... [2020-07-10 19:02:05,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:02:05,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:02:05,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:02:05,961 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:02:05,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:02:05,995 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:02:05,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05 WrapperNode [2020-07-10 19:02:05,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:02:05,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:02:05,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:02:05,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:02:06,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05" (1/1) ... [2020-07-10 19:02:06,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05" (1/1) ... [2020-07-10 19:02:06,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05" (1/1) ... [2020-07-10 19:02:06,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05" (1/1) ... [2020-07-10 19:02:06,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05" (1/1) ... [2020-07-10 19:02:06,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05" (1/1) ... [2020-07-10 19:02:06,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05" (1/1) ... [2020-07-10 19:02:06,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:02:06,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:02:06,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:02:06,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:02:06,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:02:06,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:02:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:02:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-10 19:02:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:02:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:02:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-10 19:02:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:02:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:02:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:02:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:02:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 19:02:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-10 19:02:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:02:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:02:06,550 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:02:06,550 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 19:02:06,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:02:06 BoogieIcfgContainer [2020-07-10 19:02:06,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:02:06,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:02:06,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:02:06,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:02:06,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:02:05" (1/3) ... [2020-07-10 19:02:06,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46250d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:02:06, skipping insertion in model container [2020-07-10 19:02:06,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:05" (2/3) ... [2020-07-10 19:02:06,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46250d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:02:06, skipping insertion in model container [2020-07-10 19:02:06,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:02:06" (3/3) ... [2020-07-10 19:02:06,562 INFO L109 eAbstractionObserver]: Analyzing ICFG test09.c [2020-07-10 19:02:06,572 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:02:06,579 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:02:06,593 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:02:06,615 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:02:06,615 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:02:06,615 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:02:06,616 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:02:06,616 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:02:06,616 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:02:06,616 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:02:06,616 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:02:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-10 19:02:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 19:02:06,642 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:06,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:02:06,643 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:06,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:06,648 INFO L82 PathProgramCache]: Analyzing trace with hash 19454853, now seen corresponding path program 1 times [2020-07-10 19:02:06,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:06,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1111485989] [2020-07-10 19:02:06,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:07,237 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {55#true} is VALID [2020-07-10 19:02:07,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#true} #valid := #valid[0 := 0]; {55#true} is VALID [2020-07-10 19:02:07,238 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#true} assume 0 < #StackHeapBarrier; {55#true} is VALID [2020-07-10 19:02:07,240 INFO L280 TraceCheckUtils]: 3: Hoare triple {55#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {85#(= 1 (select |#valid| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,241 INFO L280 TraceCheckUtils]: 4: Hoare triple {85#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {85#(= 1 (select |#valid| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,243 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,244 INFO L280 TraceCheckUtils]: 6: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,245 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := 0, 0; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,246 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} ~p2~0.base, ~p2~0.offset := 0, 0; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,247 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} assume true; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,248 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {68#(not (= |~#b~0.base| |~#a~0.base|))} {55#true} #56#return; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:07,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} SUMMARY for call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); srcloc: fENTRY {87#(= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))} is VALID [2020-07-10 19:02:07,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {87#(= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))} SUMMARY for call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L8 {88#(and (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)) (or (not (= 1 |f_#t~mem1|)) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))))} is VALID [2020-07-10 19:02:07,587 INFO L280 TraceCheckUtils]: 2: Hoare triple {88#(and (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)) (or (not (= 1 |f_#t~mem1|)) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))))} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L8-1 {89#(and (or (not (= 1 |f_#t~mem1|)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (= |f_#t~mem0| |f_#t~mem2|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)))} is VALID [2020-07-10 19:02:07,589 INFO L280 TraceCheckUtils]: 3: Hoare triple {89#(and (or (not (= 1 |f_#t~mem1|)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (= |f_#t~mem0| |f_#t~mem2|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)))} ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,589 INFO L280 TraceCheckUtils]: 4: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem1; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,590 INFO L280 TraceCheckUtils]: 5: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem2; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,592 INFO L280 TraceCheckUtils]: 6: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem0; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,594 INFO L280 TraceCheckUtils]: 7: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} assume !(1 == ~v~0); {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,595 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} #res := 0; {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,596 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} assume true; {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,597 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} #60#return; {56#false} is VALID [2020-07-10 19:02:07,601 INFO L263 TraceCheckUtils]: 0: Hoare triple {55#true} call ULTIMATE.init(); {84#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 19:02:07,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {55#true} is VALID [2020-07-10 19:02:07,602 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#true} #valid := #valid[0 := 0]; {55#true} is VALID [2020-07-10 19:02:07,602 INFO L280 TraceCheckUtils]: 3: Hoare triple {55#true} assume 0 < #StackHeapBarrier; {55#true} is VALID [2020-07-10 19:02:07,605 INFO L280 TraceCheckUtils]: 4: Hoare triple {55#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {85#(= 1 (select |#valid| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,606 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {85#(= 1 (select |#valid| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,607 INFO L280 TraceCheckUtils]: 6: Hoare triple {85#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,610 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := 0, 0; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,612 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} ~p2~0.base, ~p2~0.offset := 0, 0; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,612 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} assume true; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,614 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {68#(not (= |~#b~0.base| |~#a~0.base|))} {55#true} #56#return; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,614 INFO L263 TraceCheckUtils]: 12: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} call #t~ret7 := main(); {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 19:02:07,616 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; {69#(and (= ~p1~0.offset |~#a~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-10 19:02:07,619 INFO L280 TraceCheckUtils]: 14: Hoare triple {69#(and (= ~p1~0.offset |~#a~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#a~0.base| ~p1~0.base))} ~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset; {70#(and (= ~p1~0.offset |~#a~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))} is VALID [2020-07-10 19:02:07,621 INFO L280 TraceCheckUtils]: 15: Hoare triple {70#(and (= ~p1~0.offset |~#a~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))} SUMMARY for call write~int(1, ~#b~0.base, ~#b~0.offset, 4); srcloc: L22 {71#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-10 19:02:07,622 INFO L280 TraceCheckUtils]: 16: Hoare triple {71#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} SUMMARY for call write~int(5, ~#a~0.base, ~#a~0.offset, 4); srcloc: L22-1 {71#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-10 19:02:07,623 INFO L280 TraceCheckUtils]: 17: Hoare triple {71#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L23 {71#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-10 19:02:07,624 INFO L280 TraceCheckUtils]: 18: Hoare triple {71#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} #t~post4 := #t~mem3; {71#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-10 19:02:07,626 INFO L280 TraceCheckUtils]: 19: Hoare triple {71#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} SUMMARY for call write~int(#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4); srcloc: L25-1 {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-10 19:02:07,627 INFO L280 TraceCheckUtils]: 20: Hoare triple {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} havoc #t~post4; {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-10 19:02:07,628 INFO L280 TraceCheckUtils]: 21: Hoare triple {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} havoc #t~mem3; {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-10 19:02:07,629 INFO L263 TraceCheckUtils]: 22: Hoare triple {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} call #t~ret5 := f(); {86#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} is VALID [2020-07-10 19:02:07,630 INFO L280 TraceCheckUtils]: 23: Hoare triple {86#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} SUMMARY for call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); srcloc: fENTRY {87#(= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))} is VALID [2020-07-10 19:02:07,632 INFO L280 TraceCheckUtils]: 24: Hoare triple {87#(= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))} SUMMARY for call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L8 {88#(and (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)) (or (not (= 1 |f_#t~mem1|)) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))))} is VALID [2020-07-10 19:02:07,634 INFO L280 TraceCheckUtils]: 25: Hoare triple {88#(and (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)) (or (not (= 1 |f_#t~mem1|)) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))))} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L8-1 {89#(and (or (not (= 1 |f_#t~mem1|)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (= |f_#t~mem0| |f_#t~mem2|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)))} is VALID [2020-07-10 19:02:07,635 INFO L280 TraceCheckUtils]: 26: Hoare triple {89#(and (or (not (= 1 |f_#t~mem1|)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (= |f_#t~mem0| |f_#t~mem2|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)))} ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,637 INFO L280 TraceCheckUtils]: 27: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem1; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,639 INFO L280 TraceCheckUtils]: 28: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem2; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,641 INFO L280 TraceCheckUtils]: 29: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem0; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,643 INFO L280 TraceCheckUtils]: 30: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} assume !(1 == ~v~0); {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,644 INFO L280 TraceCheckUtils]: 31: Hoare triple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} #res := 0; {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,645 INFO L280 TraceCheckUtils]: 32: Hoare triple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} assume true; {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 19:02:07,647 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} #60#return; {56#false} is VALID [2020-07-10 19:02:07,647 INFO L280 TraceCheckUtils]: 34: Hoare triple {56#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {56#false} is VALID [2020-07-10 19:02:07,647 INFO L280 TraceCheckUtils]: 35: Hoare triple {56#false} SUMMARY for call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4); srcloc: L27-2 {56#false} is VALID [2020-07-10 19:02:07,648 INFO L280 TraceCheckUtils]: 36: Hoare triple {56#false} havoc #t~ret5; {56#false} is VALID [2020-07-10 19:02:07,648 INFO L280 TraceCheckUtils]: 37: Hoare triple {56#false} SUMMARY for call write~int(1000, ~p1~0.base, ~p1~0.offset, 4); srcloc: L29 {56#false} is VALID [2020-07-10 19:02:07,648 INFO L280 TraceCheckUtils]: 38: Hoare triple {56#false} SUMMARY for call #t~mem6 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L29-1 {56#false} is VALID [2020-07-10 19:02:07,649 INFO L280 TraceCheckUtils]: 39: Hoare triple {56#false} assume 1000 != #t~mem6; {56#false} is VALID [2020-07-10 19:02:07,649 INFO L280 TraceCheckUtils]: 40: Hoare triple {56#false} havoc #t~mem6; {56#false} is VALID [2020-07-10 19:02:07,649 INFO L280 TraceCheckUtils]: 41: Hoare triple {56#false} assume !false; {56#false} is VALID [2020-07-10 19:02:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:02:07,660 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:07,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1111485989] [2020-07-10 19:02:07,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:07,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 19:02:07,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514870710] [2020-07-10 19:02:07,671 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-10 19:02:07,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:07,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 19:02:07,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:07,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 19:02:07,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:07,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 19:02:07,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-07-10 19:02:07,762 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 15 states. [2020-07-10 19:02:08,895 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-07-10 19:02:09,075 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-07-10 19:02:09,270 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2020-07-10 19:02:09,484 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2020-07-10 19:02:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:10,383 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-07-10 19:02:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 19:02:10,384 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-10 19:02:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 19:02:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions. [2020-07-10 19:02:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 19:02:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions. [2020-07-10 19:02:10,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 70 transitions. [2020-07-10 19:02:10,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:10,517 INFO L225 Difference]: With dead ends: 69 [2020-07-10 19:02:10,517 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 19:02:10,521 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2020-07-10 19:02:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 19:02:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 19:02:10,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:10,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 19:02:10,735 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 19:02:10,736 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 19:02:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:10,741 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2020-07-10 19:02:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2020-07-10 19:02:10,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:10,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:10,742 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 19:02:10,743 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 19:02:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:10,748 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2020-07-10 19:02:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2020-07-10 19:02:10,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:10,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:10,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:10,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 19:02:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2020-07-10 19:02:10,755 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 42 [2020-07-10 19:02:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:10,755 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2020-07-10 19:02:10,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 19:02:10,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 43 transitions. [2020-07-10 19:02:10,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2020-07-10 19:02:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 19:02:10,830 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:10,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:02:10,831 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:02:10,831 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:10,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:10,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1202217324, now seen corresponding path program 1 times [2020-07-10 19:02:10,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:10,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1871123069] [2020-07-10 19:02:10,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:11,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {466#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {438#true} is VALID [2020-07-10 19:02:11,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {438#true} #valid := #valid[0 := 0]; {438#true} is VALID [2020-07-10 19:02:11,047 INFO L280 TraceCheckUtils]: 2: Hoare triple {438#true} assume 0 < #StackHeapBarrier; {438#true} is VALID [2020-07-10 19:02:11,047 INFO L280 TraceCheckUtils]: 3: Hoare triple {438#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {438#true} is VALID [2020-07-10 19:02:11,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {438#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {438#true} is VALID [2020-07-10 19:02:11,048 INFO L280 TraceCheckUtils]: 5: Hoare triple {438#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {438#true} is VALID [2020-07-10 19:02:11,048 INFO L280 TraceCheckUtils]: 6: Hoare triple {438#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {438#true} is VALID [2020-07-10 19:02:11,048 INFO L280 TraceCheckUtils]: 7: Hoare triple {438#true} ~p1~0.base, ~p1~0.offset := 0, 0; {438#true} is VALID [2020-07-10 19:02:11,048 INFO L280 TraceCheckUtils]: 8: Hoare triple {438#true} ~p2~0.base, ~p2~0.offset := 0, 0; {438#true} is VALID [2020-07-10 19:02:11,049 INFO L280 TraceCheckUtils]: 9: Hoare triple {438#true} assume true; {438#true} is VALID [2020-07-10 19:02:11,049 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {438#true} {438#true} #56#return; {438#true} is VALID [2020-07-10 19:02:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:11,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {467#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} SUMMARY for call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); srcloc: fENTRY {438#true} is VALID [2020-07-10 19:02:11,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {438#true} SUMMARY for call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L8 {438#true} is VALID [2020-07-10 19:02:11,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {438#true} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L8-1 {438#true} is VALID [2020-07-10 19:02:11,080 INFO L280 TraceCheckUtils]: 3: Hoare triple {438#true} ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; {438#true} is VALID [2020-07-10 19:02:11,080 INFO L280 TraceCheckUtils]: 4: Hoare triple {438#true} havoc #t~mem1; {438#true} is VALID [2020-07-10 19:02:11,081 INFO L280 TraceCheckUtils]: 5: Hoare triple {438#true} havoc #t~mem2; {438#true} is VALID [2020-07-10 19:02:11,081 INFO L280 TraceCheckUtils]: 6: Hoare triple {438#true} havoc #t~mem0; {438#true} is VALID [2020-07-10 19:02:11,082 INFO L280 TraceCheckUtils]: 7: Hoare triple {438#true} assume 1 == ~v~0; {438#true} is VALID [2020-07-10 19:02:11,084 INFO L280 TraceCheckUtils]: 8: Hoare triple {438#true} ~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset; {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,085 INFO L280 TraceCheckUtils]: 9: Hoare triple {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} #res := ~v~0; {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,086 INFO L280 TraceCheckUtils]: 10: Hoare triple {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} assume true; {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,087 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} {438#true} #60#return; {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,089 INFO L263 TraceCheckUtils]: 0: Hoare triple {438#true} call ULTIMATE.init(); {466#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 19:02:11,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {466#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {438#true} is VALID [2020-07-10 19:02:11,090 INFO L280 TraceCheckUtils]: 2: Hoare triple {438#true} #valid := #valid[0 := 0]; {438#true} is VALID [2020-07-10 19:02:11,090 INFO L280 TraceCheckUtils]: 3: Hoare triple {438#true} assume 0 < #StackHeapBarrier; {438#true} is VALID [2020-07-10 19:02:11,091 INFO L280 TraceCheckUtils]: 4: Hoare triple {438#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {438#true} is VALID [2020-07-10 19:02:11,091 INFO L280 TraceCheckUtils]: 5: Hoare triple {438#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {438#true} is VALID [2020-07-10 19:02:11,091 INFO L280 TraceCheckUtils]: 6: Hoare triple {438#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {438#true} is VALID [2020-07-10 19:02:11,092 INFO L280 TraceCheckUtils]: 7: Hoare triple {438#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {438#true} is VALID [2020-07-10 19:02:11,092 INFO L280 TraceCheckUtils]: 8: Hoare triple {438#true} ~p1~0.base, ~p1~0.offset := 0, 0; {438#true} is VALID [2020-07-10 19:02:11,092 INFO L280 TraceCheckUtils]: 9: Hoare triple {438#true} ~p2~0.base, ~p2~0.offset := 0, 0; {438#true} is VALID [2020-07-10 19:02:11,093 INFO L280 TraceCheckUtils]: 10: Hoare triple {438#true} assume true; {438#true} is VALID [2020-07-10 19:02:11,093 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {438#true} {438#true} #56#return; {438#true} is VALID [2020-07-10 19:02:11,093 INFO L263 TraceCheckUtils]: 12: Hoare triple {438#true} call #t~ret7 := main(); {438#true} is VALID [2020-07-10 19:02:11,093 INFO L280 TraceCheckUtils]: 13: Hoare triple {438#true} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; {438#true} is VALID [2020-07-10 19:02:11,094 INFO L280 TraceCheckUtils]: 14: Hoare triple {438#true} ~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset; {438#true} is VALID [2020-07-10 19:02:11,094 INFO L280 TraceCheckUtils]: 15: Hoare triple {438#true} SUMMARY for call write~int(1, ~#b~0.base, ~#b~0.offset, 4); srcloc: L22 {438#true} is VALID [2020-07-10 19:02:11,094 INFO L280 TraceCheckUtils]: 16: Hoare triple {438#true} SUMMARY for call write~int(5, ~#a~0.base, ~#a~0.offset, 4); srcloc: L22-1 {438#true} is VALID [2020-07-10 19:02:11,095 INFO L280 TraceCheckUtils]: 17: Hoare triple {438#true} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L23 {438#true} is VALID [2020-07-10 19:02:11,095 INFO L280 TraceCheckUtils]: 18: Hoare triple {438#true} #t~post4 := #t~mem3; {438#true} is VALID [2020-07-10 19:02:11,095 INFO L280 TraceCheckUtils]: 19: Hoare triple {438#true} SUMMARY for call write~int(#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4); srcloc: L25-1 {438#true} is VALID [2020-07-10 19:02:11,095 INFO L280 TraceCheckUtils]: 20: Hoare triple {438#true} havoc #t~post4; {438#true} is VALID [2020-07-10 19:02:11,096 INFO L280 TraceCheckUtils]: 21: Hoare triple {438#true} havoc #t~mem3; {438#true} is VALID [2020-07-10 19:02:11,097 INFO L263 TraceCheckUtils]: 22: Hoare triple {438#true} call #t~ret5 := f(); {467#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} is VALID [2020-07-10 19:02:11,098 INFO L280 TraceCheckUtils]: 23: Hoare triple {467#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} SUMMARY for call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); srcloc: fENTRY {438#true} is VALID [2020-07-10 19:02:11,098 INFO L280 TraceCheckUtils]: 24: Hoare triple {438#true} SUMMARY for call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L8 {438#true} is VALID [2020-07-10 19:02:11,098 INFO L280 TraceCheckUtils]: 25: Hoare triple {438#true} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L8-1 {438#true} is VALID [2020-07-10 19:02:11,099 INFO L280 TraceCheckUtils]: 26: Hoare triple {438#true} ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; {438#true} is VALID [2020-07-10 19:02:11,099 INFO L280 TraceCheckUtils]: 27: Hoare triple {438#true} havoc #t~mem1; {438#true} is VALID [2020-07-10 19:02:11,099 INFO L280 TraceCheckUtils]: 28: Hoare triple {438#true} havoc #t~mem2; {438#true} is VALID [2020-07-10 19:02:11,099 INFO L280 TraceCheckUtils]: 29: Hoare triple {438#true} havoc #t~mem0; {438#true} is VALID [2020-07-10 19:02:11,100 INFO L280 TraceCheckUtils]: 30: Hoare triple {438#true} assume 1 == ~v~0; {438#true} is VALID [2020-07-10 19:02:11,100 INFO L280 TraceCheckUtils]: 31: Hoare triple {438#true} ~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset; {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,101 INFO L280 TraceCheckUtils]: 32: Hoare triple {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} #res := ~v~0; {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,102 INFO L280 TraceCheckUtils]: 33: Hoare triple {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} assume true; {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,103 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} {438#true} #60#return; {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,105 INFO L280 TraceCheckUtils]: 35: Hoare triple {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,106 INFO L280 TraceCheckUtils]: 36: Hoare triple {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} SUMMARY for call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4); srcloc: L27-2 {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,107 INFO L280 TraceCheckUtils]: 37: Hoare triple {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} havoc #t~ret5; {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 19:02:11,108 INFO L280 TraceCheckUtils]: 38: Hoare triple {463#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} SUMMARY for call write~int(1000, ~p1~0.base, ~p1~0.offset, 4); srcloc: L29 {464#(= 1000 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))} is VALID [2020-07-10 19:02:11,109 INFO L280 TraceCheckUtils]: 39: Hoare triple {464#(= 1000 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))} SUMMARY for call #t~mem6 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L29-1 {465#(= 1000 |main_#t~mem6|)} is VALID [2020-07-10 19:02:11,110 INFO L280 TraceCheckUtils]: 40: Hoare triple {465#(= 1000 |main_#t~mem6|)} assume 1000 != #t~mem6; {439#false} is VALID [2020-07-10 19:02:11,111 INFO L280 TraceCheckUtils]: 41: Hoare triple {439#false} havoc #t~mem6; {439#false} is VALID [2020-07-10 19:02:11,111 INFO L280 TraceCheckUtils]: 42: Hoare triple {439#false} assume !false; {439#false} is VALID [2020-07-10 19:02:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:02:11,115 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:11,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1871123069] [2020-07-10 19:02:11,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:11,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 19:02:11,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610806887] [2020-07-10 19:02:11,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-10 19:02:11,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:11,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 19:02:11,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:11,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 19:02:11,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:11,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 19:02:11,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:02:11,166 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 7 states. [2020-07-10 19:02:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:11,699 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2020-07-10 19:02:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 19:02:11,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-10 19:02:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:02:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-10 19:02:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:02:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-10 19:02:11,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2020-07-10 19:02:11,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:11,759 INFO L225 Difference]: With dead ends: 44 [2020-07-10 19:02:11,759 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 19:02:11,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-10 19:02:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 19:02:11,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 19:02:11,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:11,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:11,762 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:11,762 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:11,762 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:02:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:11,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:11,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:11,763 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:11,763 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:11,763 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:02:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:11,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:11,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:11,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:11,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 19:02:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 19:02:11,765 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2020-07-10 19:02:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:11,765 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 19:02:11,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 19:02:11,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 19:02:11,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:11,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:11,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:02:11,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 19:02:12,881 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2020-07-10 19:02:13,099 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-07-10 19:02:13,642 INFO L264 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-10 19:02:13,643 INFO L264 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-10 19:02:13,643 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|)) [2020-07-10 19:02:13,643 INFO L264 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|)) [2020-07-10 19:02:13,643 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-10 19:02:13,643 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|)) [2020-07-10 19:02:13,643 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-10 19:02:13,643 INFO L264 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|)) [2020-07-10 19:02:13,643 INFO L264 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-10 19:02:13,644 INFO L264 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-10 19:02:13,644 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-10 19:02:13,644 INFO L264 CegarLoopResult]: At program point fFINAL(lines 7 15) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (= ~p2~0.offset ~p1~0.offset) (<= f_~v~0 1) (<= 1 f_~v~0) (= ~p2~0.base ~p1~0.base)) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,644 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (or (not (= ~p2~0.base |~#b~0.base|)) (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (= |~#a~0.base| ~p2~0.base) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#a~0.offset| |old(~p1~0.offset)|)) (not (= 1 (select |#valid| |~#a~0.base|))) (not (= |old(~p1~0.base)| |~#a~0.base|))) [2020-07-10 19:02:13,644 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (= ~p2~0.offset ~p1~0.offset) (<= f_~v~0 1) (<= 1 f_~v~0) (= ~p2~0.base ~p1~0.base)) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,644 INFO L264 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (<= f_~v~0 1) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (<= 1 f_~v~0)) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,645 INFO L264 CegarLoopResult]: At program point L9(lines 9 14) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (<= f_~v~0 1) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (<= 1 f_~v~0)) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,645 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,645 INFO L264 CegarLoopResult]: At program point fEXIT(lines 7 15) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (= ~p2~0.offset ~p1~0.offset) (<= f_~v~0 1) (<= 1 f_~v~0) (= ~p2~0.base ~p1~0.base)) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,645 INFO L264 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|)) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= 1 |f_#t~mem1|) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|)))) [2020-07-10 19:02:13,645 INFO L264 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= |f_#t~mem0| |f_#t~mem2|) (= 1 |f_#t~mem1|) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,646 INFO L264 CegarLoopResult]: At program point fENTRY(lines 7 15) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base)) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,646 INFO L264 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (<= f_~v~0 1) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (<= 1 f_~v~0) (= |f_#t~mem0| |f_#t~mem2|) (= 1 |f_#t~mem1|) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,646 INFO L264 CegarLoopResult]: At program point L8-4(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (<= f_~v~0 1) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (<= 1 f_~v~0) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,646 INFO L264 CegarLoopResult]: At program point L8-5(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (<= f_~v~0 1) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (<= 1 f_~v~0) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 19:02:13,646 INFO L264 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-10 19:02:13,647 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-10 19:02:13,647 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 19:02:13,647 INFO L264 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-10 19:02:13,647 INFO L264 CegarLoopResult]: At program point L31(lines 31 33) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= 1000 |main_#t~mem6|) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (= 1000 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)))) [2020-07-10 19:02:13,647 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-10 19:02:13,647 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))) [2020-07-10 19:02:13,647 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-07-10 19:02:13,648 INFO L264 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (or (and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (= 1000 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-10 19:02:13,648 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-10 19:02:13,648 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))) [2020-07-10 19:02:13,648 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-10 19:02:13,648 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))) [2020-07-10 19:02:13,648 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 17 39) the Hoare annotation is: true [2020-07-10 19:02:13,648 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-10 19:02:13,649 INFO L264 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))) [2020-07-10 19:02:13,649 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-10 19:02:13,649 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-10 19:02:13,649 INFO L264 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-10 19:02:13,649 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 17 39) the Hoare annotation is: true [2020-07-10 19:02:13,649 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-10 19:02:13,649 INFO L264 CegarLoopResult]: At program point L32(lines 17 39) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-10 19:02:13,650 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-10 19:02:13,650 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 17 39) the Hoare annotation is: (or (and (= |old(~p2~0.offset)| ~p2~0.offset) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= ~p2~0.base |old(~p2~0.base)|)) (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-10 19:02:13,650 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-10 19:02:13,650 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-10 19:02:13,650 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))) [2020-07-10 19:02:13,650 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-10 19:02:13,690 INFO L163 areAnnotationChecker]: CFG has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 19:02:13,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:13,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:13,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:02:13 BoogieIcfgContainer [2020-07-10 19:02:13,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:02:13,709 INFO L168 Benchmark]: Toolchain (without parser) took 7947.09 ms. Allocated memory was 140.5 MB in the beginning and 308.8 MB in the end (delta: 168.3 MB). Free memory was 105.2 MB in the beginning and 106.2 MB in the end (delta: -965.2 kB). Peak memory consumption was 167.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:13,709 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.5 MB. Free memory was 123.9 MB in the beginning and 123.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 19:02:13,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.22 ms. Allocated memory is still 140.5 MB. Free memory was 105.0 MB in the beginning and 94.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:13,711 INFO L168 Benchmark]: Boogie Preprocessor took 117.58 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 94.5 MB in the beginning and 181.7 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:13,712 INFO L168 Benchmark]: RCFGBuilder took 440.14 ms. Allocated memory is still 203.4 MB. Free memory was 181.7 MB in the beginning and 156.8 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:13,713 INFO L168 Benchmark]: TraceAbstraction took 7150.81 ms. Allocated memory was 203.4 MB in the beginning and 308.8 MB in the end (delta: 105.4 MB). Free memory was 156.8 MB in the beginning and 106.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 156.0 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:13,717 INFO L336 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.25 ms. Allocated memory is still 140.5 MB. Free memory was 123.9 MB in the beginning and 123.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 233.22 ms. Allocated memory is still 140.5 MB. Free memory was 105.0 MB in the beginning and 94.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.58 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 94.5 MB in the beginning and 181.7 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 440.14 ms. Allocated memory is still 203.4 MB. Free memory was 181.7 MB in the beginning and 156.8 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7150.81 ms. Allocated memory was 203.4 MB in the beginning and 308.8 MB in the end (delta: 105.4 MB). Free memory was 156.8 MB in the beginning and 106.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 156.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: a == b || !(1 == \valid[a]) - ProcedureContractResult [Line: 7]: Procedure Contract for f [2020-07-10 19:02:13,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:13,729 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:13,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:13,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure f: ((((((!(1 == unknown-#memory_int-unknown[a := unknown-#memory_int-unknown[a][a := 5]][p2][p2]) || (((p2 == p1 && v <= 1) && 1 <= v) && p2 == p1)) || !(p2 == b)) || !(b == p2)) || !(\old(p1) == a)) || !(1 == \valid[a])) || p2 == a) || !(\old(p1) == a) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.1s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 64 SDtfs, 144 SDslu, 242 SDs, 0 SdLazy, 298 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 66 NumberOfFragments, 1402 HoareAnnotationTreeSize, 52 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 52 FomulaSimplificationsInter, 1108 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...