/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/loops/lu.cmp.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:50,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:50,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:50,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:50,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:50,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:50,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:50,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:50,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:50,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:50,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:50,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:50,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:50,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:50,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:50,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:50,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:50,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:50,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:50,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:50,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:50,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:50,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:50,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:50,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:50,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:50,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:50,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:50,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:50,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:50,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:50,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:50,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:50,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:50,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:50,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:50,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:50,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:50,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:50,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:50,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:50,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:50,590 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:50,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:50,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:50,595 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:50,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:50,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:50,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:50,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:50,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:50,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:50,599 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:50,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:50,600 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:50,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:50,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:50,600 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:50,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:50,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:50,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:50,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:50,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:50,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:50,604 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:50,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:50,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:50,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:50,939 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:50,939 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:50,940 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/lu.cmp.c [2020-07-18 00:47:51,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ecb65c2/b61d633223394b748eea8252deadb28d/FLAG8f384d284 [2020-07-18 00:47:51,536 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:51,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c [2020-07-18 00:47:51,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ecb65c2/b61d633223394b748eea8252deadb28d/FLAG8f384d284 [2020-07-18 00:47:51,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ecb65c2/b61d633223394b748eea8252deadb28d [2020-07-18 00:47:51,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:51,883 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:51,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:51,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:51,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:51,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:51" (1/1) ... [2020-07-18 00:47:51,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44671aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:51, skipping insertion in model container [2020-07-18 00:47:51,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:51" (1/1) ... [2020-07-18 00:47:51,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:51,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:52,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:52,180 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:52,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:52,328 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:52,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:52 WrapperNode [2020-07-18 00:47:52,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:52,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:52,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:52,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:52,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:52" (1/1) ... [2020-07-18 00:47:52,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:52" (1/1) ... [2020-07-18 00:47:52,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:52" (1/1) ... [2020-07-18 00:47:52,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:52" (1/1) ... [2020-07-18 00:47:52,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:52" (1/1) ... [2020-07-18 00:47:52,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:52" (1/1) ... [2020-07-18 00:47:52,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:52" (1/1) ... [2020-07-18 00:47:52,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:52,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:52,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:52,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:52,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:52" (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-18 00:47:52,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:52,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:52,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:52,470 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2020-07-18 00:47:52,470 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:52,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2020-07-18 00:47:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2020-07-18 00:47:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2020-07-18 00:47:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-18 00:47:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-18 00:47:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:53,419 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:53,420 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-18 00:47:53,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:53 BoogieIcfgContainer [2020-07-18 00:47:53,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:53,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:53,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:53,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:53,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:51" (1/3) ... [2020-07-18 00:47:53,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726e576b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:53, skipping insertion in model container [2020-07-18 00:47:53,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:52" (2/3) ... [2020-07-18 00:47:53,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726e576b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:53, skipping insertion in model container [2020-07-18 00:47:53,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:53" (3/3) ... [2020-07-18 00:47:53,436 INFO L109 eAbstractionObserver]: Analyzing ICFG lu.cmp.c [2020-07-18 00:47:53,447 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:53,456 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:53,471 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:53,492 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:53,492 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:53,492 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:53,492 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:53,493 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:53,493 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:53,493 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:53,493 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states. [2020-07-18 00:47:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 00:47:53,525 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:53,526 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] [2020-07-18 00:47:53,526 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:53,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1445504148, now seen corresponding path program 1 times [2020-07-18 00:47:53,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:53,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [3531145] [2020-07-18 00:47:53,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:53,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {204#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {189#true} is VALID [2020-07-18 00:47:53,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} #valid := #valid[0 := 0]; {189#true} is VALID [2020-07-18 00:47:53,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#true} assume 0 < #StackHeapBarrier; {189#true} is VALID [2020-07-18 00:47:53,944 INFO L280 TraceCheckUtils]: 3: Hoare triple {189#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {189#true} is VALID [2020-07-18 00:47:53,944 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {189#true} is VALID [2020-07-18 00:47:53,945 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {189#true} is VALID [2020-07-18 00:47:53,945 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {189#true} is VALID [2020-07-18 00:47:53,945 INFO L280 TraceCheckUtils]: 7: Hoare triple {189#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {189#true} is VALID [2020-07-18 00:47:53,946 INFO L280 TraceCheckUtils]: 8: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {189#true} is VALID [2020-07-18 00:47:53,946 INFO L280 TraceCheckUtils]: 9: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-18 00:47:53,947 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {189#true} {189#true} #330#return; {189#true} is VALID [2020-07-18 00:47:53,952 INFO L263 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {204#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:47:53,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {204#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {189#true} is VALID [2020-07-18 00:47:53,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#true} #valid := #valid[0 := 0]; {189#true} is VALID [2020-07-18 00:47:53,953 INFO L280 TraceCheckUtils]: 3: Hoare triple {189#true} assume 0 < #StackHeapBarrier; {189#true} is VALID [2020-07-18 00:47:53,953 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {189#true} is VALID [2020-07-18 00:47:53,953 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {189#true} is VALID [2020-07-18 00:47:53,954 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {189#true} is VALID [2020-07-18 00:47:53,954 INFO L280 TraceCheckUtils]: 7: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {189#true} is VALID [2020-07-18 00:47:53,955 INFO L280 TraceCheckUtils]: 8: Hoare triple {189#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {189#true} is VALID [2020-07-18 00:47:53,955 INFO L280 TraceCheckUtils]: 9: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {189#true} is VALID [2020-07-18 00:47:53,955 INFO L280 TraceCheckUtils]: 10: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-18 00:47:53,956 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {189#true} {189#true} #330#return; {189#true} is VALID [2020-07-18 00:47:53,956 INFO L263 TraceCheckUtils]: 12: Hoare triple {189#true} call #t~ret33 := main(); {189#true} is VALID [2020-07-18 00:47:53,956 INFO L280 TraceCheckUtils]: 13: Hoare triple {189#true} havoc ~i~0; {189#true} is VALID [2020-07-18 00:47:53,957 INFO L280 TraceCheckUtils]: 14: Hoare triple {189#true} havoc ~j~0; {189#true} is VALID [2020-07-18 00:47:53,957 INFO L280 TraceCheckUtils]: 15: Hoare triple {189#true} ~nmax~0 := 50; {189#true} is VALID [2020-07-18 00:47:53,958 INFO L280 TraceCheckUtils]: 16: Hoare triple {189#true} ~n~0 := 5; {202#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:53,960 INFO L280 TraceCheckUtils]: 17: Hoare triple {202#(<= 5 main_~n~0)} havoc ~chkerr~0; {202#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:53,961 INFO L280 TraceCheckUtils]: 18: Hoare triple {202#(<= 5 main_~n~0)} havoc ~eps~0; {202#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:53,962 INFO L280 TraceCheckUtils]: 19: Hoare triple {202#(<= 5 main_~n~0)} havoc ~w~0; {202#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:53,965 INFO L280 TraceCheckUtils]: 20: Hoare triple {202#(<= 5 main_~n~0)} ~eps~0 := 1.0E-6; {202#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:53,966 INFO L280 TraceCheckUtils]: 21: Hoare triple {202#(<= 5 main_~n~0)} ~i~0 := 0; {202#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:53,968 INFO L280 TraceCheckUtils]: 22: Hoare triple {202#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0); {202#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:53,969 INFO L280 TraceCheckUtils]: 23: Hoare triple {202#(<= 5 main_~n~0)} ~w~0 := 0.0; {202#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:53,971 INFO L280 TraceCheckUtils]: 24: Hoare triple {202#(<= 5 main_~n~0)} ~j~0 := 0; {203#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:53,972 INFO L280 TraceCheckUtils]: 25: Hoare triple {203#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume !(~j~0 <= ~n~0); {190#false} is VALID [2020-07-18 00:47:53,972 INFO L263 TraceCheckUtils]: 26: Hoare triple {190#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {190#false} is VALID [2020-07-18 00:47:53,973 INFO L280 TraceCheckUtils]: 27: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2020-07-18 00:47:53,973 INFO L280 TraceCheckUtils]: 28: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2020-07-18 00:47:53,974 INFO L280 TraceCheckUtils]: 29: Hoare triple {190#false} assume !false; {190#false} is VALID [2020-07-18 00:47:53,979 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-18 00:47:53,989 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:53,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [3531145] [2020-07-18 00:47:53,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:53,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:53,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938360727] [2020-07-18 00:47:54,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 00:47:54,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:54,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:54,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:54,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:54,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:54,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:54,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:54,069 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 5 states. [2020-07-18 00:47:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:55,738 INFO L93 Difference]: Finished difference Result 367 states and 432 transitions. [2020-07-18 00:47:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:47:55,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 00:47:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 432 transitions. [2020-07-18 00:47:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 432 transitions. [2020-07-18 00:47:55,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 432 transitions. [2020-07-18 00:47:56,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:56,324 INFO L225 Difference]: With dead ends: 367 [2020-07-18 00:47:56,324 INFO L226 Difference]: Without dead ends: 64 [2020-07-18 00:47:56,331 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:47:56,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-18 00:47:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2020-07-18 00:47:56,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:56,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 49 states. [2020-07-18 00:47:56,545 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 49 states. [2020-07-18 00:47:56,545 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 49 states. [2020-07-18 00:47:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:56,555 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-18 00:47:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-18 00:47:56,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:56,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:56,558 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 64 states. [2020-07-18 00:47:56,558 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 64 states. [2020-07-18 00:47:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:56,564 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-18 00:47:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-18 00:47:56,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:56,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:56,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:56,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-18 00:47:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-18 00:47:56,573 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 30 [2020-07-18 00:47:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:56,578 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-18 00:47:56,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:56,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2020-07-18 00:47:56,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:56,680 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-18 00:47:56,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-18 00:47:56,682 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:56,682 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] [2020-07-18 00:47:56,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:56,682 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:56,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:56,683 INFO L82 PathProgramCache]: Analyzing trace with hash -905808642, now seen corresponding path program 1 times [2020-07-18 00:47:56,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:56,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [898258815] [2020-07-18 00:47:56,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:56,841 INFO L280 TraceCheckUtils]: 0: Hoare triple {1186#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1171#true} is VALID [2020-07-18 00:47:56,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {1171#true} #valid := #valid[0 := 0]; {1171#true} is VALID [2020-07-18 00:47:56,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {1171#true} assume 0 < #StackHeapBarrier; {1171#true} is VALID [2020-07-18 00:47:56,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {1171#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {1171#true} is VALID [2020-07-18 00:47:56,843 INFO L280 TraceCheckUtils]: 4: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1171#true} is VALID [2020-07-18 00:47:56,843 INFO L280 TraceCheckUtils]: 5: Hoare triple {1171#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {1171#true} is VALID [2020-07-18 00:47:56,843 INFO L280 TraceCheckUtils]: 6: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1171#true} is VALID [2020-07-18 00:47:56,844 INFO L280 TraceCheckUtils]: 7: Hoare triple {1171#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {1171#true} is VALID [2020-07-18 00:47:56,844 INFO L280 TraceCheckUtils]: 8: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1171#true} is VALID [2020-07-18 00:47:56,844 INFO L280 TraceCheckUtils]: 9: Hoare triple {1171#true} assume true; {1171#true} is VALID [2020-07-18 00:47:56,845 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1171#true} {1171#true} #330#return; {1171#true} is VALID [2020-07-18 00:47:56,847 INFO L263 TraceCheckUtils]: 0: Hoare triple {1171#true} call ULTIMATE.init(); {1186#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:47:56,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {1186#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1171#true} is VALID [2020-07-18 00:47:56,847 INFO L280 TraceCheckUtils]: 2: Hoare triple {1171#true} #valid := #valid[0 := 0]; {1171#true} is VALID [2020-07-18 00:47:56,848 INFO L280 TraceCheckUtils]: 3: Hoare triple {1171#true} assume 0 < #StackHeapBarrier; {1171#true} is VALID [2020-07-18 00:47:56,848 INFO L280 TraceCheckUtils]: 4: Hoare triple {1171#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {1171#true} is VALID [2020-07-18 00:47:56,848 INFO L280 TraceCheckUtils]: 5: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1171#true} is VALID [2020-07-18 00:47:56,849 INFO L280 TraceCheckUtils]: 6: Hoare triple {1171#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {1171#true} is VALID [2020-07-18 00:47:56,849 INFO L280 TraceCheckUtils]: 7: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1171#true} is VALID [2020-07-18 00:47:56,849 INFO L280 TraceCheckUtils]: 8: Hoare triple {1171#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {1171#true} is VALID [2020-07-18 00:47:56,850 INFO L280 TraceCheckUtils]: 9: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1171#true} is VALID [2020-07-18 00:47:56,850 INFO L280 TraceCheckUtils]: 10: Hoare triple {1171#true} assume true; {1171#true} is VALID [2020-07-18 00:47:56,850 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1171#true} {1171#true} #330#return; {1171#true} is VALID [2020-07-18 00:47:56,851 INFO L263 TraceCheckUtils]: 12: Hoare triple {1171#true} call #t~ret33 := main(); {1171#true} is VALID [2020-07-18 00:47:56,851 INFO L280 TraceCheckUtils]: 13: Hoare triple {1171#true} havoc ~i~0; {1171#true} is VALID [2020-07-18 00:47:56,851 INFO L280 TraceCheckUtils]: 14: Hoare triple {1171#true} havoc ~j~0; {1171#true} is VALID [2020-07-18 00:47:56,851 INFO L280 TraceCheckUtils]: 15: Hoare triple {1171#true} ~nmax~0 := 50; {1171#true} is VALID [2020-07-18 00:47:56,852 INFO L280 TraceCheckUtils]: 16: Hoare triple {1171#true} ~n~0 := 5; {1171#true} is VALID [2020-07-18 00:47:56,852 INFO L280 TraceCheckUtils]: 17: Hoare triple {1171#true} havoc ~chkerr~0; {1171#true} is VALID [2020-07-18 00:47:56,852 INFO L280 TraceCheckUtils]: 18: Hoare triple {1171#true} havoc ~eps~0; {1171#true} is VALID [2020-07-18 00:47:56,853 INFO L280 TraceCheckUtils]: 19: Hoare triple {1171#true} havoc ~w~0; {1171#true} is VALID [2020-07-18 00:47:56,853 INFO L280 TraceCheckUtils]: 20: Hoare triple {1171#true} ~eps~0 := 1.0E-6; {1171#true} is VALID [2020-07-18 00:47:56,854 INFO L280 TraceCheckUtils]: 21: Hoare triple {1171#true} ~i~0 := 0; {1184#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:56,855 INFO L280 TraceCheckUtils]: 22: Hoare triple {1184#(= 0 main_~i~0)} assume !!(~i~0 <= ~n~0); {1184#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:56,855 INFO L280 TraceCheckUtils]: 23: Hoare triple {1184#(= 0 main_~i~0)} ~w~0 := 0.0; {1184#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:56,856 INFO L280 TraceCheckUtils]: 24: Hoare triple {1184#(= 0 main_~i~0)} ~j~0 := 0; {1185#(and (= 0 main_~j~0) (= 0 main_~i~0))} is VALID [2020-07-18 00:47:56,857 INFO L280 TraceCheckUtils]: 25: Hoare triple {1185#(and (= 0 main_~j~0) (= 0 main_~i~0))} assume !!(~j~0 <= ~n~0); {1185#(and (= 0 main_~j~0) (= 0 main_~i~0))} is VALID [2020-07-18 00:47:56,858 INFO L280 TraceCheckUtils]: 26: Hoare triple {1185#(and (= 0 main_~j~0) (= 0 main_~i~0))} SUMMARY for call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L96 {1185#(and (= 0 main_~j~0) (= 0 main_~i~0))} is VALID [2020-07-18 00:47:56,859 INFO L280 TraceCheckUtils]: 27: Hoare triple {1185#(and (= 0 main_~j~0) (= 0 main_~i~0))} assume !(~i~0 == ~j~0); {1172#false} is VALID [2020-07-18 00:47:56,859 INFO L280 TraceCheckUtils]: 28: Hoare triple {1172#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {1172#false} is VALID [2020-07-18 00:47:56,860 INFO L280 TraceCheckUtils]: 29: Hoare triple {1172#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {1172#false} is VALID [2020-07-18 00:47:56,860 INFO L280 TraceCheckUtils]: 30: Hoare triple {1172#false} havoc #t~mem3; {1172#false} is VALID [2020-07-18 00:47:56,860 INFO L280 TraceCheckUtils]: 31: Hoare triple {1172#false} #t~post1 := ~j~0; {1172#false} is VALID [2020-07-18 00:47:56,861 INFO L280 TraceCheckUtils]: 32: Hoare triple {1172#false} ~j~0 := 1 + #t~post1; {1172#false} is VALID [2020-07-18 00:47:56,861 INFO L280 TraceCheckUtils]: 33: Hoare triple {1172#false} havoc #t~post1; {1172#false} is VALID [2020-07-18 00:47:56,861 INFO L280 TraceCheckUtils]: 34: Hoare triple {1172#false} assume !(~j~0 <= ~n~0); {1172#false} is VALID [2020-07-18 00:47:56,862 INFO L263 TraceCheckUtils]: 35: Hoare triple {1172#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1172#false} is VALID [2020-07-18 00:47:56,862 INFO L280 TraceCheckUtils]: 36: Hoare triple {1172#false} ~cond := #in~cond; {1172#false} is VALID [2020-07-18 00:47:56,862 INFO L280 TraceCheckUtils]: 37: Hoare triple {1172#false} assume 0 == ~cond; {1172#false} is VALID [2020-07-18 00:47:56,863 INFO L280 TraceCheckUtils]: 38: Hoare triple {1172#false} assume !false; {1172#false} is VALID [2020-07-18 00:47:56,868 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-18 00:47:56,871 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:56,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [898258815] [2020-07-18 00:47:56,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:56,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:56,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140354081] [2020-07-18 00:47:56,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-18 00:47:56,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:56,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:56,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:56,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:56,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:56,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:56,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:56,914 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2020-07-18 00:47:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:57,551 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2020-07-18 00:47:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:47:57,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-18 00:47:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-18 00:47:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-18 00:47:57,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 109 transitions. [2020-07-18 00:47:57,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:57,696 INFO L225 Difference]: With dead ends: 103 [2020-07-18 00:47:57,696 INFO L226 Difference]: Without dead ends: 76 [2020-07-18 00:47:57,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:47:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-18 00:47:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2020-07-18 00:47:57,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:57,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 55 states. [2020-07-18 00:47:57,865 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 55 states. [2020-07-18 00:47:57,866 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 55 states. [2020-07-18 00:47:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:57,870 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2020-07-18 00:47:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2020-07-18 00:47:57,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:57,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:57,872 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 76 states. [2020-07-18 00:47:57,872 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 76 states. [2020-07-18 00:47:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:57,876 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2020-07-18 00:47:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2020-07-18 00:47:57,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:57,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:57,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:57,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-18 00:47:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-07-18 00:47:57,881 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 39 [2020-07-18 00:47:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:57,881 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-07-18 00:47:57,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:57,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2020-07-18 00:47:57,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-18 00:47:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-18 00:47:57,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:57,963 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-18 00:47:57,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:57,964 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash -361483259, now seen corresponding path program 1 times [2020-07-18 00:47:57,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:57,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854809082] [2020-07-18 00:47:57,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:58,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {1677#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1661#true} is VALID [2020-07-18 00:47:58,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {1661#true} #valid := #valid[0 := 0]; {1661#true} is VALID [2020-07-18 00:47:58,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {1661#true} assume 0 < #StackHeapBarrier; {1661#true} is VALID [2020-07-18 00:47:58,140 INFO L280 TraceCheckUtils]: 3: Hoare triple {1661#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {1661#true} is VALID [2020-07-18 00:47:58,140 INFO L280 TraceCheckUtils]: 4: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1661#true} is VALID [2020-07-18 00:47:58,141 INFO L280 TraceCheckUtils]: 5: Hoare triple {1661#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {1661#true} is VALID [2020-07-18 00:47:58,142 INFO L280 TraceCheckUtils]: 6: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1661#true} is VALID [2020-07-18 00:47:58,142 INFO L280 TraceCheckUtils]: 7: Hoare triple {1661#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {1661#true} is VALID [2020-07-18 00:47:58,142 INFO L280 TraceCheckUtils]: 8: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1661#true} is VALID [2020-07-18 00:47:58,143 INFO L280 TraceCheckUtils]: 9: Hoare triple {1661#true} assume true; {1661#true} is VALID [2020-07-18 00:47:58,143 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1661#true} {1661#true} #330#return; {1661#true} is VALID [2020-07-18 00:47:58,148 INFO L263 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1677#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:47:58,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {1677#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1661#true} is VALID [2020-07-18 00:47:58,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {1661#true} #valid := #valid[0 := 0]; {1661#true} is VALID [2020-07-18 00:47:58,150 INFO L280 TraceCheckUtils]: 3: Hoare triple {1661#true} assume 0 < #StackHeapBarrier; {1661#true} is VALID [2020-07-18 00:47:58,150 INFO L280 TraceCheckUtils]: 4: Hoare triple {1661#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {1661#true} is VALID [2020-07-18 00:47:58,150 INFO L280 TraceCheckUtils]: 5: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1661#true} is VALID [2020-07-18 00:47:58,150 INFO L280 TraceCheckUtils]: 6: Hoare triple {1661#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {1661#true} is VALID [2020-07-18 00:47:58,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1661#true} is VALID [2020-07-18 00:47:58,151 INFO L280 TraceCheckUtils]: 8: Hoare triple {1661#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {1661#true} is VALID [2020-07-18 00:47:58,156 INFO L280 TraceCheckUtils]: 9: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1661#true} is VALID [2020-07-18 00:47:58,157 INFO L280 TraceCheckUtils]: 10: Hoare triple {1661#true} assume true; {1661#true} is VALID [2020-07-18 00:47:58,157 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1661#true} {1661#true} #330#return; {1661#true} is VALID [2020-07-18 00:47:58,157 INFO L263 TraceCheckUtils]: 12: Hoare triple {1661#true} call #t~ret33 := main(); {1661#true} is VALID [2020-07-18 00:47:58,158 INFO L280 TraceCheckUtils]: 13: Hoare triple {1661#true} havoc ~i~0; {1661#true} is VALID [2020-07-18 00:47:58,158 INFO L280 TraceCheckUtils]: 14: Hoare triple {1661#true} havoc ~j~0; {1661#true} is VALID [2020-07-18 00:47:58,158 INFO L280 TraceCheckUtils]: 15: Hoare triple {1661#true} ~nmax~0 := 50; {1661#true} is VALID [2020-07-18 00:47:58,159 INFO L280 TraceCheckUtils]: 16: Hoare triple {1661#true} ~n~0 := 5; {1661#true} is VALID [2020-07-18 00:47:58,159 INFO L280 TraceCheckUtils]: 17: Hoare triple {1661#true} havoc ~chkerr~0; {1661#true} is VALID [2020-07-18 00:47:58,159 INFO L280 TraceCheckUtils]: 18: Hoare triple {1661#true} havoc ~eps~0; {1661#true} is VALID [2020-07-18 00:47:58,159 INFO L280 TraceCheckUtils]: 19: Hoare triple {1661#true} havoc ~w~0; {1661#true} is VALID [2020-07-18 00:47:58,160 INFO L280 TraceCheckUtils]: 20: Hoare triple {1661#true} ~eps~0 := 1.0E-6; {1661#true} is VALID [2020-07-18 00:47:58,175 INFO L280 TraceCheckUtils]: 21: Hoare triple {1661#true} ~i~0 := 0; {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,179 INFO L280 TraceCheckUtils]: 22: Hoare triple {1674#(= 0 main_~i~0)} assume !!(~i~0 <= ~n~0); {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,180 INFO L280 TraceCheckUtils]: 23: Hoare triple {1674#(= 0 main_~i~0)} ~w~0 := 0.0; {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,180 INFO L280 TraceCheckUtils]: 24: Hoare triple {1674#(= 0 main_~i~0)} ~j~0 := 0; {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,181 INFO L280 TraceCheckUtils]: 25: Hoare triple {1674#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,183 INFO L280 TraceCheckUtils]: 26: Hoare triple {1674#(= 0 main_~i~0)} SUMMARY for call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L96 {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,184 INFO L280 TraceCheckUtils]: 27: Hoare triple {1674#(= 0 main_~i~0)} assume ~i~0 == ~j~0; {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,185 INFO L280 TraceCheckUtils]: 28: Hoare triple {1674#(= 0 main_~i~0)} SUMMARY for call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97 {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,186 INFO L280 TraceCheckUtils]: 29: Hoare triple {1674#(= 0 main_~i~0)} SUMMARY for call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-1 {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,186 INFO L280 TraceCheckUtils]: 30: Hoare triple {1674#(= 0 main_~i~0)} havoc #t~mem2; {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,187 INFO L280 TraceCheckUtils]: 31: Hoare triple {1674#(= 0 main_~i~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,187 INFO L280 TraceCheckUtils]: 32: Hoare triple {1674#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,187 INFO L280 TraceCheckUtils]: 33: Hoare triple {1674#(= 0 main_~i~0)} havoc #t~mem3; {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,189 INFO L280 TraceCheckUtils]: 34: Hoare triple {1674#(= 0 main_~i~0)} #t~post1 := ~j~0; {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,189 INFO L280 TraceCheckUtils]: 35: Hoare triple {1674#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,189 INFO L280 TraceCheckUtils]: 36: Hoare triple {1674#(= 0 main_~i~0)} havoc #t~post1; {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,190 INFO L280 TraceCheckUtils]: 37: Hoare triple {1674#(= 0 main_~i~0)} assume !(~j~0 <= ~n~0); {1674#(= 0 main_~i~0)} is VALID [2020-07-18 00:47:58,191 INFO L263 TraceCheckUtils]: 38: Hoare triple {1674#(= 0 main_~i~0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1675#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:47:58,192 INFO L280 TraceCheckUtils]: 39: Hoare triple {1675#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1676#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:47:58,193 INFO L280 TraceCheckUtils]: 40: Hoare triple {1676#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1662#false} is VALID [2020-07-18 00:47:58,193 INFO L280 TraceCheckUtils]: 41: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2020-07-18 00:47:58,197 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-18 00:47:58,197 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:58,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854809082] [2020-07-18 00:47:58,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:58,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:47:58,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060779156] [2020-07-18 00:47:58,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-18 00:47:58,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:58,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:47:58,252 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-18 00:47:58,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:47:58,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:58,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:47:58,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:58,253 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 6 states. [2020-07-18 00:47:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:59,080 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2020-07-18 00:47:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:47:59,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-18 00:47:59,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:47:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-18 00:47:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:47:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-18 00:47:59,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2020-07-18 00:47:59,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:59,192 INFO L225 Difference]: With dead ends: 77 [2020-07-18 00:47:59,192 INFO L226 Difference]: Without dead ends: 75 [2020-07-18 00:47:59,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:47:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-18 00:47:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-07-18 00:47:59,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:59,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 72 states. [2020-07-18 00:47:59,409 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 72 states. [2020-07-18 00:47:59,409 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 72 states. [2020-07-18 00:47:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:59,412 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2020-07-18 00:47:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-07-18 00:47:59,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:59,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:59,413 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 75 states. [2020-07-18 00:47:59,413 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 75 states. [2020-07-18 00:47:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:59,417 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2020-07-18 00:47:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-07-18 00:47:59,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:59,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:59,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:59,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-18 00:47:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2020-07-18 00:47:59,424 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 42 [2020-07-18 00:47:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:59,424 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2020-07-18 00:47:59,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:47:59,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2020-07-18 00:47:59,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-18 00:47:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-18 00:47:59,536 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:59,536 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-18 00:47:59,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:59,537 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:59,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:59,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1960696442, now seen corresponding path program 1 times [2020-07-18 00:47:59,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:59,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1857894084] [2020-07-18 00:47:59,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:59,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {2157#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {2136#true} is VALID [2020-07-18 00:47:59,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {2136#true} #valid := #valid[0 := 0]; {2136#true} is VALID [2020-07-18 00:47:59,782 INFO L280 TraceCheckUtils]: 2: Hoare triple {2136#true} assume 0 < #StackHeapBarrier; {2136#true} is VALID [2020-07-18 00:47:59,782 INFO L280 TraceCheckUtils]: 3: Hoare triple {2136#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {2136#true} is VALID [2020-07-18 00:47:59,783 INFO L280 TraceCheckUtils]: 4: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {2136#true} is VALID [2020-07-18 00:47:59,783 INFO L280 TraceCheckUtils]: 5: Hoare triple {2136#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {2136#true} is VALID [2020-07-18 00:47:59,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {2136#true} is VALID [2020-07-18 00:47:59,784 INFO L280 TraceCheckUtils]: 7: Hoare triple {2136#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {2136#true} is VALID [2020-07-18 00:47:59,784 INFO L280 TraceCheckUtils]: 8: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2136#true} is VALID [2020-07-18 00:47:59,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-18 00:47:59,785 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2136#true} {2136#true} #330#return; {2136#true} is VALID [2020-07-18 00:47:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:59,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {2136#true} ~cond := #in~cond; {2136#true} is VALID [2020-07-18 00:47:59,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {2136#true} assume !(0 == ~cond); {2136#true} is VALID [2020-07-18 00:47:59,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-18 00:47:59,795 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2136#true} {2137#false} #334#return; {2137#false} is VALID [2020-07-18 00:47:59,798 INFO L263 TraceCheckUtils]: 0: Hoare triple {2136#true} call ULTIMATE.init(); {2157#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:47:59,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {2157#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {2136#true} is VALID [2020-07-18 00:47:59,798 INFO L280 TraceCheckUtils]: 2: Hoare triple {2136#true} #valid := #valid[0 := 0]; {2136#true} is VALID [2020-07-18 00:47:59,799 INFO L280 TraceCheckUtils]: 3: Hoare triple {2136#true} assume 0 < #StackHeapBarrier; {2136#true} is VALID [2020-07-18 00:47:59,799 INFO L280 TraceCheckUtils]: 4: Hoare triple {2136#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {2136#true} is VALID [2020-07-18 00:47:59,799 INFO L280 TraceCheckUtils]: 5: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {2136#true} is VALID [2020-07-18 00:47:59,800 INFO L280 TraceCheckUtils]: 6: Hoare triple {2136#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {2136#true} is VALID [2020-07-18 00:47:59,800 INFO L280 TraceCheckUtils]: 7: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {2136#true} is VALID [2020-07-18 00:47:59,800 INFO L280 TraceCheckUtils]: 8: Hoare triple {2136#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {2136#true} is VALID [2020-07-18 00:47:59,800 INFO L280 TraceCheckUtils]: 9: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2136#true} is VALID [2020-07-18 00:47:59,801 INFO L280 TraceCheckUtils]: 10: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-18 00:47:59,801 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2136#true} {2136#true} #330#return; {2136#true} is VALID [2020-07-18 00:47:59,801 INFO L263 TraceCheckUtils]: 12: Hoare triple {2136#true} call #t~ret33 := main(); {2136#true} is VALID [2020-07-18 00:47:59,802 INFO L280 TraceCheckUtils]: 13: Hoare triple {2136#true} havoc ~i~0; {2136#true} is VALID [2020-07-18 00:47:59,802 INFO L280 TraceCheckUtils]: 14: Hoare triple {2136#true} havoc ~j~0; {2136#true} is VALID [2020-07-18 00:47:59,802 INFO L280 TraceCheckUtils]: 15: Hoare triple {2136#true} ~nmax~0 := 50; {2136#true} is VALID [2020-07-18 00:47:59,803 INFO L280 TraceCheckUtils]: 16: Hoare triple {2136#true} ~n~0 := 5; {2149#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:59,804 INFO L280 TraceCheckUtils]: 17: Hoare triple {2149#(<= 5 main_~n~0)} havoc ~chkerr~0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:59,804 INFO L280 TraceCheckUtils]: 18: Hoare triple {2149#(<= 5 main_~n~0)} havoc ~eps~0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:59,805 INFO L280 TraceCheckUtils]: 19: Hoare triple {2149#(<= 5 main_~n~0)} havoc ~w~0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:59,806 INFO L280 TraceCheckUtils]: 20: Hoare triple {2149#(<= 5 main_~n~0)} ~eps~0 := 1.0E-6; {2149#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:59,807 INFO L280 TraceCheckUtils]: 21: Hoare triple {2149#(<= 5 main_~n~0)} ~i~0 := 0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:59,807 INFO L280 TraceCheckUtils]: 22: Hoare triple {2149#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0); {2149#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:59,808 INFO L280 TraceCheckUtils]: 23: Hoare triple {2149#(<= 5 main_~n~0)} ~w~0 := 0.0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-18 00:47:59,809 INFO L280 TraceCheckUtils]: 24: Hoare triple {2149#(<= 5 main_~n~0)} ~j~0 := 0; {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:59,810 INFO L280 TraceCheckUtils]: 25: Hoare triple {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume !!(~j~0 <= ~n~0); {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:59,811 INFO L280 TraceCheckUtils]: 26: Hoare triple {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} SUMMARY for call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L96 {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:59,812 INFO L280 TraceCheckUtils]: 27: Hoare triple {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume ~i~0 == ~j~0; {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:59,812 INFO L280 TraceCheckUtils]: 28: Hoare triple {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} SUMMARY for call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97 {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:59,813 INFO L280 TraceCheckUtils]: 29: Hoare triple {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} SUMMARY for call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-1 {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:59,814 INFO L280 TraceCheckUtils]: 30: Hoare triple {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} havoc #t~mem2; {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:59,815 INFO L280 TraceCheckUtils]: 31: Hoare triple {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:59,816 INFO L280 TraceCheckUtils]: 32: Hoare triple {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:59,817 INFO L280 TraceCheckUtils]: 33: Hoare triple {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} havoc #t~mem3; {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-18 00:47:59,818 INFO L280 TraceCheckUtils]: 34: Hoare triple {2150#(and (<= 5 main_~n~0) (= 0 main_~j~0))} #t~post1 := ~j~0; {2151#(and (<= 5 main_~n~0) (= |main_#t~post1| 0))} is VALID [2020-07-18 00:47:59,819 INFO L280 TraceCheckUtils]: 35: Hoare triple {2151#(and (<= 5 main_~n~0) (= |main_#t~post1| 0))} ~j~0 := 1 + #t~post1; {2152#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-18 00:47:59,820 INFO L280 TraceCheckUtils]: 36: Hoare triple {2152#(<= (+ main_~j~0 4) main_~n~0)} havoc #t~post1; {2152#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-18 00:47:59,821 INFO L280 TraceCheckUtils]: 37: Hoare triple {2152#(<= (+ main_~j~0 4) main_~n~0)} assume !(~j~0 <= ~n~0); {2137#false} is VALID [2020-07-18 00:47:59,821 INFO L263 TraceCheckUtils]: 38: Hoare triple {2137#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {2136#true} is VALID [2020-07-18 00:47:59,821 INFO L280 TraceCheckUtils]: 39: Hoare triple {2136#true} ~cond := #in~cond; {2136#true} is VALID [2020-07-18 00:47:59,822 INFO L280 TraceCheckUtils]: 40: Hoare triple {2136#true} assume !(0 == ~cond); {2136#true} is VALID [2020-07-18 00:47:59,822 INFO L280 TraceCheckUtils]: 41: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-18 00:47:59,822 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2136#true} {2137#false} #334#return; {2137#false} is VALID [2020-07-18 00:47:59,823 INFO L280 TraceCheckUtils]: 43: Hoare triple {2137#false} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {2137#false} is VALID [2020-07-18 00:47:59,823 INFO L280 TraceCheckUtils]: 44: Hoare triple {2137#false} #t~post0 := ~i~0; {2137#false} is VALID [2020-07-18 00:47:59,823 INFO L280 TraceCheckUtils]: 45: Hoare triple {2137#false} ~i~0 := 1 + #t~post0; {2137#false} is VALID [2020-07-18 00:47:59,824 INFO L280 TraceCheckUtils]: 46: Hoare triple {2137#false} havoc #t~post0; {2137#false} is VALID [2020-07-18 00:47:59,824 INFO L280 TraceCheckUtils]: 47: Hoare triple {2137#false} assume !!(~i~0 <= ~n~0); {2137#false} is VALID [2020-07-18 00:47:59,824 INFO L280 TraceCheckUtils]: 48: Hoare triple {2137#false} ~w~0 := 0.0; {2137#false} is VALID [2020-07-18 00:47:59,824 INFO L280 TraceCheckUtils]: 49: Hoare triple {2137#false} ~j~0 := 0; {2137#false} is VALID [2020-07-18 00:47:59,825 INFO L280 TraceCheckUtils]: 50: Hoare triple {2137#false} assume !!(~j~0 <= ~n~0); {2137#false} is VALID [2020-07-18 00:47:59,825 INFO L280 TraceCheckUtils]: 51: Hoare triple {2137#false} SUMMARY for call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L96 {2137#false} is VALID [2020-07-18 00:47:59,825 INFO L280 TraceCheckUtils]: 52: Hoare triple {2137#false} assume !(~i~0 == ~j~0); {2137#false} is VALID [2020-07-18 00:47:59,826 INFO L280 TraceCheckUtils]: 53: Hoare triple {2137#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {2137#false} is VALID [2020-07-18 00:47:59,826 INFO L280 TraceCheckUtils]: 54: Hoare triple {2137#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {2137#false} is VALID [2020-07-18 00:47:59,826 INFO L280 TraceCheckUtils]: 55: Hoare triple {2137#false} havoc #t~mem3; {2137#false} is VALID [2020-07-18 00:47:59,826 INFO L280 TraceCheckUtils]: 56: Hoare triple {2137#false} #t~post1 := ~j~0; {2137#false} is VALID [2020-07-18 00:47:59,827 INFO L280 TraceCheckUtils]: 57: Hoare triple {2137#false} ~j~0 := 1 + #t~post1; {2137#false} is VALID [2020-07-18 00:47:59,827 INFO L280 TraceCheckUtils]: 58: Hoare triple {2137#false} havoc #t~post1; {2137#false} is VALID [2020-07-18 00:47:59,827 INFO L280 TraceCheckUtils]: 59: Hoare triple {2137#false} assume !(~j~0 <= ~n~0); {2137#false} is VALID [2020-07-18 00:47:59,827 INFO L263 TraceCheckUtils]: 60: Hoare triple {2137#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {2137#false} is VALID [2020-07-18 00:47:59,827 INFO L280 TraceCheckUtils]: 61: Hoare triple {2137#false} ~cond := #in~cond; {2137#false} is VALID [2020-07-18 00:47:59,828 INFO L280 TraceCheckUtils]: 62: Hoare triple {2137#false} assume 0 == ~cond; {2137#false} is VALID [2020-07-18 00:47:59,828 INFO L280 TraceCheckUtils]: 63: Hoare triple {2137#false} assume !false; {2137#false} is VALID [2020-07-18 00:47:59,834 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-18 00:47:59,848 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_real_60| (Array Int (Array Int Real)))) (= (store |v_#memory_real_60| |c_~#b~0.base| (store (select |v_#memory_real_60| |c_~#b~0.base|) (+ |c_~#b~0.offset| (* c_main_~i~0 8)) c_main_~w~0)) |c_#memory_real|)) is different from true [2020-07-18 00:47:59,924 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_real_60| (Array Int (Array Int Real)))) (= |c_#memory_real| (store |v_#memory_real_60| |c_~#b~0.base| (store (select |v_#memory_real_60| |c_~#b~0.base|) (+ |c_~#b~0.offset| (* c_main_~i~0 8) (- 8)) c_main_~w~0)))) is different from true [2020-07-18 00:48:00,967 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:00,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1857894084] [2020-07-18 00:48:00,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:00,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-07-18 00:48:00,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411735120] [2020-07-18 00:48:00,969 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64 [2020-07-18 00:48:00,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:00,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2020-07-18 00:48:01,073 WARN L140 InductivityCheck]: Transition 2174#(and (not (= main_~j~0 (+ main_~i~0 1))) (<= main_~i~0 main_~n~0) (exists ((|v_#memory_real_61| (Array Int (Array Int Real))) (v_~convertINTToDOUBLE_2 Real)) (and (= (store |v_#memory_real_61| |~#a~0.base| (store (select |v_#memory_real_61| |~#a~0.base|) (+ (* main_~i~0 400) (* main_~j~0 8) |~#a~0.offset| (- 8)) v_~convertINTToDOUBLE_2)) |#memory_real|) (exists ((v_main_~w~0_9 Real) (|v_#memory_real_60| (Array Int (Array Int Real)))) (= (store |v_#memory_real_60| |~#b~0.base| (store (select |v_#memory_real_60| |~#b~0.base|) (+ |~#b~0.offset| (* main_~i~0 8) (- 8)) v_main_~w~0_9)) |v_#memory_real_61|)))) (= 1 main_~j~0) (<= main_~j~0 (+ main_~n~0 1)) (< main_~n~0 main_~j~0)) ( _ , call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); , 2175#(and (exists ((v_main_~i~0_21 Int)) (and (= |__VERIFIER_assert_#in~cond| (ite (< v_main_~i~0_21 50) 1 0)) (not (= main_~j~0 (+ v_main_~i~0_21 1))) (<= v_main_~i~0_21 main_~n~0) (exists ((|v_#memory_real_61| (Array Int (Array Int Real))) (v_~convertINTToDOUBLE_2 Real)) (and (exists ((v_main_~w~0_9 Real) (|v_#memory_real_60| (Array Int (Array Int Real)))) (= (store |v_#memory_real_60| |~#b~0.base| (store (select |v_#memory_real_60| |~#b~0.base|) (+ |~#b~0.offset| (* v_main_~i~0_21 8) (- 8)) v_main_~w~0_9)) |v_#memory_real_61|)) (= |#memory_real| (store |v_#memory_real_61| |~#a~0.base| (store (select |v_#memory_real_61| |~#a~0.base|) (+ (* main_~j~0 8) |~#a~0.offset| (* v_main_~i~0_21 400) (- 8)) v_~convertINTToDOUBLE_2))))))) (= 1 main_~j~0) (<= main_~j~0 (+ main_~n~0 1)) (< main_~n~0 main_~j~0)) ) not inductive [2020-07-18 00:48:01,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:48:01,075 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:48:01,082 INFO L168 Benchmark]: Toolchain (without parser) took 9199.80 ms. Allocated memory was 137.4 MB in the beginning and 322.4 MB in the end (delta: 185.1 MB). Free memory was 102.5 MB in the beginning and 157.5 MB in the end (delta: -54.9 MB). Peak memory consumption was 130.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:01,083 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 00:48:01,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.45 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 102.3 MB in the beginning and 176.9 MB in the end (delta: -74.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:01,090 INFO L168 Benchmark]: Boogie Preprocessor took 74.14 ms. Allocated memory is still 200.8 MB. Free memory was 176.9 MB in the beginning and 174.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:01,093 INFO L168 Benchmark]: RCFGBuilder took 1023.03 ms. Allocated memory is still 200.8 MB. Free memory was 173.5 MB in the beginning and 107.8 MB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:01,094 INFO L168 Benchmark]: TraceAbstraction took 7650.76 ms. Allocated memory was 200.8 MB in the beginning and 322.4 MB in the end (delta: 121.6 MB). Free memory was 107.8 MB in the beginning and 157.5 MB in the end (delta: -49.6 MB). Peak memory consumption was 72.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:01,104 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.87 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 445.45 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 102.3 MB in the beginning and 176.9 MB in the end (delta: -74.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.14 ms. Allocated memory is still 200.8 MB. Free memory was 176.9 MB in the beginning and 174.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1023.03 ms. Allocated memory is still 200.8 MB. Free memory was 173.5 MB in the beginning and 107.8 MB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7650.76 ms. Allocated memory was 200.8 MB in the beginning and 322.4 MB in the end (delta: 121.6 MB). Free memory was 107.8 MB in the beginning and 157.5 MB in the end (delta: -49.6 MB). Peak memory consumption was 72.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...