/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-46f3038-m [2020-07-08 17:37:04,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:37:04,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:37:04,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:37:04,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:37:04,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:37:04,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:37:04,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:37:04,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:37:04,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:37:04,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:37:04,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:37:04,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:37:04,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:37:04,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:37:04,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:37:04,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:37:04,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:37:04,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:37:04,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:37:04,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:37:04,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:37:04,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:37:04,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:37:04,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:37:04,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:37:04,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:37:04,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:37:04,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:37:04,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:37:04,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:37:04,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:37:04,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:37:04,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:37:04,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:37:04,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:37:04,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:37:04,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:37:04,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:37:04,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:37:04,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:37:04,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:37:05,001 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:37:05,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:37:05,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:37:05,004 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:37:05,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:37:05,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:37:05,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:37:05,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:37:05,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:37:05,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:37:05,006 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:37:05,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:37:05,006 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:37:05,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:37:05,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:37:05,007 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:37:05,007 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:37:05,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:37:05,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:37:05,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:37:05,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:37:05,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:37:05,008 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:37:05,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:37:05,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:37:05,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:37:05,395 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:37:05,396 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:37:05,397 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-08 17:37:05,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dfbb051/ed9e5f95ae2a4a519be33d7edd0f04c4/FLAG3f441b9c9 [2020-07-08 17:37:06,105 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:37:06,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c [2020-07-08 17:37:06,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dfbb051/ed9e5f95ae2a4a519be33d7edd0f04c4/FLAG3f441b9c9 [2020-07-08 17:37:06,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dfbb051/ed9e5f95ae2a4a519be33d7edd0f04c4 [2020-07-08 17:37:06,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:37:06,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:37:06,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:37:06,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:37:06,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:37:06,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:37:06" (1/1) ... [2020-07-08 17:37:06,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161b7128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:06, skipping insertion in model container [2020-07-08 17:37:06,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:37:06" (1/1) ... [2020-07-08 17:37:06,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:37:06,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:37:06,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:37:06,829 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:37:07,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:37:07,037 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:37:07,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:07 WrapperNode [2020-07-08 17:37:07,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:37:07,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:37:07,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:37:07,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:37:07,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:07" (1/1) ... [2020-07-08 17:37:07,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:07" (1/1) ... [2020-07-08 17:37:07,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:07" (1/1) ... [2020-07-08 17:37:07,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:07" (1/1) ... [2020-07-08 17:37:07,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:07" (1/1) ... [2020-07-08 17:37:07,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:07" (1/1) ... [2020-07-08 17:37:07,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:07" (1/1) ... [2020-07-08 17:37:07,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:37:07,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:37:07,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:37:07,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:37:07,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:07" (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-08 17:37:07,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:37:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:37:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:37:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2020-07-08 17:37:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:37:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2020-07-08 17:37:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:37:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:37:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2020-07-08 17:37:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2020-07-08 17:37:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:37:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 17:37:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 17:37:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 17:37:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 17:37:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:37:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:37:08,220 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:37:08,220 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-08 17:37:08,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:37:08 BoogieIcfgContainer [2020-07-08 17:37:08,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:37:08,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:37:08,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:37:08,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:37:08,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:37:06" (1/3) ... [2020-07-08 17:37:08,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305aeb0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:37:08, skipping insertion in model container [2020-07-08 17:37:08,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:07" (2/3) ... [2020-07-08 17:37:08,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305aeb0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:37:08, skipping insertion in model container [2020-07-08 17:37:08,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:37:08" (3/3) ... [2020-07-08 17:37:08,238 INFO L109 eAbstractionObserver]: Analyzing ICFG lu.cmp.c [2020-07-08 17:37:08,252 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:37:08,263 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:37:08,280 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:37:08,302 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:37:08,302 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:37:08,302 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:37:08,302 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:37:08,303 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:37:08,303 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:37:08,303 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:37:08,303 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:37:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states. [2020-07-08 17:37:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 17:37:08,339 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:08,340 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-08 17:37:08,341 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1445504148, now seen corresponding path program 1 times [2020-07-08 17:37:08,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:08,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [401468395] [2020-07-08 17:37:08,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:08,798 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-08 17:37:08,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} #valid := #valid[0 := 0]; {189#true} is VALID [2020-07-08 17:37:08,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#true} assume 0 < #StackHeapBarrier; {189#true} is VALID [2020-07-08 17:37:08,801 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-08 17:37:08,801 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {189#true} is VALID [2020-07-08 17:37:08,802 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-08 17:37:08,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {189#true} is VALID [2020-07-08 17:37:08,803 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-08 17:37:08,803 INFO L280 TraceCheckUtils]: 8: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {189#true} is VALID [2020-07-08 17:37:08,803 INFO L280 TraceCheckUtils]: 9: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-08 17:37:08,804 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {189#true} {189#true} #330#return; {189#true} is VALID [2020-07-08 17:37:08,809 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-08 17:37:08,810 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-08 17:37:08,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#true} #valid := #valid[0 := 0]; {189#true} is VALID [2020-07-08 17:37:08,811 INFO L280 TraceCheckUtils]: 3: Hoare triple {189#true} assume 0 < #StackHeapBarrier; {189#true} is VALID [2020-07-08 17:37:08,812 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-08 17:37:08,812 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {189#true} is VALID [2020-07-08 17:37:08,813 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-08 17:37:08,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {189#true} is VALID [2020-07-08 17:37:08,814 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-08 17:37:08,814 INFO L280 TraceCheckUtils]: 9: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {189#true} is VALID [2020-07-08 17:37:08,814 INFO L280 TraceCheckUtils]: 10: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-08 17:37:08,815 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {189#true} {189#true} #330#return; {189#true} is VALID [2020-07-08 17:37:08,815 INFO L263 TraceCheckUtils]: 12: Hoare triple {189#true} call #t~ret33 := main(); {189#true} is VALID [2020-07-08 17:37:08,815 INFO L280 TraceCheckUtils]: 13: Hoare triple {189#true} havoc ~i~0; {189#true} is VALID [2020-07-08 17:37:08,816 INFO L280 TraceCheckUtils]: 14: Hoare triple {189#true} havoc ~j~0; {189#true} is VALID [2020-07-08 17:37:08,816 INFO L280 TraceCheckUtils]: 15: Hoare triple {189#true} ~nmax~0 := 50; {189#true} is VALID [2020-07-08 17:37:08,818 INFO L280 TraceCheckUtils]: 16: Hoare triple {189#true} ~n~0 := 5; {202#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:08,819 INFO L280 TraceCheckUtils]: 17: Hoare triple {202#(<= 5 main_~n~0)} havoc ~chkerr~0; {202#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:08,820 INFO L280 TraceCheckUtils]: 18: Hoare triple {202#(<= 5 main_~n~0)} havoc ~eps~0; {202#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:08,822 INFO L280 TraceCheckUtils]: 19: Hoare triple {202#(<= 5 main_~n~0)} havoc ~w~0; {202#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:08,824 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-08 17:37:08,825 INFO L280 TraceCheckUtils]: 21: Hoare triple {202#(<= 5 main_~n~0)} ~i~0 := 0; {202#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:08,826 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-08 17:37:08,827 INFO L280 TraceCheckUtils]: 23: Hoare triple {202#(<= 5 main_~n~0)} ~w~0 := 0.0; {202#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:08,829 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-08 17:37:08,831 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-08 17:37:08,831 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-08 17:37:08,832 INFO L280 TraceCheckUtils]: 27: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2020-07-08 17:37:08,832 INFO L280 TraceCheckUtils]: 28: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2020-07-08 17:37:08,833 INFO L280 TraceCheckUtils]: 29: Hoare triple {190#false} assume !false; {190#false} is VALID [2020-07-08 17:37:08,843 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-08 17:37:08,844 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:08,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [401468395] [2020-07-08 17:37:08,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:08,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:37:08,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91887252] [2020-07-08 17:37:08,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-08 17:37:08,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:08,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:37:08,928 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-08 17:37:08,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:37:08,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:08,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:37:08,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:37:08,940 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 5 states. [2020-07-08 17:37:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:11,111 INFO L93 Difference]: Finished difference Result 367 states and 432 transitions. [2020-07-08 17:37:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 17:37:11,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-08 17:37:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:37:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 432 transitions. [2020-07-08 17:37:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:37:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 432 transitions. [2020-07-08 17:37:11,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 432 transitions. [2020-07-08 17:37:11,691 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-08 17:37:11,710 INFO L225 Difference]: With dead ends: 367 [2020-07-08 17:37:11,710 INFO L226 Difference]: Without dead ends: 64 [2020-07-08 17:37:11,719 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:37:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-08 17:37:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2020-07-08 17:37:11,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:11,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 49 states. [2020-07-08 17:37:11,911 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 49 states. [2020-07-08 17:37:11,911 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 49 states. [2020-07-08 17:37:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:11,921 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-08 17:37:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-08 17:37:11,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:11,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:11,925 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 64 states. [2020-07-08 17:37:11,925 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 64 states. [2020-07-08 17:37:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:11,932 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-08 17:37:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-08 17:37:11,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:11,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:11,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:11,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-08 17:37:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-08 17:37:11,942 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 30 [2020-07-08 17:37:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:11,949 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-08 17:37:11,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:37:11,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2020-07-08 17:37:12,074 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-08 17:37:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-08 17:37:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-08 17:37:12,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:12,077 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-08 17:37:12,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:37:12,078 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:12,078 INFO L82 PathProgramCache]: Analyzing trace with hash -905808642, now seen corresponding path program 1 times [2020-07-08 17:37:12,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:12,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1875845898] [2020-07-08 17:37:12,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:12,327 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-08 17:37:12,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {1171#true} #valid := #valid[0 := 0]; {1171#true} is VALID [2020-07-08 17:37:12,328 INFO L280 TraceCheckUtils]: 2: Hoare triple {1171#true} assume 0 < #StackHeapBarrier; {1171#true} is VALID [2020-07-08 17:37:12,330 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-08 17:37:12,330 INFO L280 TraceCheckUtils]: 4: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1171#true} is VALID [2020-07-08 17:37:12,331 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-08 17:37:12,331 INFO L280 TraceCheckUtils]: 6: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1171#true} is VALID [2020-07-08 17:37:12,331 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-08 17:37:12,332 INFO L280 TraceCheckUtils]: 8: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1171#true} is VALID [2020-07-08 17:37:12,332 INFO L280 TraceCheckUtils]: 9: Hoare triple {1171#true} assume true; {1171#true} is VALID [2020-07-08 17:37:12,332 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1171#true} {1171#true} #330#return; {1171#true} is VALID [2020-07-08 17:37:12,338 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-08 17:37:12,339 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-08 17:37:12,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {1171#true} #valid := #valid[0 := 0]; {1171#true} is VALID [2020-07-08 17:37:12,340 INFO L280 TraceCheckUtils]: 3: Hoare triple {1171#true} assume 0 < #StackHeapBarrier; {1171#true} is VALID [2020-07-08 17:37:12,340 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-08 17:37:12,341 INFO L280 TraceCheckUtils]: 5: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1171#true} is VALID [2020-07-08 17:37:12,341 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-08 17:37:12,341 INFO L280 TraceCheckUtils]: 7: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1171#true} is VALID [2020-07-08 17:37:12,342 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-08 17:37:12,342 INFO L280 TraceCheckUtils]: 9: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1171#true} is VALID [2020-07-08 17:37:12,342 INFO L280 TraceCheckUtils]: 10: Hoare triple {1171#true} assume true; {1171#true} is VALID [2020-07-08 17:37:12,343 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1171#true} {1171#true} #330#return; {1171#true} is VALID [2020-07-08 17:37:12,343 INFO L263 TraceCheckUtils]: 12: Hoare triple {1171#true} call #t~ret33 := main(); {1171#true} is VALID [2020-07-08 17:37:12,343 INFO L280 TraceCheckUtils]: 13: Hoare triple {1171#true} havoc ~i~0; {1171#true} is VALID [2020-07-08 17:37:12,343 INFO L280 TraceCheckUtils]: 14: Hoare triple {1171#true} havoc ~j~0; {1171#true} is VALID [2020-07-08 17:37:12,344 INFO L280 TraceCheckUtils]: 15: Hoare triple {1171#true} ~nmax~0 := 50; {1171#true} is VALID [2020-07-08 17:37:12,344 INFO L280 TraceCheckUtils]: 16: Hoare triple {1171#true} ~n~0 := 5; {1171#true} is VALID [2020-07-08 17:37:12,347 INFO L280 TraceCheckUtils]: 17: Hoare triple {1171#true} havoc ~chkerr~0; {1171#true} is VALID [2020-07-08 17:37:12,347 INFO L280 TraceCheckUtils]: 18: Hoare triple {1171#true} havoc ~eps~0; {1171#true} is VALID [2020-07-08 17:37:12,348 INFO L280 TraceCheckUtils]: 19: Hoare triple {1171#true} havoc ~w~0; {1171#true} is VALID [2020-07-08 17:37:12,348 INFO L280 TraceCheckUtils]: 20: Hoare triple {1171#true} ~eps~0 := 1.0E-6; {1171#true} is VALID [2020-07-08 17:37:12,349 INFO L280 TraceCheckUtils]: 21: Hoare triple {1171#true} ~i~0 := 0; {1184#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:12,350 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-08 17:37:12,352 INFO L280 TraceCheckUtils]: 23: Hoare triple {1184#(= 0 main_~i~0)} ~w~0 := 0.0; {1184#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:12,353 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-08 17:37:12,354 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-08 17:37:12,355 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-08 17:37:12,356 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-08 17:37:12,356 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-08 17:37:12,357 INFO L280 TraceCheckUtils]: 29: Hoare triple {1172#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {1172#false} is VALID [2020-07-08 17:37:12,357 INFO L280 TraceCheckUtils]: 30: Hoare triple {1172#false} havoc #t~mem3; {1172#false} is VALID [2020-07-08 17:37:12,357 INFO L280 TraceCheckUtils]: 31: Hoare triple {1172#false} #t~post1 := ~j~0; {1172#false} is VALID [2020-07-08 17:37:12,358 INFO L280 TraceCheckUtils]: 32: Hoare triple {1172#false} ~j~0 := 1 + #t~post1; {1172#false} is VALID [2020-07-08 17:37:12,358 INFO L280 TraceCheckUtils]: 33: Hoare triple {1172#false} havoc #t~post1; {1172#false} is VALID [2020-07-08 17:37:12,360 INFO L280 TraceCheckUtils]: 34: Hoare triple {1172#false} assume !(~j~0 <= ~n~0); {1172#false} is VALID [2020-07-08 17:37:12,360 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-08 17:37:12,360 INFO L280 TraceCheckUtils]: 36: Hoare triple {1172#false} ~cond := #in~cond; {1172#false} is VALID [2020-07-08 17:37:12,361 INFO L280 TraceCheckUtils]: 37: Hoare triple {1172#false} assume 0 == ~cond; {1172#false} is VALID [2020-07-08 17:37:12,361 INFO L280 TraceCheckUtils]: 38: Hoare triple {1172#false} assume !false; {1172#false} is VALID [2020-07-08 17:37:12,364 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-08 17:37:12,365 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:12,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1875845898] [2020-07-08 17:37:12,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:12,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:37:12,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249717233] [2020-07-08 17:37:12,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-08 17:37:12,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:12,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:37:12,412 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-08 17:37:12,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:37:12,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:37:12,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:37:12,413 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2020-07-08 17:37:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:13,111 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2020-07-08 17:37:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 17:37:13,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-08 17:37:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:37:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-08 17:37:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:37:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-08 17:37:13,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 109 transitions. [2020-07-08 17:37:13,291 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-08 17:37:13,296 INFO L225 Difference]: With dead ends: 103 [2020-07-08 17:37:13,297 INFO L226 Difference]: Without dead ends: 76 [2020-07-08 17:37:13,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:37:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-08 17:37:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2020-07-08 17:37:13,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:13,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 55 states. [2020-07-08 17:37:13,489 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 55 states. [2020-07-08 17:37:13,489 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 55 states. [2020-07-08 17:37:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:13,497 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2020-07-08 17:37:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2020-07-08 17:37:13,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:13,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:13,504 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 76 states. [2020-07-08 17:37:13,504 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 76 states. [2020-07-08 17:37:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:13,512 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2020-07-08 17:37:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2020-07-08 17:37:13,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:13,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:13,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:13,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 17:37:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-07-08 17:37:13,518 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 39 [2020-07-08 17:37:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:13,519 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-07-08 17:37:13,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:37:13,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2020-07-08 17:37:13,627 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-08 17:37:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-08 17:37:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 17:37:13,628 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:13,629 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-08 17:37:13,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:37:13,629 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:13,630 INFO L82 PathProgramCache]: Analyzing trace with hash -361483259, now seen corresponding path program 1 times [2020-07-08 17:37:13,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:13,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150291996] [2020-07-08 17:37:13,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:13,825 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-08 17:37:13,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {1661#true} #valid := #valid[0 := 0]; {1661#true} is VALID [2020-07-08 17:37:13,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {1661#true} assume 0 < #StackHeapBarrier; {1661#true} is VALID [2020-07-08 17:37:13,827 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-08 17:37:13,827 INFO L280 TraceCheckUtils]: 4: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1661#true} is VALID [2020-07-08 17:37:13,828 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-08 17:37:13,828 INFO L280 TraceCheckUtils]: 6: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1661#true} is VALID [2020-07-08 17:37:13,828 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-08 17:37:13,829 INFO L280 TraceCheckUtils]: 8: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1661#true} is VALID [2020-07-08 17:37:13,829 INFO L280 TraceCheckUtils]: 9: Hoare triple {1661#true} assume true; {1661#true} is VALID [2020-07-08 17:37:13,829 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1661#true} {1661#true} #330#return; {1661#true} is VALID [2020-07-08 17:37:13,831 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-08 17:37:13,832 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-08 17:37:13,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {1661#true} #valid := #valid[0 := 0]; {1661#true} is VALID [2020-07-08 17:37:13,833 INFO L280 TraceCheckUtils]: 3: Hoare triple {1661#true} assume 0 < #StackHeapBarrier; {1661#true} is VALID [2020-07-08 17:37:13,833 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-08 17:37:13,833 INFO L280 TraceCheckUtils]: 5: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1661#true} is VALID [2020-07-08 17:37:13,834 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-08 17:37:13,834 INFO L280 TraceCheckUtils]: 7: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1661#true} is VALID [2020-07-08 17:37:13,834 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-08 17:37:13,834 INFO L280 TraceCheckUtils]: 9: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1661#true} is VALID [2020-07-08 17:37:13,835 INFO L280 TraceCheckUtils]: 10: Hoare triple {1661#true} assume true; {1661#true} is VALID [2020-07-08 17:37:13,835 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1661#true} {1661#true} #330#return; {1661#true} is VALID [2020-07-08 17:37:13,835 INFO L263 TraceCheckUtils]: 12: Hoare triple {1661#true} call #t~ret33 := main(); {1661#true} is VALID [2020-07-08 17:37:13,836 INFO L280 TraceCheckUtils]: 13: Hoare triple {1661#true} havoc ~i~0; {1661#true} is VALID [2020-07-08 17:37:13,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {1661#true} havoc ~j~0; {1661#true} is VALID [2020-07-08 17:37:13,836 INFO L280 TraceCheckUtils]: 15: Hoare triple {1661#true} ~nmax~0 := 50; {1661#true} is VALID [2020-07-08 17:37:13,836 INFO L280 TraceCheckUtils]: 16: Hoare triple {1661#true} ~n~0 := 5; {1661#true} is VALID [2020-07-08 17:37:13,837 INFO L280 TraceCheckUtils]: 17: Hoare triple {1661#true} havoc ~chkerr~0; {1661#true} is VALID [2020-07-08 17:37:13,837 INFO L280 TraceCheckUtils]: 18: Hoare triple {1661#true} havoc ~eps~0; {1661#true} is VALID [2020-07-08 17:37:13,837 INFO L280 TraceCheckUtils]: 19: Hoare triple {1661#true} havoc ~w~0; {1661#true} is VALID [2020-07-08 17:37:13,838 INFO L280 TraceCheckUtils]: 20: Hoare triple {1661#true} ~eps~0 := 1.0E-6; {1661#true} is VALID [2020-07-08 17:37:13,839 INFO L280 TraceCheckUtils]: 21: Hoare triple {1661#true} ~i~0 := 0; {1674#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:13,840 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-08 17:37:13,841 INFO L280 TraceCheckUtils]: 23: Hoare triple {1674#(= 0 main_~i~0)} ~w~0 := 0.0; {1674#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:13,842 INFO L280 TraceCheckUtils]: 24: Hoare triple {1674#(= 0 main_~i~0)} ~j~0 := 0; {1674#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:13,843 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-08 17:37:13,844 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-08 17:37:13,845 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-08 17:37:13,846 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-08 17:37:13,847 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-08 17:37:13,847 INFO L280 TraceCheckUtils]: 30: Hoare triple {1674#(= 0 main_~i~0)} havoc #t~mem2; {1674#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:13,848 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-08 17:37:13,849 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-08 17:37:13,849 INFO L280 TraceCheckUtils]: 33: Hoare triple {1674#(= 0 main_~i~0)} havoc #t~mem3; {1674#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:13,850 INFO L280 TraceCheckUtils]: 34: Hoare triple {1674#(= 0 main_~i~0)} #t~post1 := ~j~0; {1674#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:13,851 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-08 17:37:13,852 INFO L280 TraceCheckUtils]: 36: Hoare triple {1674#(= 0 main_~i~0)} havoc #t~post1; {1674#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:13,853 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-08 17:37:13,854 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-08 17:37:13,855 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-08 17:37:13,856 INFO L280 TraceCheckUtils]: 40: Hoare triple {1676#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1662#false} is VALID [2020-07-08 17:37:13,857 INFO L280 TraceCheckUtils]: 41: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2020-07-08 17:37:13,860 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-08 17:37:13,861 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:13,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150291996] [2020-07-08 17:37:13,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:13,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 17:37:13,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336024179] [2020-07-08 17:37:13,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-08 17:37:13,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:13,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 17:37:13,906 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-08 17:37:13,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 17:37:13,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:13,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 17:37:13,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:37:13,908 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 6 states. [2020-07-08 17:37:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:14,801 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2020-07-08 17:37:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 17:37:14,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-08 17:37:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:37:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-08 17:37:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:37:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-08 17:37:14,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2020-07-08 17:37:14,925 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-08 17:37:14,928 INFO L225 Difference]: With dead ends: 77 [2020-07-08 17:37:14,928 INFO L226 Difference]: Without dead ends: 75 [2020-07-08 17:37:14,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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-08 17:37:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-08 17:37:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-07-08 17:37:15,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:15,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 72 states. [2020-07-08 17:37:15,176 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 72 states. [2020-07-08 17:37:15,176 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 72 states. [2020-07-08 17:37:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:15,180 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2020-07-08 17:37:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-07-08 17:37:15,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:15,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:15,182 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 75 states. [2020-07-08 17:37:15,182 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 75 states. [2020-07-08 17:37:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:15,185 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2020-07-08 17:37:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-07-08 17:37:15,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:15,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:15,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:15,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-08 17:37:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2020-07-08 17:37:15,190 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 42 [2020-07-08 17:37:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:15,191 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2020-07-08 17:37:15,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 17:37:15,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2020-07-08 17:37:15,338 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-08 17:37:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-08 17:37:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-08 17:37:15,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:15,342 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-08 17:37:15,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:37:15,343 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:15,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1960696442, now seen corresponding path program 1 times [2020-07-08 17:37:15,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:15,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1068160595] [2020-07-08 17:37:15,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:15,627 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-08 17:37:15,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {2136#true} #valid := #valid[0 := 0]; {2136#true} is VALID [2020-07-08 17:37:15,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {2136#true} assume 0 < #StackHeapBarrier; {2136#true} is VALID [2020-07-08 17:37:15,628 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-08 17:37:15,629 INFO L280 TraceCheckUtils]: 4: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {2136#true} is VALID [2020-07-08 17:37:15,629 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-08 17:37:15,629 INFO L280 TraceCheckUtils]: 6: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {2136#true} is VALID [2020-07-08 17:37:15,630 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-08 17:37:15,630 INFO L280 TraceCheckUtils]: 8: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2136#true} is VALID [2020-07-08 17:37:15,636 INFO L280 TraceCheckUtils]: 9: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-08 17:37:15,636 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2136#true} {2136#true} #330#return; {2136#true} is VALID [2020-07-08 17:37:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:15,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {2136#true} ~cond := #in~cond; {2136#true} is VALID [2020-07-08 17:37:15,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {2136#true} assume !(0 == ~cond); {2136#true} is VALID [2020-07-08 17:37:15,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-08 17:37:15,663 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2136#true} {2137#false} #334#return; {2137#false} is VALID [2020-07-08 17:37:15,672 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-08 17:37:15,672 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-08 17:37:15,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {2136#true} #valid := #valid[0 := 0]; {2136#true} is VALID [2020-07-08 17:37:15,673 INFO L280 TraceCheckUtils]: 3: Hoare triple {2136#true} assume 0 < #StackHeapBarrier; {2136#true} is VALID [2020-07-08 17:37:15,673 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-08 17:37:15,674 INFO L280 TraceCheckUtils]: 5: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {2136#true} is VALID [2020-07-08 17:37:15,674 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-08 17:37:15,674 INFO L280 TraceCheckUtils]: 7: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {2136#true} is VALID [2020-07-08 17:37:15,675 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-08 17:37:15,675 INFO L280 TraceCheckUtils]: 9: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2136#true} is VALID [2020-07-08 17:37:15,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-08 17:37:15,676 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2136#true} {2136#true} #330#return; {2136#true} is VALID [2020-07-08 17:37:15,676 INFO L263 TraceCheckUtils]: 12: Hoare triple {2136#true} call #t~ret33 := main(); {2136#true} is VALID [2020-07-08 17:37:15,676 INFO L280 TraceCheckUtils]: 13: Hoare triple {2136#true} havoc ~i~0; {2136#true} is VALID [2020-07-08 17:37:15,677 INFO L280 TraceCheckUtils]: 14: Hoare triple {2136#true} havoc ~j~0; {2136#true} is VALID [2020-07-08 17:37:15,677 INFO L280 TraceCheckUtils]: 15: Hoare triple {2136#true} ~nmax~0 := 50; {2136#true} is VALID [2020-07-08 17:37:15,696 INFO L280 TraceCheckUtils]: 16: Hoare triple {2136#true} ~n~0 := 5; {2149#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:15,702 INFO L280 TraceCheckUtils]: 17: Hoare triple {2149#(<= 5 main_~n~0)} havoc ~chkerr~0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:15,703 INFO L280 TraceCheckUtils]: 18: Hoare triple {2149#(<= 5 main_~n~0)} havoc ~eps~0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:15,704 INFO L280 TraceCheckUtils]: 19: Hoare triple {2149#(<= 5 main_~n~0)} havoc ~w~0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:15,705 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-08 17:37:15,706 INFO L280 TraceCheckUtils]: 21: Hoare triple {2149#(<= 5 main_~n~0)} ~i~0 := 0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:15,707 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-08 17:37:15,708 INFO L280 TraceCheckUtils]: 23: Hoare triple {2149#(<= 5 main_~n~0)} ~w~0 := 0.0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:15,710 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-08 17:37:15,712 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-08 17:37:15,714 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-08 17:37:15,715 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-08 17:37:15,717 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-08 17:37:15,719 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-08 17:37:15,721 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-08 17:37:15,723 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-08 17:37:15,724 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-08 17:37:15,726 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-08 17:37:15,727 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-08 17:37:15,728 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-08 17:37:15,729 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-08 17:37:15,730 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-08 17:37:15,731 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-08 17:37:15,732 INFO L280 TraceCheckUtils]: 39: Hoare triple {2136#true} ~cond := #in~cond; {2136#true} is VALID [2020-07-08 17:37:15,732 INFO L280 TraceCheckUtils]: 40: Hoare triple {2136#true} assume !(0 == ~cond); {2136#true} is VALID [2020-07-08 17:37:15,733 INFO L280 TraceCheckUtils]: 41: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-08 17:37:15,733 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2136#true} {2137#false} #334#return; {2137#false} is VALID [2020-07-08 17:37:15,733 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-08 17:37:15,734 INFO L280 TraceCheckUtils]: 44: Hoare triple {2137#false} #t~post0 := ~i~0; {2137#false} is VALID [2020-07-08 17:37:15,734 INFO L280 TraceCheckUtils]: 45: Hoare triple {2137#false} ~i~0 := 1 + #t~post0; {2137#false} is VALID [2020-07-08 17:37:15,734 INFO L280 TraceCheckUtils]: 46: Hoare triple {2137#false} havoc #t~post0; {2137#false} is VALID [2020-07-08 17:37:15,735 INFO L280 TraceCheckUtils]: 47: Hoare triple {2137#false} assume !!(~i~0 <= ~n~0); {2137#false} is VALID [2020-07-08 17:37:15,736 INFO L280 TraceCheckUtils]: 48: Hoare triple {2137#false} ~w~0 := 0.0; {2137#false} is VALID [2020-07-08 17:37:15,736 INFO L280 TraceCheckUtils]: 49: Hoare triple {2137#false} ~j~0 := 0; {2137#false} is VALID [2020-07-08 17:37:15,737 INFO L280 TraceCheckUtils]: 50: Hoare triple {2137#false} assume !!(~j~0 <= ~n~0); {2137#false} is VALID [2020-07-08 17:37:15,737 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-08 17:37:15,737 INFO L280 TraceCheckUtils]: 52: Hoare triple {2137#false} assume !(~i~0 == ~j~0); {2137#false} is VALID [2020-07-08 17:37:15,738 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-08 17:37:15,738 INFO L280 TraceCheckUtils]: 54: Hoare triple {2137#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {2137#false} is VALID [2020-07-08 17:37:15,739 INFO L280 TraceCheckUtils]: 55: Hoare triple {2137#false} havoc #t~mem3; {2137#false} is VALID [2020-07-08 17:37:15,739 INFO L280 TraceCheckUtils]: 56: Hoare triple {2137#false} #t~post1 := ~j~0; {2137#false} is VALID [2020-07-08 17:37:15,739 INFO L280 TraceCheckUtils]: 57: Hoare triple {2137#false} ~j~0 := 1 + #t~post1; {2137#false} is VALID [2020-07-08 17:37:15,739 INFO L280 TraceCheckUtils]: 58: Hoare triple {2137#false} havoc #t~post1; {2137#false} is VALID [2020-07-08 17:37:15,740 INFO L280 TraceCheckUtils]: 59: Hoare triple {2137#false} assume !(~j~0 <= ~n~0); {2137#false} is VALID [2020-07-08 17:37:15,740 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-08 17:37:15,740 INFO L280 TraceCheckUtils]: 61: Hoare triple {2137#false} ~cond := #in~cond; {2137#false} is VALID [2020-07-08 17:37:15,741 INFO L280 TraceCheckUtils]: 62: Hoare triple {2137#false} assume 0 == ~cond; {2137#false} is VALID [2020-07-08 17:37:15,741 INFO L280 TraceCheckUtils]: 63: Hoare triple {2137#false} assume !false; {2137#false} is VALID [2020-07-08 17:37:15,766 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-08 17:37:15,767 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:15,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1068160595] [2020-07-08 17:37:15,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:15,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 17:37:15,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161060563] [2020-07-08 17:37:15,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2020-07-08 17:37:15,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:15,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 17:37:15,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:15,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 17:37:15,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:15,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 17:37:15,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:37:15,857 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 7 states. [2020-07-08 17:37:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:16,819 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2020-07-08 17:37:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 17:37:16,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2020-07-08 17:37:16,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:37:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2020-07-08 17:37:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:37:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2020-07-08 17:37:16,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 109 transitions. [2020-07-08 17:37:16,990 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-08 17:37:16,994 INFO L225 Difference]: With dead ends: 146 [2020-07-08 17:37:16,994 INFO L226 Difference]: Without dead ends: 114 [2020-07-08 17:37:16,995 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:37:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-08 17:37:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2020-07-08 17:37:17,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:17,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 94 states. [2020-07-08 17:37:17,301 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 94 states. [2020-07-08 17:37:17,301 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 94 states. [2020-07-08 17:37:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:17,306 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2020-07-08 17:37:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2020-07-08 17:37:17,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:17,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:17,307 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 114 states. [2020-07-08 17:37:17,307 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 114 states. [2020-07-08 17:37:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:17,312 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2020-07-08 17:37:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2020-07-08 17:37:17,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:17,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:17,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:17,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:17,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-08 17:37:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2020-07-08 17:37:17,317 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 64 [2020-07-08 17:37:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:17,318 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2020-07-08 17:37:17,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 17:37:17,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 99 transitions. [2020-07-08 17:37:17,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2020-07-08 17:37:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-08 17:37:17,496 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:17,496 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2020-07-08 17:37:17,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 17:37:17,497 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:17,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:17,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1491522468, now seen corresponding path program 2 times [2020-07-08 17:37:17,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:17,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [52211022] [2020-07-08 17:37:17,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:17,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {2901#(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; {2878#true} is VALID [2020-07-08 17:37:17,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {2878#true} #valid := #valid[0 := 0]; {2878#true} is VALID [2020-07-08 17:37:17,739 INFO L280 TraceCheckUtils]: 2: Hoare triple {2878#true} assume 0 < #StackHeapBarrier; {2878#true} is VALID [2020-07-08 17:37:17,739 INFO L280 TraceCheckUtils]: 3: Hoare triple {2878#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {2878#true} is VALID [2020-07-08 17:37:17,739 INFO L280 TraceCheckUtils]: 4: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {2878#true} is VALID [2020-07-08 17:37:17,740 INFO L280 TraceCheckUtils]: 5: Hoare triple {2878#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {2878#true} is VALID [2020-07-08 17:37:17,740 INFO L280 TraceCheckUtils]: 6: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {2878#true} is VALID [2020-07-08 17:37:17,740 INFO L280 TraceCheckUtils]: 7: Hoare triple {2878#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {2878#true} is VALID [2020-07-08 17:37:17,740 INFO L280 TraceCheckUtils]: 8: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2878#true} is VALID [2020-07-08 17:37:17,741 INFO L280 TraceCheckUtils]: 9: Hoare triple {2878#true} assume true; {2878#true} is VALID [2020-07-08 17:37:17,741 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2878#true} {2878#true} #330#return; {2878#true} is VALID [2020-07-08 17:37:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:17,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2020-07-08 17:37:17,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2020-07-08 17:37:17,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2020-07-08 17:37:17,748 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2879#false} #334#return; {2879#false} is VALID [2020-07-08 17:37:17,750 INFO L263 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2901#(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-08 17:37:17,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {2901#(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; {2878#true} is VALID [2020-07-08 17:37:17,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {2878#true} #valid := #valid[0 := 0]; {2878#true} is VALID [2020-07-08 17:37:17,751 INFO L280 TraceCheckUtils]: 3: Hoare triple {2878#true} assume 0 < #StackHeapBarrier; {2878#true} is VALID [2020-07-08 17:37:17,751 INFO L280 TraceCheckUtils]: 4: Hoare triple {2878#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {2878#true} is VALID [2020-07-08 17:37:17,751 INFO L280 TraceCheckUtils]: 5: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {2878#true} is VALID [2020-07-08 17:37:17,752 INFO L280 TraceCheckUtils]: 6: Hoare triple {2878#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {2878#true} is VALID [2020-07-08 17:37:17,752 INFO L280 TraceCheckUtils]: 7: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {2878#true} is VALID [2020-07-08 17:37:17,752 INFO L280 TraceCheckUtils]: 8: Hoare triple {2878#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {2878#true} is VALID [2020-07-08 17:37:17,752 INFO L280 TraceCheckUtils]: 9: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2878#true} is VALID [2020-07-08 17:37:17,753 INFO L280 TraceCheckUtils]: 10: Hoare triple {2878#true} assume true; {2878#true} is VALID [2020-07-08 17:37:17,753 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2878#true} {2878#true} #330#return; {2878#true} is VALID [2020-07-08 17:37:17,753 INFO L263 TraceCheckUtils]: 12: Hoare triple {2878#true} call #t~ret33 := main(); {2878#true} is VALID [2020-07-08 17:37:17,753 INFO L280 TraceCheckUtils]: 13: Hoare triple {2878#true} havoc ~i~0; {2878#true} is VALID [2020-07-08 17:37:17,754 INFO L280 TraceCheckUtils]: 14: Hoare triple {2878#true} havoc ~j~0; {2878#true} is VALID [2020-07-08 17:37:17,754 INFO L280 TraceCheckUtils]: 15: Hoare triple {2878#true} ~nmax~0 := 50; {2878#true} is VALID [2020-07-08 17:37:17,756 INFO L280 TraceCheckUtils]: 16: Hoare triple {2878#true} ~n~0 := 5; {2891#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:17,758 INFO L280 TraceCheckUtils]: 17: Hoare triple {2891#(<= 5 main_~n~0)} havoc ~chkerr~0; {2891#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:17,760 INFO L280 TraceCheckUtils]: 18: Hoare triple {2891#(<= 5 main_~n~0)} havoc ~eps~0; {2891#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:17,762 INFO L280 TraceCheckUtils]: 19: Hoare triple {2891#(<= 5 main_~n~0)} havoc ~w~0; {2891#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:17,765 INFO L280 TraceCheckUtils]: 20: Hoare triple {2891#(<= 5 main_~n~0)} ~eps~0 := 1.0E-6; {2891#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:17,766 INFO L280 TraceCheckUtils]: 21: Hoare triple {2891#(<= 5 main_~n~0)} ~i~0 := 0; {2891#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:17,767 INFO L280 TraceCheckUtils]: 22: Hoare triple {2891#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0); {2891#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:17,768 INFO L280 TraceCheckUtils]: 23: Hoare triple {2891#(<= 5 main_~n~0)} ~w~0 := 0.0; {2891#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:17,769 INFO L280 TraceCheckUtils]: 24: Hoare triple {2891#(<= 5 main_~n~0)} ~j~0 := 0; {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:17,770 INFO L280 TraceCheckUtils]: 25: Hoare triple {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume !!(~j~0 <= ~n~0); {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:17,771 INFO L280 TraceCheckUtils]: 26: Hoare triple {2892#(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 {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:17,772 INFO L280 TraceCheckUtils]: 27: Hoare triple {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume ~i~0 == ~j~0; {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:17,774 INFO L280 TraceCheckUtils]: 28: Hoare triple {2892#(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 {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:17,775 INFO L280 TraceCheckUtils]: 29: Hoare triple {2892#(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 {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:17,775 INFO L280 TraceCheckUtils]: 30: Hoare triple {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} havoc #t~mem2; {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:17,776 INFO L280 TraceCheckUtils]: 31: Hoare triple {2892#(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 {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:17,777 INFO L280 TraceCheckUtils]: 32: Hoare triple {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:17,778 INFO L280 TraceCheckUtils]: 33: Hoare triple {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} havoc #t~mem3; {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:17,779 INFO L280 TraceCheckUtils]: 34: Hoare triple {2892#(and (<= 5 main_~n~0) (= 0 main_~j~0))} #t~post1 := ~j~0; {2893#(and (<= 5 main_~n~0) (= |main_#t~post1| 0))} is VALID [2020-07-08 17:37:17,780 INFO L280 TraceCheckUtils]: 35: Hoare triple {2893#(and (<= 5 main_~n~0) (= |main_#t~post1| 0))} ~j~0 := 1 + #t~post1; {2894#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:17,781 INFO L280 TraceCheckUtils]: 36: Hoare triple {2894#(<= (+ main_~j~0 4) main_~n~0)} havoc #t~post1; {2894#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:17,782 INFO L280 TraceCheckUtils]: 37: Hoare triple {2894#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0); {2894#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:17,783 INFO L280 TraceCheckUtils]: 38: Hoare triple {2894#(<= (+ main_~j~0 4) main_~n~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 {2894#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:17,784 INFO L280 TraceCheckUtils]: 39: Hoare triple {2894#(<= (+ main_~j~0 4) main_~n~0)} assume !(~i~0 == ~j~0); {2894#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:17,785 INFO L280 TraceCheckUtils]: 40: Hoare triple {2894#(<= (+ main_~j~0 4) main_~n~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {2894#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:17,786 INFO L280 TraceCheckUtils]: 41: Hoare triple {2894#(<= (+ main_~j~0 4) main_~n~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {2894#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:17,787 INFO L280 TraceCheckUtils]: 42: Hoare triple {2894#(<= (+ main_~j~0 4) main_~n~0)} havoc #t~mem3; {2894#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:17,788 INFO L280 TraceCheckUtils]: 43: Hoare triple {2894#(<= (+ main_~j~0 4) main_~n~0)} #t~post1 := ~j~0; {2895#(<= (+ |main_#t~post1| 4) main_~n~0)} is VALID [2020-07-08 17:37:17,789 INFO L280 TraceCheckUtils]: 44: Hoare triple {2895#(<= (+ |main_#t~post1| 4) main_~n~0)} ~j~0 := 1 + #t~post1; {2896#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:17,790 INFO L280 TraceCheckUtils]: 45: Hoare triple {2896#(<= (+ main_~j~0 3) main_~n~0)} havoc #t~post1; {2896#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:17,790 INFO L280 TraceCheckUtils]: 46: Hoare triple {2896#(<= (+ main_~j~0 3) main_~n~0)} assume !(~j~0 <= ~n~0); {2879#false} is VALID [2020-07-08 17:37:17,791 INFO L263 TraceCheckUtils]: 47: Hoare triple {2879#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {2878#true} is VALID [2020-07-08 17:37:17,791 INFO L280 TraceCheckUtils]: 48: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2020-07-08 17:37:17,791 INFO L280 TraceCheckUtils]: 49: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2020-07-08 17:37:17,792 INFO L280 TraceCheckUtils]: 50: Hoare triple {2878#true} assume true; {2878#true} is VALID [2020-07-08 17:37:17,792 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2878#true} {2879#false} #334#return; {2879#false} is VALID [2020-07-08 17:37:17,792 INFO L280 TraceCheckUtils]: 52: Hoare triple {2879#false} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {2879#false} is VALID [2020-07-08 17:37:17,792 INFO L280 TraceCheckUtils]: 53: Hoare triple {2879#false} #t~post0 := ~i~0; {2879#false} is VALID [2020-07-08 17:37:17,793 INFO L280 TraceCheckUtils]: 54: Hoare triple {2879#false} ~i~0 := 1 + #t~post0; {2879#false} is VALID [2020-07-08 17:37:17,793 INFO L280 TraceCheckUtils]: 55: Hoare triple {2879#false} havoc #t~post0; {2879#false} is VALID [2020-07-08 17:37:17,793 INFO L280 TraceCheckUtils]: 56: Hoare triple {2879#false} assume !!(~i~0 <= ~n~0); {2879#false} is VALID [2020-07-08 17:37:17,793 INFO L280 TraceCheckUtils]: 57: Hoare triple {2879#false} ~w~0 := 0.0; {2879#false} is VALID [2020-07-08 17:37:17,794 INFO L280 TraceCheckUtils]: 58: Hoare triple {2879#false} ~j~0 := 0; {2879#false} is VALID [2020-07-08 17:37:17,794 INFO L280 TraceCheckUtils]: 59: Hoare triple {2879#false} assume !!(~j~0 <= ~n~0); {2879#false} is VALID [2020-07-08 17:37:17,794 INFO L280 TraceCheckUtils]: 60: Hoare triple {2879#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 {2879#false} is VALID [2020-07-08 17:37:17,794 INFO L280 TraceCheckUtils]: 61: Hoare triple {2879#false} assume !(~i~0 == ~j~0); {2879#false} is VALID [2020-07-08 17:37:17,795 INFO L280 TraceCheckUtils]: 62: Hoare triple {2879#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {2879#false} is VALID [2020-07-08 17:37:17,795 INFO L280 TraceCheckUtils]: 63: Hoare triple {2879#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {2879#false} is VALID [2020-07-08 17:37:17,795 INFO L280 TraceCheckUtils]: 64: Hoare triple {2879#false} havoc #t~mem3; {2879#false} is VALID [2020-07-08 17:37:17,796 INFO L280 TraceCheckUtils]: 65: Hoare triple {2879#false} #t~post1 := ~j~0; {2879#false} is VALID [2020-07-08 17:37:17,796 INFO L280 TraceCheckUtils]: 66: Hoare triple {2879#false} ~j~0 := 1 + #t~post1; {2879#false} is VALID [2020-07-08 17:37:17,796 INFO L280 TraceCheckUtils]: 67: Hoare triple {2879#false} havoc #t~post1; {2879#false} is VALID [2020-07-08 17:37:17,796 INFO L280 TraceCheckUtils]: 68: Hoare triple {2879#false} assume !!(~j~0 <= ~n~0); {2879#false} is VALID [2020-07-08 17:37:17,797 INFO L280 TraceCheckUtils]: 69: Hoare triple {2879#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 {2879#false} is VALID [2020-07-08 17:37:17,797 INFO L280 TraceCheckUtils]: 70: Hoare triple {2879#false} assume !(~i~0 == ~j~0); {2879#false} is VALID [2020-07-08 17:37:17,797 INFO L280 TraceCheckUtils]: 71: Hoare triple {2879#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {2879#false} is VALID [2020-07-08 17:37:17,798 INFO L280 TraceCheckUtils]: 72: Hoare triple {2879#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {2879#false} is VALID [2020-07-08 17:37:17,798 INFO L280 TraceCheckUtils]: 73: Hoare triple {2879#false} havoc #t~mem3; {2879#false} is VALID [2020-07-08 17:37:17,798 INFO L280 TraceCheckUtils]: 74: Hoare triple {2879#false} #t~post1 := ~j~0; {2879#false} is VALID [2020-07-08 17:37:17,799 INFO L280 TraceCheckUtils]: 75: Hoare triple {2879#false} ~j~0 := 1 + #t~post1; {2879#false} is VALID [2020-07-08 17:37:17,799 INFO L280 TraceCheckUtils]: 76: Hoare triple {2879#false} havoc #t~post1; {2879#false} is VALID [2020-07-08 17:37:17,799 INFO L280 TraceCheckUtils]: 77: Hoare triple {2879#false} assume !(~j~0 <= ~n~0); {2879#false} is VALID [2020-07-08 17:37:17,799 INFO L263 TraceCheckUtils]: 78: Hoare triple {2879#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {2879#false} is VALID [2020-07-08 17:37:17,800 INFO L280 TraceCheckUtils]: 79: Hoare triple {2879#false} ~cond := #in~cond; {2879#false} is VALID [2020-07-08 17:37:17,800 INFO L280 TraceCheckUtils]: 80: Hoare triple {2879#false} assume 0 == ~cond; {2879#false} is VALID [2020-07-08 17:37:17,800 INFO L280 TraceCheckUtils]: 81: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2020-07-08 17:37:17,808 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-08 17:37:17,809 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:17,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [52211022] [2020-07-08 17:37:17,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:17,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:37:17,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503464443] [2020-07-08 17:37:17,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2020-07-08 17:37:17,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:17,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:37:17,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:17,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:37:17,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:17,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:37:17,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:37:17,902 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 9 states. [2020-07-08 17:37:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:19,147 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2020-07-08 17:37:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 17:37:19,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2020-07-08 17:37:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:37:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2020-07-08 17:37:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:37:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2020-07-08 17:37:19,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 122 transitions. [2020-07-08 17:37:19,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:19,321 INFO L225 Difference]: With dead ends: 182 [2020-07-08 17:37:19,321 INFO L226 Difference]: Without dead ends: 138 [2020-07-08 17:37:19,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2020-07-08 17:37:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-08 17:37:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2020-07-08 17:37:19,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:19,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 118 states. [2020-07-08 17:37:19,716 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 118 states. [2020-07-08 17:37:19,716 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 118 states. [2020-07-08 17:37:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:19,722 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2020-07-08 17:37:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2020-07-08 17:37:19,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:19,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:19,723 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 138 states. [2020-07-08 17:37:19,723 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 138 states. [2020-07-08 17:37:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:19,727 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2020-07-08 17:37:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2020-07-08 17:37:19,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:19,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:19,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:19,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-07-08 17:37:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2020-07-08 17:37:19,732 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 82 [2020-07-08 17:37:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:19,733 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2020-07-08 17:37:19,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:37:19,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 118 states and 125 transitions. [2020-07-08 17:37:19,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2020-07-08 17:37:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-07-08 17:37:19,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:19,957 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2020-07-08 17:37:19,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 17:37:19,958 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2108507974, now seen corresponding path program 3 times [2020-07-08 17:37:19,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:19,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1813538407] [2020-07-08 17:37:19,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:20,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {3821#(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; {3796#true} is VALID [2020-07-08 17:37:20,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {3796#true} #valid := #valid[0 := 0]; {3796#true} is VALID [2020-07-08 17:37:20,235 INFO L280 TraceCheckUtils]: 2: Hoare triple {3796#true} assume 0 < #StackHeapBarrier; {3796#true} is VALID [2020-07-08 17:37:20,236 INFO L280 TraceCheckUtils]: 3: Hoare triple {3796#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {3796#true} is VALID [2020-07-08 17:37:20,236 INFO L280 TraceCheckUtils]: 4: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {3796#true} is VALID [2020-07-08 17:37:20,236 INFO L280 TraceCheckUtils]: 5: Hoare triple {3796#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {3796#true} is VALID [2020-07-08 17:37:20,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {3796#true} is VALID [2020-07-08 17:37:20,237 INFO L280 TraceCheckUtils]: 7: Hoare triple {3796#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {3796#true} is VALID [2020-07-08 17:37:20,237 INFO L280 TraceCheckUtils]: 8: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {3796#true} is VALID [2020-07-08 17:37:20,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {3796#true} assume true; {3796#true} is VALID [2020-07-08 17:37:20,238 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3796#true} {3796#true} #330#return; {3796#true} is VALID [2020-07-08 17:37:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:20,248 INFO L280 TraceCheckUtils]: 0: Hoare triple {3796#true} ~cond := #in~cond; {3796#true} is VALID [2020-07-08 17:37:20,249 INFO L280 TraceCheckUtils]: 1: Hoare triple {3796#true} assume !(0 == ~cond); {3796#true} is VALID [2020-07-08 17:37:20,249 INFO L280 TraceCheckUtils]: 2: Hoare triple {3796#true} assume true; {3796#true} is VALID [2020-07-08 17:37:20,250 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3796#true} {3797#false} #334#return; {3797#false} is VALID [2020-07-08 17:37:20,252 INFO L263 TraceCheckUtils]: 0: Hoare triple {3796#true} call ULTIMATE.init(); {3821#(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-08 17:37:20,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {3821#(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; {3796#true} is VALID [2020-07-08 17:37:20,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {3796#true} #valid := #valid[0 := 0]; {3796#true} is VALID [2020-07-08 17:37:20,253 INFO L280 TraceCheckUtils]: 3: Hoare triple {3796#true} assume 0 < #StackHeapBarrier; {3796#true} is VALID [2020-07-08 17:37:20,253 INFO L280 TraceCheckUtils]: 4: Hoare triple {3796#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {3796#true} is VALID [2020-07-08 17:37:20,253 INFO L280 TraceCheckUtils]: 5: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {3796#true} is VALID [2020-07-08 17:37:20,254 INFO L280 TraceCheckUtils]: 6: Hoare triple {3796#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {3796#true} is VALID [2020-07-08 17:37:20,254 INFO L280 TraceCheckUtils]: 7: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {3796#true} is VALID [2020-07-08 17:37:20,254 INFO L280 TraceCheckUtils]: 8: Hoare triple {3796#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {3796#true} is VALID [2020-07-08 17:37:20,255 INFO L280 TraceCheckUtils]: 9: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {3796#true} is VALID [2020-07-08 17:37:20,255 INFO L280 TraceCheckUtils]: 10: Hoare triple {3796#true} assume true; {3796#true} is VALID [2020-07-08 17:37:20,255 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3796#true} {3796#true} #330#return; {3796#true} is VALID [2020-07-08 17:37:20,256 INFO L263 TraceCheckUtils]: 12: Hoare triple {3796#true} call #t~ret33 := main(); {3796#true} is VALID [2020-07-08 17:37:20,256 INFO L280 TraceCheckUtils]: 13: Hoare triple {3796#true} havoc ~i~0; {3796#true} is VALID [2020-07-08 17:37:20,256 INFO L280 TraceCheckUtils]: 14: Hoare triple {3796#true} havoc ~j~0; {3796#true} is VALID [2020-07-08 17:37:20,256 INFO L280 TraceCheckUtils]: 15: Hoare triple {3796#true} ~nmax~0 := 50; {3796#true} is VALID [2020-07-08 17:37:20,257 INFO L280 TraceCheckUtils]: 16: Hoare triple {3796#true} ~n~0 := 5; {3809#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:20,260 INFO L280 TraceCheckUtils]: 17: Hoare triple {3809#(<= 5 main_~n~0)} havoc ~chkerr~0; {3809#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:20,261 INFO L280 TraceCheckUtils]: 18: Hoare triple {3809#(<= 5 main_~n~0)} havoc ~eps~0; {3809#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:20,261 INFO L280 TraceCheckUtils]: 19: Hoare triple {3809#(<= 5 main_~n~0)} havoc ~w~0; {3809#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:20,262 INFO L280 TraceCheckUtils]: 20: Hoare triple {3809#(<= 5 main_~n~0)} ~eps~0 := 1.0E-6; {3809#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:20,262 INFO L280 TraceCheckUtils]: 21: Hoare triple {3809#(<= 5 main_~n~0)} ~i~0 := 0; {3809#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:20,263 INFO L280 TraceCheckUtils]: 22: Hoare triple {3809#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0); {3809#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:20,264 INFO L280 TraceCheckUtils]: 23: Hoare triple {3809#(<= 5 main_~n~0)} ~w~0 := 0.0; {3809#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:20,265 INFO L280 TraceCheckUtils]: 24: Hoare triple {3809#(<= 5 main_~n~0)} ~j~0 := 0; {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:20,266 INFO L280 TraceCheckUtils]: 25: Hoare triple {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume !!(~j~0 <= ~n~0); {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:20,267 INFO L280 TraceCheckUtils]: 26: Hoare triple {3810#(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 {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:20,269 INFO L280 TraceCheckUtils]: 27: Hoare triple {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume ~i~0 == ~j~0; {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:20,270 INFO L280 TraceCheckUtils]: 28: Hoare triple {3810#(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 {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:20,271 INFO L280 TraceCheckUtils]: 29: Hoare triple {3810#(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 {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:20,272 INFO L280 TraceCheckUtils]: 30: Hoare triple {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} havoc #t~mem2; {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:20,273 INFO L280 TraceCheckUtils]: 31: Hoare triple {3810#(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 {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:20,274 INFO L280 TraceCheckUtils]: 32: Hoare triple {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:20,274 INFO L280 TraceCheckUtils]: 33: Hoare triple {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} havoc #t~mem3; {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:20,276 INFO L280 TraceCheckUtils]: 34: Hoare triple {3810#(and (<= 5 main_~n~0) (= 0 main_~j~0))} #t~post1 := ~j~0; {3811#(and (<= 5 main_~n~0) (= |main_#t~post1| 0))} is VALID [2020-07-08 17:37:20,280 INFO L280 TraceCheckUtils]: 35: Hoare triple {3811#(and (<= 5 main_~n~0) (= |main_#t~post1| 0))} ~j~0 := 1 + #t~post1; {3812#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:20,281 INFO L280 TraceCheckUtils]: 36: Hoare triple {3812#(<= (+ main_~j~0 4) main_~n~0)} havoc #t~post1; {3812#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:20,282 INFO L280 TraceCheckUtils]: 37: Hoare triple {3812#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0); {3812#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:20,283 INFO L280 TraceCheckUtils]: 38: Hoare triple {3812#(<= (+ main_~j~0 4) main_~n~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 {3812#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:20,283 INFO L280 TraceCheckUtils]: 39: Hoare triple {3812#(<= (+ main_~j~0 4) main_~n~0)} assume !(~i~0 == ~j~0); {3812#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:20,284 INFO L280 TraceCheckUtils]: 40: Hoare triple {3812#(<= (+ main_~j~0 4) main_~n~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {3812#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:20,285 INFO L280 TraceCheckUtils]: 41: Hoare triple {3812#(<= (+ main_~j~0 4) main_~n~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {3812#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:20,285 INFO L280 TraceCheckUtils]: 42: Hoare triple {3812#(<= (+ main_~j~0 4) main_~n~0)} havoc #t~mem3; {3812#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:20,286 INFO L280 TraceCheckUtils]: 43: Hoare triple {3812#(<= (+ main_~j~0 4) main_~n~0)} #t~post1 := ~j~0; {3813#(<= (+ |main_#t~post1| 4) main_~n~0)} is VALID [2020-07-08 17:37:20,287 INFO L280 TraceCheckUtils]: 44: Hoare triple {3813#(<= (+ |main_#t~post1| 4) main_~n~0)} ~j~0 := 1 + #t~post1; {3814#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:20,288 INFO L280 TraceCheckUtils]: 45: Hoare triple {3814#(<= (+ main_~j~0 3) main_~n~0)} havoc #t~post1; {3814#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:20,288 INFO L280 TraceCheckUtils]: 46: Hoare triple {3814#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0); {3814#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:20,291 INFO L280 TraceCheckUtils]: 47: Hoare triple {3814#(<= (+ main_~j~0 3) main_~n~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 {3814#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:20,294 INFO L280 TraceCheckUtils]: 48: Hoare triple {3814#(<= (+ main_~j~0 3) main_~n~0)} assume !(~i~0 == ~j~0); {3814#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:20,298 INFO L280 TraceCheckUtils]: 49: Hoare triple {3814#(<= (+ main_~j~0 3) main_~n~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {3814#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:20,306 INFO L280 TraceCheckUtils]: 50: Hoare triple {3814#(<= (+ main_~j~0 3) main_~n~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {3814#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:20,308 INFO L280 TraceCheckUtils]: 51: Hoare triple {3814#(<= (+ main_~j~0 3) main_~n~0)} havoc #t~mem3; {3814#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:20,309 INFO L280 TraceCheckUtils]: 52: Hoare triple {3814#(<= (+ main_~j~0 3) main_~n~0)} #t~post1 := ~j~0; {3815#(<= (+ |main_#t~post1| 3) main_~n~0)} is VALID [2020-07-08 17:37:20,310 INFO L280 TraceCheckUtils]: 53: Hoare triple {3815#(<= (+ |main_#t~post1| 3) main_~n~0)} ~j~0 := 1 + #t~post1; {3816#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:20,311 INFO L280 TraceCheckUtils]: 54: Hoare triple {3816#(<= (+ main_~j~0 2) main_~n~0)} havoc #t~post1; {3816#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:20,312 INFO L280 TraceCheckUtils]: 55: Hoare triple {3816#(<= (+ main_~j~0 2) main_~n~0)} assume !(~j~0 <= ~n~0); {3797#false} is VALID [2020-07-08 17:37:20,313 INFO L263 TraceCheckUtils]: 56: Hoare triple {3797#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {3796#true} is VALID [2020-07-08 17:37:20,313 INFO L280 TraceCheckUtils]: 57: Hoare triple {3796#true} ~cond := #in~cond; {3796#true} is VALID [2020-07-08 17:37:20,313 INFO L280 TraceCheckUtils]: 58: Hoare triple {3796#true} assume !(0 == ~cond); {3796#true} is VALID [2020-07-08 17:37:20,313 INFO L280 TraceCheckUtils]: 59: Hoare triple {3796#true} assume true; {3796#true} is VALID [2020-07-08 17:37:20,313 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3796#true} {3797#false} #334#return; {3797#false} is VALID [2020-07-08 17:37:20,314 INFO L280 TraceCheckUtils]: 61: Hoare triple {3797#false} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {3797#false} is VALID [2020-07-08 17:37:20,314 INFO L280 TraceCheckUtils]: 62: Hoare triple {3797#false} #t~post0 := ~i~0; {3797#false} is VALID [2020-07-08 17:37:20,314 INFO L280 TraceCheckUtils]: 63: Hoare triple {3797#false} ~i~0 := 1 + #t~post0; {3797#false} is VALID [2020-07-08 17:37:20,314 INFO L280 TraceCheckUtils]: 64: Hoare triple {3797#false} havoc #t~post0; {3797#false} is VALID [2020-07-08 17:37:20,315 INFO L280 TraceCheckUtils]: 65: Hoare triple {3797#false} assume !!(~i~0 <= ~n~0); {3797#false} is VALID [2020-07-08 17:37:20,315 INFO L280 TraceCheckUtils]: 66: Hoare triple {3797#false} ~w~0 := 0.0; {3797#false} is VALID [2020-07-08 17:37:20,315 INFO L280 TraceCheckUtils]: 67: Hoare triple {3797#false} ~j~0 := 0; {3797#false} is VALID [2020-07-08 17:37:20,315 INFO L280 TraceCheckUtils]: 68: Hoare triple {3797#false} assume !!(~j~0 <= ~n~0); {3797#false} is VALID [2020-07-08 17:37:20,315 INFO L280 TraceCheckUtils]: 69: Hoare triple {3797#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 {3797#false} is VALID [2020-07-08 17:37:20,316 INFO L280 TraceCheckUtils]: 70: Hoare triple {3797#false} assume !(~i~0 == ~j~0); {3797#false} is VALID [2020-07-08 17:37:20,316 INFO L280 TraceCheckUtils]: 71: Hoare triple {3797#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {3797#false} is VALID [2020-07-08 17:37:20,316 INFO L280 TraceCheckUtils]: 72: Hoare triple {3797#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {3797#false} is VALID [2020-07-08 17:37:20,316 INFO L280 TraceCheckUtils]: 73: Hoare triple {3797#false} havoc #t~mem3; {3797#false} is VALID [2020-07-08 17:37:20,317 INFO L280 TraceCheckUtils]: 74: Hoare triple {3797#false} #t~post1 := ~j~0; {3797#false} is VALID [2020-07-08 17:37:20,317 INFO L280 TraceCheckUtils]: 75: Hoare triple {3797#false} ~j~0 := 1 + #t~post1; {3797#false} is VALID [2020-07-08 17:37:20,317 INFO L280 TraceCheckUtils]: 76: Hoare triple {3797#false} havoc #t~post1; {3797#false} is VALID [2020-07-08 17:37:20,317 INFO L280 TraceCheckUtils]: 77: Hoare triple {3797#false} assume !!(~j~0 <= ~n~0); {3797#false} is VALID [2020-07-08 17:37:20,318 INFO L280 TraceCheckUtils]: 78: Hoare triple {3797#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 {3797#false} is VALID [2020-07-08 17:37:20,318 INFO L280 TraceCheckUtils]: 79: Hoare triple {3797#false} assume !(~i~0 == ~j~0); {3797#false} is VALID [2020-07-08 17:37:20,318 INFO L280 TraceCheckUtils]: 80: Hoare triple {3797#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {3797#false} is VALID [2020-07-08 17:37:20,318 INFO L280 TraceCheckUtils]: 81: Hoare triple {3797#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {3797#false} is VALID [2020-07-08 17:37:20,318 INFO L280 TraceCheckUtils]: 82: Hoare triple {3797#false} havoc #t~mem3; {3797#false} is VALID [2020-07-08 17:37:20,319 INFO L280 TraceCheckUtils]: 83: Hoare triple {3797#false} #t~post1 := ~j~0; {3797#false} is VALID [2020-07-08 17:37:20,319 INFO L280 TraceCheckUtils]: 84: Hoare triple {3797#false} ~j~0 := 1 + #t~post1; {3797#false} is VALID [2020-07-08 17:37:20,319 INFO L280 TraceCheckUtils]: 85: Hoare triple {3797#false} havoc #t~post1; {3797#false} is VALID [2020-07-08 17:37:20,319 INFO L280 TraceCheckUtils]: 86: Hoare triple {3797#false} assume !!(~j~0 <= ~n~0); {3797#false} is VALID [2020-07-08 17:37:20,319 INFO L280 TraceCheckUtils]: 87: Hoare triple {3797#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 {3797#false} is VALID [2020-07-08 17:37:20,320 INFO L280 TraceCheckUtils]: 88: Hoare triple {3797#false} assume !(~i~0 == ~j~0); {3797#false} is VALID [2020-07-08 17:37:20,320 INFO L280 TraceCheckUtils]: 89: Hoare triple {3797#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {3797#false} is VALID [2020-07-08 17:37:20,320 INFO L280 TraceCheckUtils]: 90: Hoare triple {3797#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {3797#false} is VALID [2020-07-08 17:37:20,320 INFO L280 TraceCheckUtils]: 91: Hoare triple {3797#false} havoc #t~mem3; {3797#false} is VALID [2020-07-08 17:37:20,320 INFO L280 TraceCheckUtils]: 92: Hoare triple {3797#false} #t~post1 := ~j~0; {3797#false} is VALID [2020-07-08 17:37:20,321 INFO L280 TraceCheckUtils]: 93: Hoare triple {3797#false} ~j~0 := 1 + #t~post1; {3797#false} is VALID [2020-07-08 17:37:20,321 INFO L280 TraceCheckUtils]: 94: Hoare triple {3797#false} havoc #t~post1; {3797#false} is VALID [2020-07-08 17:37:20,323 INFO L280 TraceCheckUtils]: 95: Hoare triple {3797#false} assume !(~j~0 <= ~n~0); {3797#false} is VALID [2020-07-08 17:37:20,324 INFO L263 TraceCheckUtils]: 96: Hoare triple {3797#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {3797#false} is VALID [2020-07-08 17:37:20,324 INFO L280 TraceCheckUtils]: 97: Hoare triple {3797#false} ~cond := #in~cond; {3797#false} is VALID [2020-07-08 17:37:20,325 INFO L280 TraceCheckUtils]: 98: Hoare triple {3797#false} assume 0 == ~cond; {3797#false} is VALID [2020-07-08 17:37:20,325 INFO L280 TraceCheckUtils]: 99: Hoare triple {3797#false} assume !false; {3797#false} is VALID [2020-07-08 17:37:20,336 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-08 17:37:20,337 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:20,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1813538407] [2020-07-08 17:37:20,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:20,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 17:37:20,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319073600] [2020-07-08 17:37:20,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2020-07-08 17:37:20,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:20,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 17:37:20,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:20,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 17:37:20,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:20,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 17:37:20,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-08 17:37:20,443 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 11 states. [2020-07-08 17:37:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:22,212 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2020-07-08 17:37:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 17:37:22,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2020-07-08 17:37:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:37:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2020-07-08 17:37:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:37:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2020-07-08 17:37:22,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 135 transitions. [2020-07-08 17:37:22,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:22,398 INFO L225 Difference]: With dead ends: 218 [2020-07-08 17:37:22,398 INFO L226 Difference]: Without dead ends: 162 [2020-07-08 17:37:22,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2020-07-08 17:37:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-08 17:37:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2020-07-08 17:37:22,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:22,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 142 states. [2020-07-08 17:37:22,879 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 142 states. [2020-07-08 17:37:22,879 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 142 states. [2020-07-08 17:37:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:22,885 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2020-07-08 17:37:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2020-07-08 17:37:22,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:22,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:22,886 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 162 states. [2020-07-08 17:37:22,886 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 162 states. [2020-07-08 17:37:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:22,892 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2020-07-08 17:37:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2020-07-08 17:37:22,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:22,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:22,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:22,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-08 17:37:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2020-07-08 17:37:22,898 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 100 [2020-07-08 17:37:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:22,898 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2020-07-08 17:37:22,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 17:37:22,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 151 transitions. [2020-07-08 17:37:23,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2020-07-08 17:37:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-07-08 17:37:23,182 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:23,182 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 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] [2020-07-08 17:37:23,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 17:37:23,182 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1471539684, now seen corresponding path program 4 times [2020-07-08 17:37:23,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:23,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334400074] [2020-07-08 17:37:23,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:23,457 INFO L280 TraceCheckUtils]: 0: Hoare triple {4912#(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; {4890#true} is VALID [2020-07-08 17:37:23,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {4890#true} #valid := #valid[0 := 0]; {4890#true} is VALID [2020-07-08 17:37:23,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {4890#true} assume 0 < #StackHeapBarrier; {4890#true} is VALID [2020-07-08 17:37:23,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {4890#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {4890#true} is VALID [2020-07-08 17:37:23,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {4890#true} is VALID [2020-07-08 17:37:23,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {4890#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {4890#true} is VALID [2020-07-08 17:37:23,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {4890#true} is VALID [2020-07-08 17:37:23,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {4890#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {4890#true} is VALID [2020-07-08 17:37:23,462 INFO L280 TraceCheckUtils]: 8: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {4890#true} is VALID [2020-07-08 17:37:23,462 INFO L280 TraceCheckUtils]: 9: Hoare triple {4890#true} assume true; {4890#true} is VALID [2020-07-08 17:37:23,462 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {4890#true} {4890#true} #330#return; {4890#true} is VALID [2020-07-08 17:37:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:23,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2020-07-08 17:37:23,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2020-07-08 17:37:23,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {4890#true} assume true; {4890#true} is VALID [2020-07-08 17:37:23,480 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4890#true} {4903#(= 0 main_~i~0)} #334#return; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,482 INFO L263 TraceCheckUtils]: 0: Hoare triple {4890#true} call ULTIMATE.init(); {4912#(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-08 17:37:23,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {4912#(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; {4890#true} is VALID [2020-07-08 17:37:23,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {4890#true} #valid := #valid[0 := 0]; {4890#true} is VALID [2020-07-08 17:37:23,483 INFO L280 TraceCheckUtils]: 3: Hoare triple {4890#true} assume 0 < #StackHeapBarrier; {4890#true} is VALID [2020-07-08 17:37:23,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {4890#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {4890#true} is VALID [2020-07-08 17:37:23,484 INFO L280 TraceCheckUtils]: 5: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {4890#true} is VALID [2020-07-08 17:37:23,484 INFO L280 TraceCheckUtils]: 6: Hoare triple {4890#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {4890#true} is VALID [2020-07-08 17:37:23,484 INFO L280 TraceCheckUtils]: 7: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {4890#true} is VALID [2020-07-08 17:37:23,484 INFO L280 TraceCheckUtils]: 8: Hoare triple {4890#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {4890#true} is VALID [2020-07-08 17:37:23,485 INFO L280 TraceCheckUtils]: 9: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {4890#true} is VALID [2020-07-08 17:37:23,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {4890#true} assume true; {4890#true} is VALID [2020-07-08 17:37:23,485 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {4890#true} {4890#true} #330#return; {4890#true} is VALID [2020-07-08 17:37:23,485 INFO L263 TraceCheckUtils]: 12: Hoare triple {4890#true} call #t~ret33 := main(); {4890#true} is VALID [2020-07-08 17:37:23,485 INFO L280 TraceCheckUtils]: 13: Hoare triple {4890#true} havoc ~i~0; {4890#true} is VALID [2020-07-08 17:37:23,486 INFO L280 TraceCheckUtils]: 14: Hoare triple {4890#true} havoc ~j~0; {4890#true} is VALID [2020-07-08 17:37:23,486 INFO L280 TraceCheckUtils]: 15: Hoare triple {4890#true} ~nmax~0 := 50; {4890#true} is VALID [2020-07-08 17:37:23,486 INFO L280 TraceCheckUtils]: 16: Hoare triple {4890#true} ~n~0 := 5; {4890#true} is VALID [2020-07-08 17:37:23,486 INFO L280 TraceCheckUtils]: 17: Hoare triple {4890#true} havoc ~chkerr~0; {4890#true} is VALID [2020-07-08 17:37:23,486 INFO L280 TraceCheckUtils]: 18: Hoare triple {4890#true} havoc ~eps~0; {4890#true} is VALID [2020-07-08 17:37:23,487 INFO L280 TraceCheckUtils]: 19: Hoare triple {4890#true} havoc ~w~0; {4890#true} is VALID [2020-07-08 17:37:23,487 INFO L280 TraceCheckUtils]: 20: Hoare triple {4890#true} ~eps~0 := 1.0E-6; {4890#true} is VALID [2020-07-08 17:37:23,488 INFO L280 TraceCheckUtils]: 21: Hoare triple {4890#true} ~i~0 := 0; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,488 INFO L280 TraceCheckUtils]: 22: Hoare triple {4903#(= 0 main_~i~0)} assume !!(~i~0 <= ~n~0); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,489 INFO L280 TraceCheckUtils]: 23: Hoare triple {4903#(= 0 main_~i~0)} ~w~0 := 0.0; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,489 INFO L280 TraceCheckUtils]: 24: Hoare triple {4903#(= 0 main_~i~0)} ~j~0 := 0; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,490 INFO L280 TraceCheckUtils]: 25: Hoare triple {4903#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,490 INFO L280 TraceCheckUtils]: 26: Hoare triple {4903#(= 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 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,491 INFO L280 TraceCheckUtils]: 27: Hoare triple {4903#(= 0 main_~i~0)} assume ~i~0 == ~j~0; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,491 INFO L280 TraceCheckUtils]: 28: Hoare triple {4903#(= 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 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,492 INFO L280 TraceCheckUtils]: 29: Hoare triple {4903#(= 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 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,493 INFO L280 TraceCheckUtils]: 30: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~mem2; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,494 INFO L280 TraceCheckUtils]: 31: Hoare triple {4903#(= 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 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,494 INFO L280 TraceCheckUtils]: 32: Hoare triple {4903#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,495 INFO L280 TraceCheckUtils]: 33: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~mem3; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,496 INFO L280 TraceCheckUtils]: 34: Hoare triple {4903#(= 0 main_~i~0)} #t~post1 := ~j~0; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,496 INFO L280 TraceCheckUtils]: 35: Hoare triple {4903#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,497 INFO L280 TraceCheckUtils]: 36: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,498 INFO L280 TraceCheckUtils]: 37: Hoare triple {4903#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,499 INFO L280 TraceCheckUtils]: 38: Hoare triple {4903#(= 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 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,500 INFO L280 TraceCheckUtils]: 39: Hoare triple {4903#(= 0 main_~i~0)} assume !(~i~0 == ~j~0); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,500 INFO L280 TraceCheckUtils]: 40: Hoare triple {4903#(= 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 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,501 INFO L280 TraceCheckUtils]: 41: Hoare triple {4903#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,501 INFO L280 TraceCheckUtils]: 42: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~mem3; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,502 INFO L280 TraceCheckUtils]: 43: Hoare triple {4903#(= 0 main_~i~0)} #t~post1 := ~j~0; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,502 INFO L280 TraceCheckUtils]: 44: Hoare triple {4903#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,503 INFO L280 TraceCheckUtils]: 45: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,503 INFO L280 TraceCheckUtils]: 46: Hoare triple {4903#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,503 INFO L280 TraceCheckUtils]: 47: Hoare triple {4903#(= 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 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,504 INFO L280 TraceCheckUtils]: 48: Hoare triple {4903#(= 0 main_~i~0)} assume !(~i~0 == ~j~0); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,504 INFO L280 TraceCheckUtils]: 49: Hoare triple {4903#(= 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 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,505 INFO L280 TraceCheckUtils]: 50: Hoare triple {4903#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,505 INFO L280 TraceCheckUtils]: 51: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~mem3; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,505 INFO L280 TraceCheckUtils]: 52: Hoare triple {4903#(= 0 main_~i~0)} #t~post1 := ~j~0; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,506 INFO L280 TraceCheckUtils]: 53: Hoare triple {4903#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,506 INFO L280 TraceCheckUtils]: 54: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,508 INFO L280 TraceCheckUtils]: 55: Hoare triple {4903#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,510 INFO L280 TraceCheckUtils]: 56: Hoare triple {4903#(= 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 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,512 INFO L280 TraceCheckUtils]: 57: Hoare triple {4903#(= 0 main_~i~0)} assume !(~i~0 == ~j~0); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,514 INFO L280 TraceCheckUtils]: 58: Hoare triple {4903#(= 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 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,514 INFO L280 TraceCheckUtils]: 59: Hoare triple {4903#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,516 INFO L280 TraceCheckUtils]: 60: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~mem3; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,517 INFO L280 TraceCheckUtils]: 61: Hoare triple {4903#(= 0 main_~i~0)} #t~post1 := ~j~0; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,520 INFO L280 TraceCheckUtils]: 62: Hoare triple {4903#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,521 INFO L280 TraceCheckUtils]: 63: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,522 INFO L280 TraceCheckUtils]: 64: Hoare triple {4903#(= 0 main_~i~0)} assume !(~j~0 <= ~n~0); {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,523 INFO L263 TraceCheckUtils]: 65: Hoare triple {4903#(= 0 main_~i~0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {4890#true} is VALID [2020-07-08 17:37:23,523 INFO L280 TraceCheckUtils]: 66: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2020-07-08 17:37:23,523 INFO L280 TraceCheckUtils]: 67: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2020-07-08 17:37:23,524 INFO L280 TraceCheckUtils]: 68: Hoare triple {4890#true} assume true; {4890#true} is VALID [2020-07-08 17:37:23,525 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4890#true} {4903#(= 0 main_~i~0)} #334#return; {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,543 INFO L280 TraceCheckUtils]: 70: Hoare triple {4903#(= 0 main_~i~0)} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {4903#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:23,547 INFO L280 TraceCheckUtils]: 71: Hoare triple {4903#(= 0 main_~i~0)} #t~post0 := ~i~0; {4908#(= |main_#t~post0| 0)} is VALID [2020-07-08 17:37:23,551 INFO L280 TraceCheckUtils]: 72: Hoare triple {4908#(= |main_#t~post0| 0)} ~i~0 := 1 + #t~post0; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,552 INFO L280 TraceCheckUtils]: 73: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~post0; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,552 INFO L280 TraceCheckUtils]: 74: Hoare triple {4909#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,553 INFO L280 TraceCheckUtils]: 75: Hoare triple {4909#(<= main_~i~0 1)} ~w~0 := 0.0; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,553 INFO L280 TraceCheckUtils]: 76: Hoare triple {4909#(<= main_~i~0 1)} ~j~0 := 0; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,554 INFO L280 TraceCheckUtils]: 77: Hoare triple {4909#(<= main_~i~0 1)} assume !!(~j~0 <= ~n~0); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,554 INFO L280 TraceCheckUtils]: 78: Hoare triple {4909#(<= main_~i~0 1)} 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 {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,555 INFO L280 TraceCheckUtils]: 79: Hoare triple {4909#(<= main_~i~0 1)} assume !(~i~0 == ~j~0); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,556 INFO L280 TraceCheckUtils]: 80: Hoare triple {4909#(<= main_~i~0 1)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,556 INFO L280 TraceCheckUtils]: 81: Hoare triple {4909#(<= main_~i~0 1)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,557 INFO L280 TraceCheckUtils]: 82: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~mem3; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,558 INFO L280 TraceCheckUtils]: 83: Hoare triple {4909#(<= main_~i~0 1)} #t~post1 := ~j~0; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,558 INFO L280 TraceCheckUtils]: 84: Hoare triple {4909#(<= main_~i~0 1)} ~j~0 := 1 + #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,559 INFO L280 TraceCheckUtils]: 85: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,560 INFO L280 TraceCheckUtils]: 86: Hoare triple {4909#(<= main_~i~0 1)} assume !!(~j~0 <= ~n~0); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,561 INFO L280 TraceCheckUtils]: 87: Hoare triple {4909#(<= main_~i~0 1)} 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 {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,562 INFO L280 TraceCheckUtils]: 88: Hoare triple {4909#(<= main_~i~0 1)} assume !(~i~0 == ~j~0); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,563 INFO L280 TraceCheckUtils]: 89: Hoare triple {4909#(<= main_~i~0 1)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,563 INFO L280 TraceCheckUtils]: 90: Hoare triple {4909#(<= main_~i~0 1)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,564 INFO L280 TraceCheckUtils]: 91: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~mem3; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,564 INFO L280 TraceCheckUtils]: 92: Hoare triple {4909#(<= main_~i~0 1)} #t~post1 := ~j~0; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,565 INFO L280 TraceCheckUtils]: 93: Hoare triple {4909#(<= main_~i~0 1)} ~j~0 := 1 + #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,565 INFO L280 TraceCheckUtils]: 94: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,566 INFO L280 TraceCheckUtils]: 95: Hoare triple {4909#(<= main_~i~0 1)} assume !!(~j~0 <= ~n~0); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,567 INFO L280 TraceCheckUtils]: 96: Hoare triple {4909#(<= main_~i~0 1)} 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 {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,567 INFO L280 TraceCheckUtils]: 97: Hoare triple {4909#(<= main_~i~0 1)} assume !(~i~0 == ~j~0); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,568 INFO L280 TraceCheckUtils]: 98: Hoare triple {4909#(<= main_~i~0 1)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,569 INFO L280 TraceCheckUtils]: 99: Hoare triple {4909#(<= main_~i~0 1)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,570 INFO L280 TraceCheckUtils]: 100: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~mem3; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,570 INFO L280 TraceCheckUtils]: 101: Hoare triple {4909#(<= main_~i~0 1)} #t~post1 := ~j~0; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,571 INFO L280 TraceCheckUtils]: 102: Hoare triple {4909#(<= main_~i~0 1)} ~j~0 := 1 + #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,572 INFO L280 TraceCheckUtils]: 103: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,573 INFO L280 TraceCheckUtils]: 104: Hoare triple {4909#(<= main_~i~0 1)} assume !!(~j~0 <= ~n~0); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,573 INFO L280 TraceCheckUtils]: 105: Hoare triple {4909#(<= main_~i~0 1)} 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 {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,574 INFO L280 TraceCheckUtils]: 106: Hoare triple {4909#(<= main_~i~0 1)} assume !(~i~0 == ~j~0); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,575 INFO L280 TraceCheckUtils]: 107: Hoare triple {4909#(<= main_~i~0 1)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,576 INFO L280 TraceCheckUtils]: 108: Hoare triple {4909#(<= main_~i~0 1)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,576 INFO L280 TraceCheckUtils]: 109: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~mem3; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,577 INFO L280 TraceCheckUtils]: 110: Hoare triple {4909#(<= main_~i~0 1)} #t~post1 := ~j~0; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,577 INFO L280 TraceCheckUtils]: 111: Hoare triple {4909#(<= main_~i~0 1)} ~j~0 := 1 + #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,578 INFO L280 TraceCheckUtils]: 112: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,579 INFO L280 TraceCheckUtils]: 113: Hoare triple {4909#(<= main_~i~0 1)} assume !(~j~0 <= ~n~0); {4909#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,580 INFO L263 TraceCheckUtils]: 114: Hoare triple {4909#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {4910#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:37:23,581 INFO L280 TraceCheckUtils]: 115: Hoare triple {4910#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4911#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:37:23,581 INFO L280 TraceCheckUtils]: 116: Hoare triple {4911#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4891#false} is VALID [2020-07-08 17:37:23,582 INFO L280 TraceCheckUtils]: 117: Hoare triple {4891#false} assume !false; {4891#false} is VALID [2020-07-08 17:37:23,594 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-08 17:37:23,595 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:23,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334400074] [2020-07-08 17:37:23,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:23,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 17:37:23,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597148585] [2020-07-08 17:37:23,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 118 [2020-07-08 17:37:23,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:23,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 17:37:23,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:23,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 17:37:23,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 17:37:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:37:23,672 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 8 states. [2020-07-08 17:37:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:25,211 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2020-07-08 17:37:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 17:37:25,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 118 [2020-07-08 17:37:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:37:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2020-07-08 17:37:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:37:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2020-07-08 17:37:25,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 102 transitions. [2020-07-08 17:37:25,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:25,356 INFO L225 Difference]: With dead ends: 208 [2020-07-08 17:37:25,356 INFO L226 Difference]: Without dead ends: 206 [2020-07-08 17:37:25,357 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-08 17:37:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-08 17:37:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2020-07-08 17:37:26,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:26,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 203 states. [2020-07-08 17:37:26,023 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 203 states. [2020-07-08 17:37:26,023 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 203 states. [2020-07-08 17:37:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:26,031 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2020-07-08 17:37:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 220 transitions. [2020-07-08 17:37:26,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:26,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:26,032 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 206 states. [2020-07-08 17:37:26,032 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 206 states. [2020-07-08 17:37:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:26,039 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2020-07-08 17:37:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 220 transitions. [2020-07-08 17:37:26,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:26,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:26,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:26,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-07-08 17:37:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 217 transitions. [2020-07-08 17:37:26,048 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 217 transitions. Word has length 118 [2020-07-08 17:37:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:26,049 INFO L479 AbstractCegarLoop]: Abstraction has 203 states and 217 transitions. [2020-07-08 17:37:26,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 17:37:26,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 203 states and 217 transitions. [2020-07-08 17:37:26,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 217 transitions. [2020-07-08 17:37:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-07-08 17:37:26,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:26,507 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 3, 3, 3, 3, 3, 3, 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] [2020-07-08 17:37:26,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 17:37:26,507 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:26,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2112155237, now seen corresponding path program 5 times [2020-07-08 17:37:26,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:26,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1615316533] [2020-07-08 17:37:26,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:26,821 INFO L280 TraceCheckUtils]: 0: Hoare triple {6193#(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; {6162#true} is VALID [2020-07-08 17:37:26,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {6162#true} #valid := #valid[0 := 0]; {6162#true} is VALID [2020-07-08 17:37:26,822 INFO L280 TraceCheckUtils]: 2: Hoare triple {6162#true} assume 0 < #StackHeapBarrier; {6162#true} is VALID [2020-07-08 17:37:26,822 INFO L280 TraceCheckUtils]: 3: Hoare triple {6162#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {6162#true} is VALID [2020-07-08 17:37:26,822 INFO L280 TraceCheckUtils]: 4: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {6162#true} is VALID [2020-07-08 17:37:26,823 INFO L280 TraceCheckUtils]: 5: Hoare triple {6162#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {6162#true} is VALID [2020-07-08 17:37:26,823 INFO L280 TraceCheckUtils]: 6: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {6162#true} is VALID [2020-07-08 17:37:26,823 INFO L280 TraceCheckUtils]: 7: Hoare triple {6162#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {6162#true} is VALID [2020-07-08 17:37:26,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {6162#true} is VALID [2020-07-08 17:37:26,823 INFO L280 TraceCheckUtils]: 9: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-08 17:37:26,824 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {6162#true} {6162#true} #330#return; {6162#true} is VALID [2020-07-08 17:37:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:26,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {6162#true} ~cond := #in~cond; {6162#true} is VALID [2020-07-08 17:37:26,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {6162#true} assume !(0 == ~cond); {6162#true} is VALID [2020-07-08 17:37:26,830 INFO L280 TraceCheckUtils]: 2: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-08 17:37:26,830 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6162#true} {6163#false} #334#return; {6163#false} is VALID [2020-07-08 17:37:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:26,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {6162#true} ~cond := #in~cond; {6162#true} is VALID [2020-07-08 17:37:26,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {6162#true} assume !(0 == ~cond); {6162#true} is VALID [2020-07-08 17:37:26,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-08 17:37:26,836 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6162#true} {6163#false} #334#return; {6163#false} is VALID [2020-07-08 17:37:26,838 INFO L263 TraceCheckUtils]: 0: Hoare triple {6162#true} call ULTIMATE.init(); {6193#(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-08 17:37:26,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {6193#(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; {6162#true} is VALID [2020-07-08 17:37:26,839 INFO L280 TraceCheckUtils]: 2: Hoare triple {6162#true} #valid := #valid[0 := 0]; {6162#true} is VALID [2020-07-08 17:37:26,839 INFO L280 TraceCheckUtils]: 3: Hoare triple {6162#true} assume 0 < #StackHeapBarrier; {6162#true} is VALID [2020-07-08 17:37:26,839 INFO L280 TraceCheckUtils]: 4: Hoare triple {6162#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {6162#true} is VALID [2020-07-08 17:37:26,840 INFO L280 TraceCheckUtils]: 5: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {6162#true} is VALID [2020-07-08 17:37:26,840 INFO L280 TraceCheckUtils]: 6: Hoare triple {6162#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {6162#true} is VALID [2020-07-08 17:37:26,840 INFO L280 TraceCheckUtils]: 7: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {6162#true} is VALID [2020-07-08 17:37:26,840 INFO L280 TraceCheckUtils]: 8: Hoare triple {6162#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {6162#true} is VALID [2020-07-08 17:37:26,841 INFO L280 TraceCheckUtils]: 9: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {6162#true} is VALID [2020-07-08 17:37:26,841 INFO L280 TraceCheckUtils]: 10: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-08 17:37:26,841 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {6162#true} {6162#true} #330#return; {6162#true} is VALID [2020-07-08 17:37:26,843 INFO L263 TraceCheckUtils]: 12: Hoare triple {6162#true} call #t~ret33 := main(); {6162#true} is VALID [2020-07-08 17:37:26,843 INFO L280 TraceCheckUtils]: 13: Hoare triple {6162#true} havoc ~i~0; {6162#true} is VALID [2020-07-08 17:37:26,843 INFO L280 TraceCheckUtils]: 14: Hoare triple {6162#true} havoc ~j~0; {6162#true} is VALID [2020-07-08 17:37:26,843 INFO L280 TraceCheckUtils]: 15: Hoare triple {6162#true} ~nmax~0 := 50; {6162#true} is VALID [2020-07-08 17:37:26,844 INFO L280 TraceCheckUtils]: 16: Hoare triple {6162#true} ~n~0 := 5; {6175#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:26,845 INFO L280 TraceCheckUtils]: 17: Hoare triple {6175#(<= 5 main_~n~0)} havoc ~chkerr~0; {6175#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:26,846 INFO L280 TraceCheckUtils]: 18: Hoare triple {6175#(<= 5 main_~n~0)} havoc ~eps~0; {6175#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:26,846 INFO L280 TraceCheckUtils]: 19: Hoare triple {6175#(<= 5 main_~n~0)} havoc ~w~0; {6175#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:26,847 INFO L280 TraceCheckUtils]: 20: Hoare triple {6175#(<= 5 main_~n~0)} ~eps~0 := 1.0E-6; {6175#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:26,848 INFO L280 TraceCheckUtils]: 21: Hoare triple {6175#(<= 5 main_~n~0)} ~i~0 := 0; {6175#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:26,849 INFO L280 TraceCheckUtils]: 22: Hoare triple {6175#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0); {6175#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:26,849 INFO L280 TraceCheckUtils]: 23: Hoare triple {6175#(<= 5 main_~n~0)} ~w~0 := 0.0; {6175#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:26,850 INFO L280 TraceCheckUtils]: 24: Hoare triple {6175#(<= 5 main_~n~0)} ~j~0 := 0; {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:26,851 INFO L280 TraceCheckUtils]: 25: Hoare triple {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume !!(~j~0 <= ~n~0); {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:26,852 INFO L280 TraceCheckUtils]: 26: Hoare triple {6176#(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 {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:26,853 INFO L280 TraceCheckUtils]: 27: Hoare triple {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume ~i~0 == ~j~0; {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:26,854 INFO L280 TraceCheckUtils]: 28: Hoare triple {6176#(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 {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:26,855 INFO L280 TraceCheckUtils]: 29: Hoare triple {6176#(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 {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:26,856 INFO L280 TraceCheckUtils]: 30: Hoare triple {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} havoc #t~mem2; {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:26,857 INFO L280 TraceCheckUtils]: 31: Hoare triple {6176#(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 {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:26,858 INFO L280 TraceCheckUtils]: 32: Hoare triple {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:26,859 INFO L280 TraceCheckUtils]: 33: Hoare triple {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} havoc #t~mem3; {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:26,860 INFO L280 TraceCheckUtils]: 34: Hoare triple {6176#(and (<= 5 main_~n~0) (= 0 main_~j~0))} #t~post1 := ~j~0; {6177#(and (<= 5 main_~n~0) (= |main_#t~post1| 0))} is VALID [2020-07-08 17:37:26,861 INFO L280 TraceCheckUtils]: 35: Hoare triple {6177#(and (<= 5 main_~n~0) (= |main_#t~post1| 0))} ~j~0 := 1 + #t~post1; {6178#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:26,862 INFO L280 TraceCheckUtils]: 36: Hoare triple {6178#(<= (+ main_~j~0 4) main_~n~0)} havoc #t~post1; {6178#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:26,863 INFO L280 TraceCheckUtils]: 37: Hoare triple {6178#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0); {6178#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:26,863 INFO L280 TraceCheckUtils]: 38: Hoare triple {6178#(<= (+ main_~j~0 4) main_~n~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 {6178#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:26,864 INFO L280 TraceCheckUtils]: 39: Hoare triple {6178#(<= (+ main_~j~0 4) main_~n~0)} assume !(~i~0 == ~j~0); {6178#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:26,865 INFO L280 TraceCheckUtils]: 40: Hoare triple {6178#(<= (+ main_~j~0 4) main_~n~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6178#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:26,865 INFO L280 TraceCheckUtils]: 41: Hoare triple {6178#(<= (+ main_~j~0 4) main_~n~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6178#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:26,866 INFO L280 TraceCheckUtils]: 42: Hoare triple {6178#(<= (+ main_~j~0 4) main_~n~0)} havoc #t~mem3; {6178#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:26,867 INFO L280 TraceCheckUtils]: 43: Hoare triple {6178#(<= (+ main_~j~0 4) main_~n~0)} #t~post1 := ~j~0; {6179#(<= (+ |main_#t~post1| 4) main_~n~0)} is VALID [2020-07-08 17:37:26,868 INFO L280 TraceCheckUtils]: 44: Hoare triple {6179#(<= (+ |main_#t~post1| 4) main_~n~0)} ~j~0 := 1 + #t~post1; {6180#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:26,869 INFO L280 TraceCheckUtils]: 45: Hoare triple {6180#(<= (+ main_~j~0 3) main_~n~0)} havoc #t~post1; {6180#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:26,870 INFO L280 TraceCheckUtils]: 46: Hoare triple {6180#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0); {6180#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:26,871 INFO L280 TraceCheckUtils]: 47: Hoare triple {6180#(<= (+ main_~j~0 3) main_~n~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 {6180#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:26,871 INFO L280 TraceCheckUtils]: 48: Hoare triple {6180#(<= (+ main_~j~0 3) main_~n~0)} assume !(~i~0 == ~j~0); {6180#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:26,872 INFO L280 TraceCheckUtils]: 49: Hoare triple {6180#(<= (+ main_~j~0 3) main_~n~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6180#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:26,873 INFO L280 TraceCheckUtils]: 50: Hoare triple {6180#(<= (+ main_~j~0 3) main_~n~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6180#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:26,874 INFO L280 TraceCheckUtils]: 51: Hoare triple {6180#(<= (+ main_~j~0 3) main_~n~0)} havoc #t~mem3; {6180#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:26,874 INFO L280 TraceCheckUtils]: 52: Hoare triple {6180#(<= (+ main_~j~0 3) main_~n~0)} #t~post1 := ~j~0; {6181#(<= (+ |main_#t~post1| 3) main_~n~0)} is VALID [2020-07-08 17:37:26,875 INFO L280 TraceCheckUtils]: 53: Hoare triple {6181#(<= (+ |main_#t~post1| 3) main_~n~0)} ~j~0 := 1 + #t~post1; {6182#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:26,876 INFO L280 TraceCheckUtils]: 54: Hoare triple {6182#(<= (+ main_~j~0 2) main_~n~0)} havoc #t~post1; {6182#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:26,877 INFO L280 TraceCheckUtils]: 55: Hoare triple {6182#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0); {6182#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:26,878 INFO L280 TraceCheckUtils]: 56: Hoare triple {6182#(<= (+ main_~j~0 2) main_~n~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 {6182#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:26,879 INFO L280 TraceCheckUtils]: 57: Hoare triple {6182#(<= (+ main_~j~0 2) main_~n~0)} assume !(~i~0 == ~j~0); {6182#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:26,879 INFO L280 TraceCheckUtils]: 58: Hoare triple {6182#(<= (+ main_~j~0 2) main_~n~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6182#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:26,880 INFO L280 TraceCheckUtils]: 59: Hoare triple {6182#(<= (+ main_~j~0 2) main_~n~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6182#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:26,881 INFO L280 TraceCheckUtils]: 60: Hoare triple {6182#(<= (+ main_~j~0 2) main_~n~0)} havoc #t~mem3; {6182#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:26,882 INFO L280 TraceCheckUtils]: 61: Hoare triple {6182#(<= (+ main_~j~0 2) main_~n~0)} #t~post1 := ~j~0; {6183#(<= (+ |main_#t~post1| 2) main_~n~0)} is VALID [2020-07-08 17:37:26,883 INFO L280 TraceCheckUtils]: 62: Hoare triple {6183#(<= (+ |main_#t~post1| 2) main_~n~0)} ~j~0 := 1 + #t~post1; {6184#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 17:37:26,884 INFO L280 TraceCheckUtils]: 63: Hoare triple {6184#(<= (+ main_~j~0 1) main_~n~0)} havoc #t~post1; {6184#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 17:37:26,885 INFO L280 TraceCheckUtils]: 64: Hoare triple {6184#(<= (+ main_~j~0 1) main_~n~0)} assume !(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,885 INFO L263 TraceCheckUtils]: 65: Hoare triple {6163#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {6162#true} is VALID [2020-07-08 17:37:26,885 INFO L280 TraceCheckUtils]: 66: Hoare triple {6162#true} ~cond := #in~cond; {6162#true} is VALID [2020-07-08 17:37:26,885 INFO L280 TraceCheckUtils]: 67: Hoare triple {6162#true} assume !(0 == ~cond); {6162#true} is VALID [2020-07-08 17:37:26,885 INFO L280 TraceCheckUtils]: 68: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-08 17:37:26,886 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {6162#true} {6163#false} #334#return; {6163#false} is VALID [2020-07-08 17:37:26,886 INFO L280 TraceCheckUtils]: 70: Hoare triple {6163#false} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {6163#false} is VALID [2020-07-08 17:37:26,886 INFO L280 TraceCheckUtils]: 71: Hoare triple {6163#false} #t~post0 := ~i~0; {6163#false} is VALID [2020-07-08 17:37:26,886 INFO L280 TraceCheckUtils]: 72: Hoare triple {6163#false} ~i~0 := 1 + #t~post0; {6163#false} is VALID [2020-07-08 17:37:26,887 INFO L280 TraceCheckUtils]: 73: Hoare triple {6163#false} havoc #t~post0; {6163#false} is VALID [2020-07-08 17:37:26,887 INFO L280 TraceCheckUtils]: 74: Hoare triple {6163#false} assume !!(~i~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,887 INFO L280 TraceCheckUtils]: 75: Hoare triple {6163#false} ~w~0 := 0.0; {6163#false} is VALID [2020-07-08 17:37:26,887 INFO L280 TraceCheckUtils]: 76: Hoare triple {6163#false} ~j~0 := 0; {6163#false} is VALID [2020-07-08 17:37:26,887 INFO L280 TraceCheckUtils]: 77: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,888 INFO L280 TraceCheckUtils]: 78: Hoare triple {6163#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 {6163#false} is VALID [2020-07-08 17:37:26,888 INFO L280 TraceCheckUtils]: 79: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-08 17:37:26,888 INFO L280 TraceCheckUtils]: 80: Hoare triple {6163#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6163#false} is VALID [2020-07-08 17:37:26,888 INFO L280 TraceCheckUtils]: 81: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-08 17:37:26,889 INFO L280 TraceCheckUtils]: 82: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-08 17:37:26,889 INFO L280 TraceCheckUtils]: 83: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-08 17:37:26,889 INFO L280 TraceCheckUtils]: 84: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,889 INFO L280 TraceCheckUtils]: 85: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,889 INFO L280 TraceCheckUtils]: 86: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,890 INFO L280 TraceCheckUtils]: 87: Hoare triple {6163#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 {6163#false} is VALID [2020-07-08 17:37:26,890 INFO L280 TraceCheckUtils]: 88: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-08 17:37:26,890 INFO L280 TraceCheckUtils]: 89: Hoare triple {6163#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6163#false} is VALID [2020-07-08 17:37:26,890 INFO L280 TraceCheckUtils]: 90: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-08 17:37:26,891 INFO L280 TraceCheckUtils]: 91: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-08 17:37:26,891 INFO L280 TraceCheckUtils]: 92: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-08 17:37:26,891 INFO L280 TraceCheckUtils]: 93: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,891 INFO L280 TraceCheckUtils]: 94: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,891 INFO L280 TraceCheckUtils]: 95: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,892 INFO L280 TraceCheckUtils]: 96: Hoare triple {6163#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 {6163#false} is VALID [2020-07-08 17:37:26,892 INFO L280 TraceCheckUtils]: 97: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-08 17:37:26,892 INFO L280 TraceCheckUtils]: 98: Hoare triple {6163#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6163#false} is VALID [2020-07-08 17:37:26,892 INFO L280 TraceCheckUtils]: 99: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-08 17:37:26,893 INFO L280 TraceCheckUtils]: 100: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-08 17:37:26,893 INFO L280 TraceCheckUtils]: 101: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-08 17:37:26,893 INFO L280 TraceCheckUtils]: 102: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,893 INFO L280 TraceCheckUtils]: 103: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,894 INFO L280 TraceCheckUtils]: 104: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,894 INFO L280 TraceCheckUtils]: 105: Hoare triple {6163#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 {6163#false} is VALID [2020-07-08 17:37:26,894 INFO L280 TraceCheckUtils]: 106: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-08 17:37:26,894 INFO L280 TraceCheckUtils]: 107: Hoare triple {6163#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6163#false} is VALID [2020-07-08 17:37:26,894 INFO L280 TraceCheckUtils]: 108: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-08 17:37:26,895 INFO L280 TraceCheckUtils]: 109: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-08 17:37:26,895 INFO L280 TraceCheckUtils]: 110: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-08 17:37:26,895 INFO L280 TraceCheckUtils]: 111: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,895 INFO L280 TraceCheckUtils]: 112: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,895 INFO L280 TraceCheckUtils]: 113: Hoare triple {6163#false} assume !(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,896 INFO L263 TraceCheckUtils]: 114: Hoare triple {6163#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {6162#true} is VALID [2020-07-08 17:37:26,896 INFO L280 TraceCheckUtils]: 115: Hoare triple {6162#true} ~cond := #in~cond; {6162#true} is VALID [2020-07-08 17:37:26,896 INFO L280 TraceCheckUtils]: 116: Hoare triple {6162#true} assume !(0 == ~cond); {6162#true} is VALID [2020-07-08 17:37:26,896 INFO L280 TraceCheckUtils]: 117: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-08 17:37:26,897 INFO L275 TraceCheckUtils]: 118: Hoare quadruple {6162#true} {6163#false} #334#return; {6163#false} is VALID [2020-07-08 17:37:26,897 INFO L280 TraceCheckUtils]: 119: Hoare triple {6163#false} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {6163#false} is VALID [2020-07-08 17:37:26,897 INFO L280 TraceCheckUtils]: 120: Hoare triple {6163#false} #t~post0 := ~i~0; {6163#false} is VALID [2020-07-08 17:37:26,897 INFO L280 TraceCheckUtils]: 121: Hoare triple {6163#false} ~i~0 := 1 + #t~post0; {6163#false} is VALID [2020-07-08 17:37:26,897 INFO L280 TraceCheckUtils]: 122: Hoare triple {6163#false} havoc #t~post0; {6163#false} is VALID [2020-07-08 17:37:26,898 INFO L280 TraceCheckUtils]: 123: Hoare triple {6163#false} assume !!(~i~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,898 INFO L280 TraceCheckUtils]: 124: Hoare triple {6163#false} ~w~0 := 0.0; {6163#false} is VALID [2020-07-08 17:37:26,898 INFO L280 TraceCheckUtils]: 125: Hoare triple {6163#false} ~j~0 := 0; {6163#false} is VALID [2020-07-08 17:37:26,898 INFO L280 TraceCheckUtils]: 126: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,899 INFO L280 TraceCheckUtils]: 127: Hoare triple {6163#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 {6163#false} is VALID [2020-07-08 17:37:26,899 INFO L280 TraceCheckUtils]: 128: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-08 17:37:26,899 INFO L280 TraceCheckUtils]: 129: Hoare triple {6163#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6163#false} is VALID [2020-07-08 17:37:26,899 INFO L280 TraceCheckUtils]: 130: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-08 17:37:26,900 INFO L280 TraceCheckUtils]: 131: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-08 17:37:26,900 INFO L280 TraceCheckUtils]: 132: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-08 17:37:26,900 INFO L280 TraceCheckUtils]: 133: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,900 INFO L280 TraceCheckUtils]: 134: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,900 INFO L280 TraceCheckUtils]: 135: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,901 INFO L280 TraceCheckUtils]: 136: Hoare triple {6163#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 {6163#false} is VALID [2020-07-08 17:37:26,901 INFO L280 TraceCheckUtils]: 137: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-08 17:37:26,901 INFO L280 TraceCheckUtils]: 138: Hoare triple {6163#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6163#false} is VALID [2020-07-08 17:37:26,901 INFO L280 TraceCheckUtils]: 139: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-08 17:37:26,901 INFO L280 TraceCheckUtils]: 140: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-08 17:37:26,902 INFO L280 TraceCheckUtils]: 141: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-08 17:37:26,902 INFO L280 TraceCheckUtils]: 142: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,902 INFO L280 TraceCheckUtils]: 143: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,902 INFO L280 TraceCheckUtils]: 144: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,902 INFO L280 TraceCheckUtils]: 145: Hoare triple {6163#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 {6163#false} is VALID [2020-07-08 17:37:26,903 INFO L280 TraceCheckUtils]: 146: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-08 17:37:26,903 INFO L280 TraceCheckUtils]: 147: Hoare triple {6163#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6163#false} is VALID [2020-07-08 17:37:26,903 INFO L280 TraceCheckUtils]: 148: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-08 17:37:26,903 INFO L280 TraceCheckUtils]: 149: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-08 17:37:26,903 INFO L280 TraceCheckUtils]: 150: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-08 17:37:26,904 INFO L280 TraceCheckUtils]: 151: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,904 INFO L280 TraceCheckUtils]: 152: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,904 INFO L280 TraceCheckUtils]: 153: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,904 INFO L280 TraceCheckUtils]: 154: Hoare triple {6163#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 {6163#false} is VALID [2020-07-08 17:37:26,904 INFO L280 TraceCheckUtils]: 155: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-08 17:37:26,905 INFO L280 TraceCheckUtils]: 156: Hoare triple {6163#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {6163#false} is VALID [2020-07-08 17:37:26,905 INFO L280 TraceCheckUtils]: 157: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-08 17:37:26,905 INFO L280 TraceCheckUtils]: 158: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-08 17:37:26,905 INFO L280 TraceCheckUtils]: 159: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-08 17:37:26,905 INFO L280 TraceCheckUtils]: 160: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,906 INFO L280 TraceCheckUtils]: 161: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-08 17:37:26,906 INFO L280 TraceCheckUtils]: 162: Hoare triple {6163#false} assume !(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-08 17:37:26,906 INFO L263 TraceCheckUtils]: 163: Hoare triple {6163#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {6163#false} is VALID [2020-07-08 17:37:26,906 INFO L280 TraceCheckUtils]: 164: Hoare triple {6163#false} ~cond := #in~cond; {6163#false} is VALID [2020-07-08 17:37:26,906 INFO L280 TraceCheckUtils]: 165: Hoare triple {6163#false} assume 0 == ~cond; {6163#false} is VALID [2020-07-08 17:37:26,907 INFO L280 TraceCheckUtils]: 166: Hoare triple {6163#false} assume !false; {6163#false} is VALID [2020-07-08 17:37:26,933 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-08 17:37:26,934 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:26,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1615316533] [2020-07-08 17:37:26,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:26,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-08 17:37:26,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569861871] [2020-07-08 17:37:26,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2020-07-08 17:37:26,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:26,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 17:37:27,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:27,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 17:37:27,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:27,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 17:37:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-07-08 17:37:27,042 INFO L87 Difference]: Start difference. First operand 203 states and 217 transitions. Second operand 13 states. [2020-07-08 17:37:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:29,537 INFO L93 Difference]: Finished difference Result 398 states and 431 transitions. [2020-07-08 17:37:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 17:37:29,537 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2020-07-08 17:37:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:37:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 148 transitions. [2020-07-08 17:37:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:37:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 148 transitions. [2020-07-08 17:37:29,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 148 transitions. [2020-07-08 17:37:29,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:29,769 INFO L225 Difference]: With dead ends: 398 [2020-07-08 17:37:29,770 INFO L226 Difference]: Without dead ends: 269 [2020-07-08 17:37:29,771 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2020-07-08 17:37:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-07-08 17:37:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2020-07-08 17:37:30,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:30,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand 239 states. [2020-07-08 17:37:30,577 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 239 states. [2020-07-08 17:37:30,577 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 239 states. [2020-07-08 17:37:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:30,591 INFO L93 Difference]: Finished difference Result 269 states and 289 transitions. [2020-07-08 17:37:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 289 transitions. [2020-07-08 17:37:30,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:30,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:30,592 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 269 states. [2020-07-08 17:37:30,592 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 269 states. [2020-07-08 17:37:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:30,612 INFO L93 Difference]: Finished difference Result 269 states and 289 transitions. [2020-07-08 17:37:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 289 transitions. [2020-07-08 17:37:30,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:30,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:30,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:30,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-08 17:37:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 256 transitions. [2020-07-08 17:37:30,622 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 256 transitions. Word has length 167 [2020-07-08 17:37:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:30,622 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 256 transitions. [2020-07-08 17:37:30,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 17:37:30,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 239 states and 256 transitions. [2020-07-08 17:37:31,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 256 transitions. [2020-07-08 17:37:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-07-08 17:37:31,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:31,140 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 14, 3, 3, 3, 3, 3, 3, 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] [2020-07-08 17:37:31,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 17:37:31,141 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:31,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:31,141 INFO L82 PathProgramCache]: Analyzing trace with hash 917121735, now seen corresponding path program 6 times [2020-07-08 17:37:31,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:31,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2126883235] [2020-07-08 17:37:31,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:31,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {8069#(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; {8036#true} is VALID [2020-07-08 17:37:31,556 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} #valid := #valid[0 := 0]; {8036#true} is VALID [2020-07-08 17:37:31,557 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume 0 < #StackHeapBarrier; {8036#true} is VALID [2020-07-08 17:37:31,557 INFO L280 TraceCheckUtils]: 3: Hoare triple {8036#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {8036#true} is VALID [2020-07-08 17:37:31,557 INFO L280 TraceCheckUtils]: 4: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {8036#true} is VALID [2020-07-08 17:37:31,557 INFO L280 TraceCheckUtils]: 5: Hoare triple {8036#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {8036#true} is VALID [2020-07-08 17:37:31,558 INFO L280 TraceCheckUtils]: 6: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {8036#true} is VALID [2020-07-08 17:37:31,558 INFO L280 TraceCheckUtils]: 7: Hoare triple {8036#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {8036#true} is VALID [2020-07-08 17:37:31,558 INFO L280 TraceCheckUtils]: 8: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {8036#true} is VALID [2020-07-08 17:37:31,559 INFO L280 TraceCheckUtils]: 9: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 17:37:31,559 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {8036#true} {8036#true} #330#return; {8036#true} is VALID [2020-07-08 17:37:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:31,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 17:37:31,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 17:37:31,564 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 17:37:31,565 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8037#false} #334#return; {8037#false} is VALID [2020-07-08 17:37:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:31,570 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 17:37:31,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 17:37:31,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 17:37:31,572 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8037#false} #334#return; {8037#false} is VALID [2020-07-08 17:37:31,574 INFO L263 TraceCheckUtils]: 0: Hoare triple {8036#true} call ULTIMATE.init(); {8069#(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-08 17:37:31,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {8069#(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; {8036#true} is VALID [2020-07-08 17:37:31,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} #valid := #valid[0 := 0]; {8036#true} is VALID [2020-07-08 17:37:31,574 INFO L280 TraceCheckUtils]: 3: Hoare triple {8036#true} assume 0 < #StackHeapBarrier; {8036#true} is VALID [2020-07-08 17:37:31,575 INFO L280 TraceCheckUtils]: 4: Hoare triple {8036#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {8036#true} is VALID [2020-07-08 17:37:31,575 INFO L280 TraceCheckUtils]: 5: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {8036#true} is VALID [2020-07-08 17:37:31,575 INFO L280 TraceCheckUtils]: 6: Hoare triple {8036#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {8036#true} is VALID [2020-07-08 17:37:31,575 INFO L280 TraceCheckUtils]: 7: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {8036#true} is VALID [2020-07-08 17:37:31,576 INFO L280 TraceCheckUtils]: 8: Hoare triple {8036#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {8036#true} is VALID [2020-07-08 17:37:31,576 INFO L280 TraceCheckUtils]: 9: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {8036#true} is VALID [2020-07-08 17:37:31,576 INFO L280 TraceCheckUtils]: 10: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 17:37:31,576 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {8036#true} {8036#true} #330#return; {8036#true} is VALID [2020-07-08 17:37:31,577 INFO L263 TraceCheckUtils]: 12: Hoare triple {8036#true} call #t~ret33 := main(); {8036#true} is VALID [2020-07-08 17:37:31,577 INFO L280 TraceCheckUtils]: 13: Hoare triple {8036#true} havoc ~i~0; {8036#true} is VALID [2020-07-08 17:37:31,577 INFO L280 TraceCheckUtils]: 14: Hoare triple {8036#true} havoc ~j~0; {8036#true} is VALID [2020-07-08 17:37:31,577 INFO L280 TraceCheckUtils]: 15: Hoare triple {8036#true} ~nmax~0 := 50; {8036#true} is VALID [2020-07-08 17:37:31,578 INFO L280 TraceCheckUtils]: 16: Hoare triple {8036#true} ~n~0 := 5; {8049#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:31,579 INFO L280 TraceCheckUtils]: 17: Hoare triple {8049#(<= 5 main_~n~0)} havoc ~chkerr~0; {8049#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:31,580 INFO L280 TraceCheckUtils]: 18: Hoare triple {8049#(<= 5 main_~n~0)} havoc ~eps~0; {8049#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:31,581 INFO L280 TraceCheckUtils]: 19: Hoare triple {8049#(<= 5 main_~n~0)} havoc ~w~0; {8049#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:31,582 INFO L280 TraceCheckUtils]: 20: Hoare triple {8049#(<= 5 main_~n~0)} ~eps~0 := 1.0E-6; {8049#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:31,583 INFO L280 TraceCheckUtils]: 21: Hoare triple {8049#(<= 5 main_~n~0)} ~i~0 := 0; {8049#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:31,584 INFO L280 TraceCheckUtils]: 22: Hoare triple {8049#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0); {8049#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:31,585 INFO L280 TraceCheckUtils]: 23: Hoare triple {8049#(<= 5 main_~n~0)} ~w~0 := 0.0; {8049#(<= 5 main_~n~0)} is VALID [2020-07-08 17:37:31,586 INFO L280 TraceCheckUtils]: 24: Hoare triple {8049#(<= 5 main_~n~0)} ~j~0 := 0; {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:31,586 INFO L280 TraceCheckUtils]: 25: Hoare triple {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume !!(~j~0 <= ~n~0); {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:31,588 INFO L280 TraceCheckUtils]: 26: Hoare triple {8050#(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 {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:31,589 INFO L280 TraceCheckUtils]: 27: Hoare triple {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} assume ~i~0 == ~j~0; {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:31,590 INFO L280 TraceCheckUtils]: 28: Hoare triple {8050#(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 {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:31,591 INFO L280 TraceCheckUtils]: 29: Hoare triple {8050#(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 {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:31,593 INFO L280 TraceCheckUtils]: 30: Hoare triple {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} havoc #t~mem2; {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:31,594 INFO L280 TraceCheckUtils]: 31: Hoare triple {8050#(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 {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:31,595 INFO L280 TraceCheckUtils]: 32: Hoare triple {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:31,597 INFO L280 TraceCheckUtils]: 33: Hoare triple {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} havoc #t~mem3; {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} is VALID [2020-07-08 17:37:31,598 INFO L280 TraceCheckUtils]: 34: Hoare triple {8050#(and (<= 5 main_~n~0) (= 0 main_~j~0))} #t~post1 := ~j~0; {8051#(and (<= 5 main_~n~0) (= |main_#t~post1| 0))} is VALID [2020-07-08 17:37:31,599 INFO L280 TraceCheckUtils]: 35: Hoare triple {8051#(and (<= 5 main_~n~0) (= |main_#t~post1| 0))} ~j~0 := 1 + #t~post1; {8052#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:31,600 INFO L280 TraceCheckUtils]: 36: Hoare triple {8052#(<= (+ main_~j~0 4) main_~n~0)} havoc #t~post1; {8052#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:31,600 INFO L280 TraceCheckUtils]: 37: Hoare triple {8052#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0); {8052#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:31,601 INFO L280 TraceCheckUtils]: 38: Hoare triple {8052#(<= (+ main_~j~0 4) main_~n~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 {8052#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:31,602 INFO L280 TraceCheckUtils]: 39: Hoare triple {8052#(<= (+ main_~j~0 4) main_~n~0)} assume !(~i~0 == ~j~0); {8052#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:31,603 INFO L280 TraceCheckUtils]: 40: Hoare triple {8052#(<= (+ main_~j~0 4) main_~n~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8052#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:31,604 INFO L280 TraceCheckUtils]: 41: Hoare triple {8052#(<= (+ main_~j~0 4) main_~n~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8052#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:31,605 INFO L280 TraceCheckUtils]: 42: Hoare triple {8052#(<= (+ main_~j~0 4) main_~n~0)} havoc #t~mem3; {8052#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2020-07-08 17:37:31,606 INFO L280 TraceCheckUtils]: 43: Hoare triple {8052#(<= (+ main_~j~0 4) main_~n~0)} #t~post1 := ~j~0; {8053#(<= (+ |main_#t~post1| 4) main_~n~0)} is VALID [2020-07-08 17:37:31,607 INFO L280 TraceCheckUtils]: 44: Hoare triple {8053#(<= (+ |main_#t~post1| 4) main_~n~0)} ~j~0 := 1 + #t~post1; {8054#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:31,609 INFO L280 TraceCheckUtils]: 45: Hoare triple {8054#(<= (+ main_~j~0 3) main_~n~0)} havoc #t~post1; {8054#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:31,610 INFO L280 TraceCheckUtils]: 46: Hoare triple {8054#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0); {8054#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:31,611 INFO L280 TraceCheckUtils]: 47: Hoare triple {8054#(<= (+ main_~j~0 3) main_~n~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 {8054#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:31,612 INFO L280 TraceCheckUtils]: 48: Hoare triple {8054#(<= (+ main_~j~0 3) main_~n~0)} assume !(~i~0 == ~j~0); {8054#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:31,612 INFO L280 TraceCheckUtils]: 49: Hoare triple {8054#(<= (+ main_~j~0 3) main_~n~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8054#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:31,613 INFO L280 TraceCheckUtils]: 50: Hoare triple {8054#(<= (+ main_~j~0 3) main_~n~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8054#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:31,613 INFO L280 TraceCheckUtils]: 51: Hoare triple {8054#(<= (+ main_~j~0 3) main_~n~0)} havoc #t~mem3; {8054#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2020-07-08 17:37:31,614 INFO L280 TraceCheckUtils]: 52: Hoare triple {8054#(<= (+ main_~j~0 3) main_~n~0)} #t~post1 := ~j~0; {8055#(<= (+ |main_#t~post1| 3) main_~n~0)} is VALID [2020-07-08 17:37:31,615 INFO L280 TraceCheckUtils]: 53: Hoare triple {8055#(<= (+ |main_#t~post1| 3) main_~n~0)} ~j~0 := 1 + #t~post1; {8056#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:31,616 INFO L280 TraceCheckUtils]: 54: Hoare triple {8056#(<= (+ main_~j~0 2) main_~n~0)} havoc #t~post1; {8056#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:31,617 INFO L280 TraceCheckUtils]: 55: Hoare triple {8056#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0); {8056#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:31,618 INFO L280 TraceCheckUtils]: 56: Hoare triple {8056#(<= (+ main_~j~0 2) main_~n~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 {8056#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:31,619 INFO L280 TraceCheckUtils]: 57: Hoare triple {8056#(<= (+ main_~j~0 2) main_~n~0)} assume !(~i~0 == ~j~0); {8056#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:31,620 INFO L280 TraceCheckUtils]: 58: Hoare triple {8056#(<= (+ main_~j~0 2) main_~n~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8056#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:31,621 INFO L280 TraceCheckUtils]: 59: Hoare triple {8056#(<= (+ main_~j~0 2) main_~n~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8056#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:31,622 INFO L280 TraceCheckUtils]: 60: Hoare triple {8056#(<= (+ main_~j~0 2) main_~n~0)} havoc #t~mem3; {8056#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2020-07-08 17:37:31,623 INFO L280 TraceCheckUtils]: 61: Hoare triple {8056#(<= (+ main_~j~0 2) main_~n~0)} #t~post1 := ~j~0; {8057#(<= (+ |main_#t~post1| 2) main_~n~0)} is VALID [2020-07-08 17:37:31,625 INFO L280 TraceCheckUtils]: 62: Hoare triple {8057#(<= (+ |main_#t~post1| 2) main_~n~0)} ~j~0 := 1 + #t~post1; {8058#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 17:37:31,626 INFO L280 TraceCheckUtils]: 63: Hoare triple {8058#(<= (+ main_~j~0 1) main_~n~0)} havoc #t~post1; {8058#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 17:37:31,627 INFO L280 TraceCheckUtils]: 64: Hoare triple {8058#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0); {8058#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 17:37:31,627 INFO L280 TraceCheckUtils]: 65: Hoare triple {8058#(<= (+ main_~j~0 1) main_~n~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 {8058#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 17:37:31,628 INFO L280 TraceCheckUtils]: 66: Hoare triple {8058#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {8058#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 17:37:31,629 INFO L280 TraceCheckUtils]: 67: Hoare triple {8058#(<= (+ main_~j~0 1) main_~n~0)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8058#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 17:37:31,630 INFO L280 TraceCheckUtils]: 68: Hoare triple {8058#(<= (+ main_~j~0 1) main_~n~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8058#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 17:37:31,631 INFO L280 TraceCheckUtils]: 69: Hoare triple {8058#(<= (+ main_~j~0 1) main_~n~0)} havoc #t~mem3; {8058#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 17:37:31,632 INFO L280 TraceCheckUtils]: 70: Hoare triple {8058#(<= (+ main_~j~0 1) main_~n~0)} #t~post1 := ~j~0; {8059#(<= (+ |main_#t~post1| 1) main_~n~0)} is VALID [2020-07-08 17:37:31,634 INFO L280 TraceCheckUtils]: 71: Hoare triple {8059#(<= (+ |main_#t~post1| 1) main_~n~0)} ~j~0 := 1 + #t~post1; {8060#(<= main_~j~0 main_~n~0)} is VALID [2020-07-08 17:37:31,635 INFO L280 TraceCheckUtils]: 72: Hoare triple {8060#(<= main_~j~0 main_~n~0)} havoc #t~post1; {8060#(<= main_~j~0 main_~n~0)} is VALID [2020-07-08 17:37:31,636 INFO L280 TraceCheckUtils]: 73: Hoare triple {8060#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,636 INFO L263 TraceCheckUtils]: 74: Hoare triple {8037#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {8036#true} is VALID [2020-07-08 17:37:31,637 INFO L280 TraceCheckUtils]: 75: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 17:37:31,637 INFO L280 TraceCheckUtils]: 76: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 17:37:31,637 INFO L280 TraceCheckUtils]: 77: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 17:37:31,637 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {8036#true} {8037#false} #334#return; {8037#false} is VALID [2020-07-08 17:37:31,638 INFO L280 TraceCheckUtils]: 79: Hoare triple {8037#false} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {8037#false} is VALID [2020-07-08 17:37:31,638 INFO L280 TraceCheckUtils]: 80: Hoare triple {8037#false} #t~post0 := ~i~0; {8037#false} is VALID [2020-07-08 17:37:31,638 INFO L280 TraceCheckUtils]: 81: Hoare triple {8037#false} ~i~0 := 1 + #t~post0; {8037#false} is VALID [2020-07-08 17:37:31,639 INFO L280 TraceCheckUtils]: 82: Hoare triple {8037#false} havoc #t~post0; {8037#false} is VALID [2020-07-08 17:37:31,639 INFO L280 TraceCheckUtils]: 83: Hoare triple {8037#false} assume !!(~i~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,639 INFO L280 TraceCheckUtils]: 84: Hoare triple {8037#false} ~w~0 := 0.0; {8037#false} is VALID [2020-07-08 17:37:31,640 INFO L280 TraceCheckUtils]: 85: Hoare triple {8037#false} ~j~0 := 0; {8037#false} is VALID [2020-07-08 17:37:31,640 INFO L280 TraceCheckUtils]: 86: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,640 INFO L280 TraceCheckUtils]: 87: Hoare triple {8037#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 {8037#false} is VALID [2020-07-08 17:37:31,641 INFO L280 TraceCheckUtils]: 88: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-08 17:37:31,641 INFO L280 TraceCheckUtils]: 89: Hoare triple {8037#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8037#false} is VALID [2020-07-08 17:37:31,641 INFO L280 TraceCheckUtils]: 90: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-08 17:37:31,642 INFO L280 TraceCheckUtils]: 91: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-08 17:37:31,642 INFO L280 TraceCheckUtils]: 92: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-08 17:37:31,642 INFO L280 TraceCheckUtils]: 93: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,643 INFO L280 TraceCheckUtils]: 94: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,643 INFO L280 TraceCheckUtils]: 95: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,643 INFO L280 TraceCheckUtils]: 96: Hoare triple {8037#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 {8037#false} is VALID [2020-07-08 17:37:31,644 INFO L280 TraceCheckUtils]: 97: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-08 17:37:31,644 INFO L280 TraceCheckUtils]: 98: Hoare triple {8037#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8037#false} is VALID [2020-07-08 17:37:31,644 INFO L280 TraceCheckUtils]: 99: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-08 17:37:31,644 INFO L280 TraceCheckUtils]: 100: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-08 17:37:31,645 INFO L280 TraceCheckUtils]: 101: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-08 17:37:31,645 INFO L280 TraceCheckUtils]: 102: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,645 INFO L280 TraceCheckUtils]: 103: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,645 INFO L280 TraceCheckUtils]: 104: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,646 INFO L280 TraceCheckUtils]: 105: Hoare triple {8037#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 {8037#false} is VALID [2020-07-08 17:37:31,646 INFO L280 TraceCheckUtils]: 106: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-08 17:37:31,646 INFO L280 TraceCheckUtils]: 107: Hoare triple {8037#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8037#false} is VALID [2020-07-08 17:37:31,646 INFO L280 TraceCheckUtils]: 108: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-08 17:37:31,647 INFO L280 TraceCheckUtils]: 109: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-08 17:37:31,647 INFO L280 TraceCheckUtils]: 110: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-08 17:37:31,647 INFO L280 TraceCheckUtils]: 111: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,647 INFO L280 TraceCheckUtils]: 112: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,648 INFO L280 TraceCheckUtils]: 113: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,648 INFO L280 TraceCheckUtils]: 114: Hoare triple {8037#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 {8037#false} is VALID [2020-07-08 17:37:31,648 INFO L280 TraceCheckUtils]: 115: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-08 17:37:31,649 INFO L280 TraceCheckUtils]: 116: Hoare triple {8037#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8037#false} is VALID [2020-07-08 17:37:31,649 INFO L280 TraceCheckUtils]: 117: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-08 17:37:31,649 INFO L280 TraceCheckUtils]: 118: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-08 17:37:31,649 INFO L280 TraceCheckUtils]: 119: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-08 17:37:31,650 INFO L280 TraceCheckUtils]: 120: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,650 INFO L280 TraceCheckUtils]: 121: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,650 INFO L280 TraceCheckUtils]: 122: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,650 INFO L280 TraceCheckUtils]: 123: Hoare triple {8037#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 {8037#false} is VALID [2020-07-08 17:37:31,651 INFO L280 TraceCheckUtils]: 124: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-08 17:37:31,651 INFO L280 TraceCheckUtils]: 125: Hoare triple {8037#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8037#false} is VALID [2020-07-08 17:37:31,651 INFO L280 TraceCheckUtils]: 126: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-08 17:37:31,651 INFO L280 TraceCheckUtils]: 127: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-08 17:37:31,651 INFO L280 TraceCheckUtils]: 128: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-08 17:37:31,652 INFO L280 TraceCheckUtils]: 129: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,652 INFO L280 TraceCheckUtils]: 130: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,652 INFO L280 TraceCheckUtils]: 131: Hoare triple {8037#false} assume !(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,653 INFO L263 TraceCheckUtils]: 132: Hoare triple {8037#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {8036#true} is VALID [2020-07-08 17:37:31,653 INFO L280 TraceCheckUtils]: 133: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 17:37:31,653 INFO L280 TraceCheckUtils]: 134: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 17:37:31,653 INFO L280 TraceCheckUtils]: 135: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 17:37:31,654 INFO L275 TraceCheckUtils]: 136: Hoare quadruple {8036#true} {8037#false} #334#return; {8037#false} is VALID [2020-07-08 17:37:31,654 INFO L280 TraceCheckUtils]: 137: Hoare triple {8037#false} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {8037#false} is VALID [2020-07-08 17:37:31,654 INFO L280 TraceCheckUtils]: 138: Hoare triple {8037#false} #t~post0 := ~i~0; {8037#false} is VALID [2020-07-08 17:37:31,654 INFO L280 TraceCheckUtils]: 139: Hoare triple {8037#false} ~i~0 := 1 + #t~post0; {8037#false} is VALID [2020-07-08 17:37:31,655 INFO L280 TraceCheckUtils]: 140: Hoare triple {8037#false} havoc #t~post0; {8037#false} is VALID [2020-07-08 17:37:31,655 INFO L280 TraceCheckUtils]: 141: Hoare triple {8037#false} assume !!(~i~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,655 INFO L280 TraceCheckUtils]: 142: Hoare triple {8037#false} ~w~0 := 0.0; {8037#false} is VALID [2020-07-08 17:37:31,655 INFO L280 TraceCheckUtils]: 143: Hoare triple {8037#false} ~j~0 := 0; {8037#false} is VALID [2020-07-08 17:37:31,655 INFO L280 TraceCheckUtils]: 144: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,656 INFO L280 TraceCheckUtils]: 145: Hoare triple {8037#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 {8037#false} is VALID [2020-07-08 17:37:31,656 INFO L280 TraceCheckUtils]: 146: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-08 17:37:31,656 INFO L280 TraceCheckUtils]: 147: Hoare triple {8037#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8037#false} is VALID [2020-07-08 17:37:31,656 INFO L280 TraceCheckUtils]: 148: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-08 17:37:31,656 INFO L280 TraceCheckUtils]: 149: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-08 17:37:31,657 INFO L280 TraceCheckUtils]: 150: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-08 17:37:31,657 INFO L280 TraceCheckUtils]: 151: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,657 INFO L280 TraceCheckUtils]: 152: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,657 INFO L280 TraceCheckUtils]: 153: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,658 INFO L280 TraceCheckUtils]: 154: Hoare triple {8037#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 {8037#false} is VALID [2020-07-08 17:37:31,658 INFO L280 TraceCheckUtils]: 155: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-08 17:37:31,658 INFO L280 TraceCheckUtils]: 156: Hoare triple {8037#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8037#false} is VALID [2020-07-08 17:37:31,659 INFO L280 TraceCheckUtils]: 157: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-08 17:37:31,659 INFO L280 TraceCheckUtils]: 158: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-08 17:37:31,659 INFO L280 TraceCheckUtils]: 159: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-08 17:37:31,660 INFO L280 TraceCheckUtils]: 160: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,660 INFO L280 TraceCheckUtils]: 161: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,660 INFO L280 TraceCheckUtils]: 162: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,661 INFO L280 TraceCheckUtils]: 163: Hoare triple {8037#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 {8037#false} is VALID [2020-07-08 17:37:31,661 INFO L280 TraceCheckUtils]: 164: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-08 17:37:31,661 INFO L280 TraceCheckUtils]: 165: Hoare triple {8037#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8037#false} is VALID [2020-07-08 17:37:31,661 INFO L280 TraceCheckUtils]: 166: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-08 17:37:31,662 INFO L280 TraceCheckUtils]: 167: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-08 17:37:31,662 INFO L280 TraceCheckUtils]: 168: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-08 17:37:31,662 INFO L280 TraceCheckUtils]: 169: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,662 INFO L280 TraceCheckUtils]: 170: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,663 INFO L280 TraceCheckUtils]: 171: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,663 INFO L280 TraceCheckUtils]: 172: Hoare triple {8037#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 {8037#false} is VALID [2020-07-08 17:37:31,663 INFO L280 TraceCheckUtils]: 173: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-08 17:37:31,664 INFO L280 TraceCheckUtils]: 174: Hoare triple {8037#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8037#false} is VALID [2020-07-08 17:37:31,664 INFO L280 TraceCheckUtils]: 175: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-08 17:37:31,664 INFO L280 TraceCheckUtils]: 176: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-08 17:37:31,664 INFO L280 TraceCheckUtils]: 177: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-08 17:37:31,665 INFO L280 TraceCheckUtils]: 178: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,665 INFO L280 TraceCheckUtils]: 179: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,665 INFO L280 TraceCheckUtils]: 180: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,666 INFO L280 TraceCheckUtils]: 181: Hoare triple {8037#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 {8037#false} is VALID [2020-07-08 17:37:31,666 INFO L280 TraceCheckUtils]: 182: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-08 17:37:31,666 INFO L280 TraceCheckUtils]: 183: Hoare triple {8037#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {8037#false} is VALID [2020-07-08 17:37:31,667 INFO L280 TraceCheckUtils]: 184: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-08 17:37:31,667 INFO L280 TraceCheckUtils]: 185: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-08 17:37:31,667 INFO L280 TraceCheckUtils]: 186: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-08 17:37:31,668 INFO L280 TraceCheckUtils]: 187: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,668 INFO L280 TraceCheckUtils]: 188: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-08 17:37:31,668 INFO L280 TraceCheckUtils]: 189: Hoare triple {8037#false} assume !(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-08 17:37:31,668 INFO L263 TraceCheckUtils]: 190: Hoare triple {8037#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {8037#false} is VALID [2020-07-08 17:37:31,669 INFO L280 TraceCheckUtils]: 191: Hoare triple {8037#false} ~cond := #in~cond; {8037#false} is VALID [2020-07-08 17:37:31,669 INFO L280 TraceCheckUtils]: 192: Hoare triple {8037#false} assume 0 == ~cond; {8037#false} is VALID [2020-07-08 17:37:31,669 INFO L280 TraceCheckUtils]: 193: Hoare triple {8037#false} assume !false; {8037#false} is VALID [2020-07-08 17:37:31,744 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-08 17:37:31,745 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:31,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2126883235] [2020-07-08 17:37:31,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:31,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-08 17:37:31,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456965826] [2020-07-08 17:37:31,746 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 194 [2020-07-08 17:37:31,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:31,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 17:37:31,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:31,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 17:37:31,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 17:37:31,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-07-08 17:37:31,876 INFO L87 Difference]: Start difference. First operand 239 states and 256 transitions. Second operand 15 states. [2020-07-08 17:37:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:34,630 INFO L93 Difference]: Finished difference Result 428 states and 463 transitions. [2020-07-08 17:37:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-08 17:37:34,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 194 [2020-07-08 17:37:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 17:37:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 150 transitions. [2020-07-08 17:37:34,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 17:37:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 150 transitions. [2020-07-08 17:37:34,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 150 transitions. [2020-07-08 17:37:34,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:34,856 INFO L225 Difference]: With dead ends: 428 [2020-07-08 17:37:34,856 INFO L226 Difference]: Without dead ends: 275 [2020-07-08 17:37:34,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2020-07-08 17:37:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-07-08 17:37:35,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2020-07-08 17:37:35,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:35,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 275 states. [2020-07-08 17:37:35,842 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 275 states. [2020-07-08 17:37:35,842 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 275 states. [2020-07-08 17:37:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:35,851 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2020-07-08 17:37:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 295 transitions. [2020-07-08 17:37:35,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:35,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:35,852 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 275 states. [2020-07-08 17:37:35,853 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 275 states. [2020-07-08 17:37:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:35,861 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2020-07-08 17:37:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 295 transitions. [2020-07-08 17:37:35,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:35,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:35,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:35,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-07-08 17:37:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 295 transitions. [2020-07-08 17:37:35,871 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 295 transitions. Word has length 194 [2020-07-08 17:37:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:35,871 INFO L479 AbstractCegarLoop]: Abstraction has 275 states and 295 transitions. [2020-07-08 17:37:35,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 17:37:35,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 275 states and 295 transitions. [2020-07-08 17:37:36,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 295 transitions. [2020-07-08 17:37:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2020-07-08 17:37:36,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:36,485 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 17, 3, 3, 3, 3, 3, 3, 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] [2020-07-08 17:37:36,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 17:37:36,485 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:36,486 INFO L82 PathProgramCache]: Analyzing trace with hash 374306853, now seen corresponding path program 7 times [2020-07-08 17:37:36,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:36,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [779636335] [2020-07-08 17:37:36,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:36,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {10089#(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; {10062#true} is VALID [2020-07-08 17:37:36,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {10062#true} #valid := #valid[0 := 0]; {10062#true} is VALID [2020-07-08 17:37:36,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {10062#true} assume 0 < #StackHeapBarrier; {10062#true} is VALID [2020-07-08 17:37:36,897 INFO L280 TraceCheckUtils]: 3: Hoare triple {10062#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {10062#true} is VALID [2020-07-08 17:37:36,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {10062#true} is VALID [2020-07-08 17:37:36,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {10062#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {10062#true} is VALID [2020-07-08 17:37:36,898 INFO L280 TraceCheckUtils]: 6: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {10062#true} is VALID [2020-07-08 17:37:36,898 INFO L280 TraceCheckUtils]: 7: Hoare triple {10062#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {10062#true} is VALID [2020-07-08 17:37:36,898 INFO L280 TraceCheckUtils]: 8: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {10062#true} is VALID [2020-07-08 17:37:36,898 INFO L280 TraceCheckUtils]: 9: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-08 17:37:36,899 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {10062#true} {10062#true} #330#return; {10062#true} is VALID [2020-07-08 17:37:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:36,904 INFO L280 TraceCheckUtils]: 0: Hoare triple {10062#true} ~cond := #in~cond; {10062#true} is VALID [2020-07-08 17:37:36,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {10062#true} assume !(0 == ~cond); {10062#true} is VALID [2020-07-08 17:37:36,905 INFO L280 TraceCheckUtils]: 2: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-08 17:37:36,907 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10062#true} {10075#(= 0 main_~i~0)} #334#return; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:36,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {10062#true} ~cond := #in~cond; {10062#true} is VALID [2020-07-08 17:37:36,910 INFO L280 TraceCheckUtils]: 1: Hoare triple {10062#true} assume !(0 == ~cond); {10062#true} is VALID [2020-07-08 17:37:36,910 INFO L280 TraceCheckUtils]: 2: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-08 17:37:36,911 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10062#true} {10063#false} #334#return; {10063#false} is VALID [2020-07-08 17:37:36,912 INFO L263 TraceCheckUtils]: 0: Hoare triple {10062#true} call ULTIMATE.init(); {10089#(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-08 17:37:36,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {10089#(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; {10062#true} is VALID [2020-07-08 17:37:36,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {10062#true} #valid := #valid[0 := 0]; {10062#true} is VALID [2020-07-08 17:37:36,913 INFO L280 TraceCheckUtils]: 3: Hoare triple {10062#true} assume 0 < #StackHeapBarrier; {10062#true} is VALID [2020-07-08 17:37:36,913 INFO L280 TraceCheckUtils]: 4: Hoare triple {10062#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {10062#true} is VALID [2020-07-08 17:37:36,913 INFO L280 TraceCheckUtils]: 5: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {10062#true} is VALID [2020-07-08 17:37:36,914 INFO L280 TraceCheckUtils]: 6: Hoare triple {10062#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {10062#true} is VALID [2020-07-08 17:37:36,914 INFO L280 TraceCheckUtils]: 7: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {10062#true} is VALID [2020-07-08 17:37:36,914 INFO L280 TraceCheckUtils]: 8: Hoare triple {10062#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {10062#true} is VALID [2020-07-08 17:37:36,914 INFO L280 TraceCheckUtils]: 9: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {10062#true} is VALID [2020-07-08 17:37:36,914 INFO L280 TraceCheckUtils]: 10: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-08 17:37:36,915 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {10062#true} {10062#true} #330#return; {10062#true} is VALID [2020-07-08 17:37:36,915 INFO L263 TraceCheckUtils]: 12: Hoare triple {10062#true} call #t~ret33 := main(); {10062#true} is VALID [2020-07-08 17:37:36,915 INFO L280 TraceCheckUtils]: 13: Hoare triple {10062#true} havoc ~i~0; {10062#true} is VALID [2020-07-08 17:37:36,915 INFO L280 TraceCheckUtils]: 14: Hoare triple {10062#true} havoc ~j~0; {10062#true} is VALID [2020-07-08 17:37:36,915 INFO L280 TraceCheckUtils]: 15: Hoare triple {10062#true} ~nmax~0 := 50; {10062#true} is VALID [2020-07-08 17:37:36,916 INFO L280 TraceCheckUtils]: 16: Hoare triple {10062#true} ~n~0 := 5; {10062#true} is VALID [2020-07-08 17:37:36,916 INFO L280 TraceCheckUtils]: 17: Hoare triple {10062#true} havoc ~chkerr~0; {10062#true} is VALID [2020-07-08 17:37:36,916 INFO L280 TraceCheckUtils]: 18: Hoare triple {10062#true} havoc ~eps~0; {10062#true} is VALID [2020-07-08 17:37:36,916 INFO L280 TraceCheckUtils]: 19: Hoare triple {10062#true} havoc ~w~0; {10062#true} is VALID [2020-07-08 17:37:36,916 INFO L280 TraceCheckUtils]: 20: Hoare triple {10062#true} ~eps~0 := 1.0E-6; {10062#true} is VALID [2020-07-08 17:37:36,918 INFO L280 TraceCheckUtils]: 21: Hoare triple {10062#true} ~i~0 := 0; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,918 INFO L280 TraceCheckUtils]: 22: Hoare triple {10075#(= 0 main_~i~0)} assume !!(~i~0 <= ~n~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,920 INFO L280 TraceCheckUtils]: 23: Hoare triple {10075#(= 0 main_~i~0)} ~w~0 := 0.0; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,920 INFO L280 TraceCheckUtils]: 24: Hoare triple {10075#(= 0 main_~i~0)} ~j~0 := 0; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,921 INFO L280 TraceCheckUtils]: 25: Hoare triple {10075#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,921 INFO L280 TraceCheckUtils]: 26: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,922 INFO L280 TraceCheckUtils]: 27: Hoare triple {10075#(= 0 main_~i~0)} assume ~i~0 == ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,922 INFO L280 TraceCheckUtils]: 28: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,923 INFO L280 TraceCheckUtils]: 29: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,923 INFO L280 TraceCheckUtils]: 30: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem2; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,924 INFO L280 TraceCheckUtils]: 31: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,924 INFO L280 TraceCheckUtils]: 32: Hoare triple {10075#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,925 INFO L280 TraceCheckUtils]: 33: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,926 INFO L280 TraceCheckUtils]: 34: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,926 INFO L280 TraceCheckUtils]: 35: Hoare triple {10075#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,927 INFO L280 TraceCheckUtils]: 36: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,927 INFO L280 TraceCheckUtils]: 37: Hoare triple {10075#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,928 INFO L280 TraceCheckUtils]: 38: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,929 INFO L280 TraceCheckUtils]: 39: Hoare triple {10075#(= 0 main_~i~0)} assume !(~i~0 == ~j~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,929 INFO L280 TraceCheckUtils]: 40: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,930 INFO L280 TraceCheckUtils]: 41: Hoare triple {10075#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,931 INFO L280 TraceCheckUtils]: 42: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,931 INFO L280 TraceCheckUtils]: 43: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,932 INFO L280 TraceCheckUtils]: 44: Hoare triple {10075#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,933 INFO L280 TraceCheckUtils]: 45: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,933 INFO L280 TraceCheckUtils]: 46: Hoare triple {10075#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,934 INFO L280 TraceCheckUtils]: 47: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,935 INFO L280 TraceCheckUtils]: 48: Hoare triple {10075#(= 0 main_~i~0)} assume !(~i~0 == ~j~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,935 INFO L280 TraceCheckUtils]: 49: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,936 INFO L280 TraceCheckUtils]: 50: Hoare triple {10075#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,936 INFO L280 TraceCheckUtils]: 51: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,937 INFO L280 TraceCheckUtils]: 52: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,937 INFO L280 TraceCheckUtils]: 53: Hoare triple {10075#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,938 INFO L280 TraceCheckUtils]: 54: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,939 INFO L280 TraceCheckUtils]: 55: Hoare triple {10075#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,939 INFO L280 TraceCheckUtils]: 56: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,940 INFO L280 TraceCheckUtils]: 57: Hoare triple {10075#(= 0 main_~i~0)} assume !(~i~0 == ~j~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,941 INFO L280 TraceCheckUtils]: 58: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,942 INFO L280 TraceCheckUtils]: 59: Hoare triple {10075#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,943 INFO L280 TraceCheckUtils]: 60: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,943 INFO L280 TraceCheckUtils]: 61: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,944 INFO L280 TraceCheckUtils]: 62: Hoare triple {10075#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,945 INFO L280 TraceCheckUtils]: 63: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,945 INFO L280 TraceCheckUtils]: 64: Hoare triple {10075#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,946 INFO L280 TraceCheckUtils]: 65: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,947 INFO L280 TraceCheckUtils]: 66: Hoare triple {10075#(= 0 main_~i~0)} assume !(~i~0 == ~j~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,947 INFO L280 TraceCheckUtils]: 67: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,948 INFO L280 TraceCheckUtils]: 68: Hoare triple {10075#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,949 INFO L280 TraceCheckUtils]: 69: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,949 INFO L280 TraceCheckUtils]: 70: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,950 INFO L280 TraceCheckUtils]: 71: Hoare triple {10075#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,951 INFO L280 TraceCheckUtils]: 72: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,951 INFO L280 TraceCheckUtils]: 73: Hoare triple {10075#(= 0 main_~i~0)} assume !!(~j~0 <= ~n~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,952 INFO L280 TraceCheckUtils]: 74: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,952 INFO L280 TraceCheckUtils]: 75: Hoare triple {10075#(= 0 main_~i~0)} assume !(~i~0 == ~j~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,953 INFO L280 TraceCheckUtils]: 76: Hoare triple {10075#(= 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 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,954 INFO L280 TraceCheckUtils]: 77: Hoare triple {10075#(= 0 main_~i~0)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,954 INFO L280 TraceCheckUtils]: 78: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,955 INFO L280 TraceCheckUtils]: 79: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,956 INFO L280 TraceCheckUtils]: 80: Hoare triple {10075#(= 0 main_~i~0)} ~j~0 := 1 + #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,956 INFO L280 TraceCheckUtils]: 81: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,957 INFO L280 TraceCheckUtils]: 82: Hoare triple {10075#(= 0 main_~i~0)} assume !(~j~0 <= ~n~0); {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,958 INFO L263 TraceCheckUtils]: 83: Hoare triple {10075#(= 0 main_~i~0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {10062#true} is VALID [2020-07-08 17:37:36,958 INFO L280 TraceCheckUtils]: 84: Hoare triple {10062#true} ~cond := #in~cond; {10062#true} is VALID [2020-07-08 17:37:36,958 INFO L280 TraceCheckUtils]: 85: Hoare triple {10062#true} assume !(0 == ~cond); {10062#true} is VALID [2020-07-08 17:37:36,959 INFO L280 TraceCheckUtils]: 86: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-08 17:37:36,960 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {10062#true} {10075#(= 0 main_~i~0)} #334#return; {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,961 INFO L280 TraceCheckUtils]: 88: Hoare triple {10075#(= 0 main_~i~0)} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {10075#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:36,962 INFO L280 TraceCheckUtils]: 89: Hoare triple {10075#(= 0 main_~i~0)} #t~post0 := ~i~0; {10080#(= |main_#t~post0| 0)} is VALID [2020-07-08 17:37:36,963 INFO L280 TraceCheckUtils]: 90: Hoare triple {10080#(= |main_#t~post0| 0)} ~i~0 := 1 + #t~post0; {10081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,964 INFO L280 TraceCheckUtils]: 91: Hoare triple {10081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} havoc #t~post0; {10081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,966 INFO L280 TraceCheckUtils]: 92: Hoare triple {10081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 <= ~n~0); {10081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,967 INFO L280 TraceCheckUtils]: 93: Hoare triple {10081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} ~w~0 := 0.0; {10081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,968 INFO L280 TraceCheckUtils]: 94: Hoare triple {10081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} ~j~0 := 0; {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,969 INFO L280 TraceCheckUtils]: 95: Hoare triple {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~j~0 <= ~n~0); {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,970 INFO L280 TraceCheckUtils]: 96: Hoare triple {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 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 {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,971 INFO L280 TraceCheckUtils]: 97: Hoare triple {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(~i~0 == ~j~0); {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,971 INFO L280 TraceCheckUtils]: 98: Hoare triple {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 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 {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,972 INFO L280 TraceCheckUtils]: 99: Hoare triple {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,973 INFO L280 TraceCheckUtils]: 100: Hoare triple {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} havoc #t~mem3; {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,975 INFO L280 TraceCheckUtils]: 101: Hoare triple {10082#(and (= 0 main_~j~0) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post1 := ~j~0; {10083#(and (= |main_#t~post1| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 17:37:36,976 INFO L280 TraceCheckUtils]: 102: Hoare triple {10083#(and (= |main_#t~post1| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} ~j~0 := 1 + #t~post1; {10084#(and (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0))} is VALID [2020-07-08 17:37:36,978 INFO L280 TraceCheckUtils]: 103: Hoare triple {10084#(and (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0))} havoc #t~post1; {10084#(and (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0))} is VALID [2020-07-08 17:37:36,979 INFO L280 TraceCheckUtils]: 104: Hoare triple {10084#(and (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0))} assume !!(~j~0 <= ~n~0); {10084#(and (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0))} is VALID [2020-07-08 17:37:36,980 INFO L280 TraceCheckUtils]: 105: Hoare triple {10084#(and (<= main_~j~0 main_~i~0) (<= main_~i~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 {10084#(and (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0))} is VALID [2020-07-08 17:37:36,981 INFO L280 TraceCheckUtils]: 106: Hoare triple {10084#(and (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0))} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:36,981 INFO L280 TraceCheckUtils]: 107: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:36,982 INFO L280 TraceCheckUtils]: 108: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:36,982 INFO L280 TraceCheckUtils]: 109: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:36,982 INFO L280 TraceCheckUtils]: 110: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:36,982 INFO L280 TraceCheckUtils]: 111: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,982 INFO L280 TraceCheckUtils]: 112: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,983 INFO L280 TraceCheckUtils]: 113: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:36,983 INFO L280 TraceCheckUtils]: 114: Hoare triple {10063#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 {10063#false} is VALID [2020-07-08 17:37:36,983 INFO L280 TraceCheckUtils]: 115: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:36,983 INFO L280 TraceCheckUtils]: 116: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:36,983 INFO L280 TraceCheckUtils]: 117: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:36,984 INFO L280 TraceCheckUtils]: 118: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:36,984 INFO L280 TraceCheckUtils]: 119: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:36,984 INFO L280 TraceCheckUtils]: 120: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,984 INFO L280 TraceCheckUtils]: 121: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,984 INFO L280 TraceCheckUtils]: 122: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:36,984 INFO L280 TraceCheckUtils]: 123: Hoare triple {10063#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 {10063#false} is VALID [2020-07-08 17:37:36,985 INFO L280 TraceCheckUtils]: 124: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:36,985 INFO L280 TraceCheckUtils]: 125: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:36,985 INFO L280 TraceCheckUtils]: 126: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:36,985 INFO L280 TraceCheckUtils]: 127: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:36,985 INFO L280 TraceCheckUtils]: 128: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:36,986 INFO L280 TraceCheckUtils]: 129: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,986 INFO L280 TraceCheckUtils]: 130: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,986 INFO L280 TraceCheckUtils]: 131: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:36,986 INFO L280 TraceCheckUtils]: 132: Hoare triple {10063#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 {10063#false} is VALID [2020-07-08 17:37:36,986 INFO L280 TraceCheckUtils]: 133: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:36,987 INFO L280 TraceCheckUtils]: 134: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:36,987 INFO L280 TraceCheckUtils]: 135: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:36,987 INFO L280 TraceCheckUtils]: 136: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:36,987 INFO L280 TraceCheckUtils]: 137: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:36,987 INFO L280 TraceCheckUtils]: 138: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,988 INFO L280 TraceCheckUtils]: 139: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,988 INFO L280 TraceCheckUtils]: 140: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:36,988 INFO L280 TraceCheckUtils]: 141: Hoare triple {10063#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 {10063#false} is VALID [2020-07-08 17:37:36,988 INFO L280 TraceCheckUtils]: 142: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:36,988 INFO L280 TraceCheckUtils]: 143: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:36,989 INFO L280 TraceCheckUtils]: 144: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:36,989 INFO L280 TraceCheckUtils]: 145: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:36,989 INFO L280 TraceCheckUtils]: 146: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:36,989 INFO L280 TraceCheckUtils]: 147: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,989 INFO L280 TraceCheckUtils]: 148: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,990 INFO L280 TraceCheckUtils]: 149: Hoare triple {10063#false} assume !(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:36,990 INFO L263 TraceCheckUtils]: 150: Hoare triple {10063#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {10062#true} is VALID [2020-07-08 17:37:36,990 INFO L280 TraceCheckUtils]: 151: Hoare triple {10062#true} ~cond := #in~cond; {10062#true} is VALID [2020-07-08 17:37:36,990 INFO L280 TraceCheckUtils]: 152: Hoare triple {10062#true} assume !(0 == ~cond); {10062#true} is VALID [2020-07-08 17:37:36,990 INFO L280 TraceCheckUtils]: 153: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-08 17:37:36,991 INFO L275 TraceCheckUtils]: 154: Hoare quadruple {10062#true} {10063#false} #334#return; {10063#false} is VALID [2020-07-08 17:37:36,991 INFO L280 TraceCheckUtils]: 155: Hoare triple {10063#false} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {10063#false} is VALID [2020-07-08 17:37:36,991 INFO L280 TraceCheckUtils]: 156: Hoare triple {10063#false} #t~post0 := ~i~0; {10063#false} is VALID [2020-07-08 17:37:36,991 INFO L280 TraceCheckUtils]: 157: Hoare triple {10063#false} ~i~0 := 1 + #t~post0; {10063#false} is VALID [2020-07-08 17:37:36,991 INFO L280 TraceCheckUtils]: 158: Hoare triple {10063#false} havoc #t~post0; {10063#false} is VALID [2020-07-08 17:37:36,992 INFO L280 TraceCheckUtils]: 159: Hoare triple {10063#false} assume !!(~i~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:36,992 INFO L280 TraceCheckUtils]: 160: Hoare triple {10063#false} ~w~0 := 0.0; {10063#false} is VALID [2020-07-08 17:37:36,992 INFO L280 TraceCheckUtils]: 161: Hoare triple {10063#false} ~j~0 := 0; {10063#false} is VALID [2020-07-08 17:37:36,992 INFO L280 TraceCheckUtils]: 162: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:36,992 INFO L280 TraceCheckUtils]: 163: Hoare triple {10063#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 {10063#false} is VALID [2020-07-08 17:37:36,993 INFO L280 TraceCheckUtils]: 164: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:36,993 INFO L280 TraceCheckUtils]: 165: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:36,993 INFO L280 TraceCheckUtils]: 166: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:36,993 INFO L280 TraceCheckUtils]: 167: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:36,993 INFO L280 TraceCheckUtils]: 168: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:36,994 INFO L280 TraceCheckUtils]: 169: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,994 INFO L280 TraceCheckUtils]: 170: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,994 INFO L280 TraceCheckUtils]: 171: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:36,994 INFO L280 TraceCheckUtils]: 172: Hoare triple {10063#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 {10063#false} is VALID [2020-07-08 17:37:36,995 INFO L280 TraceCheckUtils]: 173: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:36,995 INFO L280 TraceCheckUtils]: 174: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:36,995 INFO L280 TraceCheckUtils]: 175: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:36,995 INFO L280 TraceCheckUtils]: 176: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:36,995 INFO L280 TraceCheckUtils]: 177: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:36,996 INFO L280 TraceCheckUtils]: 178: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,996 INFO L280 TraceCheckUtils]: 179: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,996 INFO L280 TraceCheckUtils]: 180: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:36,996 INFO L280 TraceCheckUtils]: 181: Hoare triple {10063#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 {10063#false} is VALID [2020-07-08 17:37:36,996 INFO L280 TraceCheckUtils]: 182: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:36,997 INFO L280 TraceCheckUtils]: 183: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:36,997 INFO L280 TraceCheckUtils]: 184: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:36,997 INFO L280 TraceCheckUtils]: 185: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:36,997 INFO L280 TraceCheckUtils]: 186: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:36,997 INFO L280 TraceCheckUtils]: 187: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,998 INFO L280 TraceCheckUtils]: 188: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,998 INFO L280 TraceCheckUtils]: 189: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:36,998 INFO L280 TraceCheckUtils]: 190: Hoare triple {10063#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 {10063#false} is VALID [2020-07-08 17:37:36,998 INFO L280 TraceCheckUtils]: 191: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:36,998 INFO L280 TraceCheckUtils]: 192: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:36,999 INFO L280 TraceCheckUtils]: 193: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:36,999 INFO L280 TraceCheckUtils]: 194: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:36,999 INFO L280 TraceCheckUtils]: 195: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:36,999 INFO L280 TraceCheckUtils]: 196: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:36,999 INFO L280 TraceCheckUtils]: 197: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:37,000 INFO L280 TraceCheckUtils]: 198: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:37,000 INFO L280 TraceCheckUtils]: 199: Hoare triple {10063#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 {10063#false} is VALID [2020-07-08 17:37:37,000 INFO L280 TraceCheckUtils]: 200: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:37,000 INFO L280 TraceCheckUtils]: 201: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:37,001 INFO L280 TraceCheckUtils]: 202: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:37,001 INFO L280 TraceCheckUtils]: 203: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:37,001 INFO L280 TraceCheckUtils]: 204: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:37,001 INFO L280 TraceCheckUtils]: 205: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:37,001 INFO L280 TraceCheckUtils]: 206: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:37,002 INFO L280 TraceCheckUtils]: 207: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:37,002 INFO L280 TraceCheckUtils]: 208: Hoare triple {10063#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 {10063#false} is VALID [2020-07-08 17:37:37,002 INFO L280 TraceCheckUtils]: 209: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-08 17:37:37,003 INFO L280 TraceCheckUtils]: 210: Hoare triple {10063#false} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {10063#false} is VALID [2020-07-08 17:37:37,003 INFO L280 TraceCheckUtils]: 211: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-08 17:37:37,003 INFO L280 TraceCheckUtils]: 212: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-08 17:37:37,003 INFO L280 TraceCheckUtils]: 213: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-08 17:37:37,004 INFO L280 TraceCheckUtils]: 214: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-08 17:37:37,004 INFO L280 TraceCheckUtils]: 215: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-08 17:37:37,004 INFO L280 TraceCheckUtils]: 216: Hoare triple {10063#false} assume !(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-08 17:37:37,004 INFO L263 TraceCheckUtils]: 217: Hoare triple {10063#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {10063#false} is VALID [2020-07-08 17:37:37,005 INFO L280 TraceCheckUtils]: 218: Hoare triple {10063#false} ~cond := #in~cond; {10063#false} is VALID [2020-07-08 17:37:37,005 INFO L280 TraceCheckUtils]: 219: Hoare triple {10063#false} assume 0 == ~cond; {10063#false} is VALID [2020-07-08 17:37:37,005 INFO L280 TraceCheckUtils]: 220: Hoare triple {10063#false} assume !false; {10063#false} is VALID [2020-07-08 17:37:37,061 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-08 17:37:37,061 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:37,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [779636335] [2020-07-08 17:37:37,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:37,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:37:37,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641062604] [2020-07-08 17:37:37,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 221 [2020-07-08 17:37:37,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:37,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:37:37,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:37,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:37:37,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:37,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:37:37,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:37:37,170 INFO L87 Difference]: Start difference. First operand 275 states and 295 transitions. Second operand 9 states. [2020-07-08 17:37:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:39,790 INFO L93 Difference]: Finished difference Result 512 states and 545 transitions. [2020-07-08 17:37:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 17:37:39,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 221 [2020-07-08 17:37:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:37:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2020-07-08 17:37:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:37:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2020-07-08 17:37:39,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2020-07-08 17:37:40,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:40,043 INFO L225 Difference]: With dead ends: 512 [2020-07-08 17:37:40,044 INFO L226 Difference]: Without dead ends: 350 [2020-07-08 17:37:40,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-08 17:37:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-07-08 17:37:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 272. [2020-07-08 17:37:41,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:41,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand 272 states. [2020-07-08 17:37:41,164 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand 272 states. [2020-07-08 17:37:41,164 INFO L87 Difference]: Start difference. First operand 350 states. Second operand 272 states. [2020-07-08 17:37:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:41,176 INFO L93 Difference]: Finished difference Result 350 states and 368 transitions. [2020-07-08 17:37:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 368 transitions. [2020-07-08 17:37:41,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:41,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:41,178 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand 350 states. [2020-07-08 17:37:41,178 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 350 states. [2020-07-08 17:37:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:41,189 INFO L93 Difference]: Finished difference Result 350 states and 368 transitions. [2020-07-08 17:37:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 368 transitions. [2020-07-08 17:37:41,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:41,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:41,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:41,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-07-08 17:37:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 290 transitions. [2020-07-08 17:37:41,201 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 290 transitions. Word has length 221 [2020-07-08 17:37:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:41,201 INFO L479 AbstractCegarLoop]: Abstraction has 272 states and 290 transitions. [2020-07-08 17:37:41,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:37:41,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 272 states and 290 transitions. [2020-07-08 17:37:41,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 290 transitions. [2020-07-08 17:37:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-07-08 17:37:41,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:41,877 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 16, 3, 3, 3, 3, 3, 3, 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] [2020-07-08 17:37:41,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 17:37:41,880 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash -368860214, now seen corresponding path program 8 times [2020-07-08 17:37:41,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:41,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1124162188] [2020-07-08 17:37:41,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:42,171 INFO L280 TraceCheckUtils]: 0: Hoare triple {12401#(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; {12376#true} is VALID [2020-07-08 17:37:42,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {12376#true} #valid := #valid[0 := 0]; {12376#true} is VALID [2020-07-08 17:37:42,171 INFO L280 TraceCheckUtils]: 2: Hoare triple {12376#true} assume 0 < #StackHeapBarrier; {12376#true} is VALID [2020-07-08 17:37:42,172 INFO L280 TraceCheckUtils]: 3: Hoare triple {12376#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {12376#true} is VALID [2020-07-08 17:37:42,172 INFO L280 TraceCheckUtils]: 4: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {12376#true} is VALID [2020-07-08 17:37:42,172 INFO L280 TraceCheckUtils]: 5: Hoare triple {12376#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {12376#true} is VALID [2020-07-08 17:37:42,172 INFO L280 TraceCheckUtils]: 6: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {12376#true} is VALID [2020-07-08 17:37:42,173 INFO L280 TraceCheckUtils]: 7: Hoare triple {12376#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {12376#true} is VALID [2020-07-08 17:37:42,173 INFO L280 TraceCheckUtils]: 8: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {12376#true} is VALID [2020-07-08 17:37:42,175 INFO L280 TraceCheckUtils]: 9: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-08 17:37:42,175 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {12376#true} {12376#true} #330#return; {12376#true} is VALID [2020-07-08 17:37:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:42,183 INFO L280 TraceCheckUtils]: 0: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2020-07-08 17:37:42,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2020-07-08 17:37:42,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-08 17:37:42,192 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12376#true} {12389#(<= main_~n~0 5)} #334#return; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:42,201 INFO L280 TraceCheckUtils]: 0: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2020-07-08 17:37:42,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2020-07-08 17:37:42,202 INFO L280 TraceCheckUtils]: 2: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-08 17:37:42,203 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12376#true} {12389#(<= main_~n~0 5)} #334#return; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,205 INFO L263 TraceCheckUtils]: 0: Hoare triple {12376#true} call ULTIMATE.init(); {12401#(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-08 17:37:42,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {12401#(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; {12376#true} is VALID [2020-07-08 17:37:42,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {12376#true} #valid := #valid[0 := 0]; {12376#true} is VALID [2020-07-08 17:37:42,206 INFO L280 TraceCheckUtils]: 3: Hoare triple {12376#true} assume 0 < #StackHeapBarrier; {12376#true} is VALID [2020-07-08 17:37:42,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {12376#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000); srcloc: L69 {12376#true} is VALID [2020-07-08 17:37:42,207 INFO L280 TraceCheckUtils]: 5: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {12376#true} is VALID [2020-07-08 17:37:42,208 INFO L280 TraceCheckUtils]: 6: Hoare triple {12376#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-2 {12376#true} is VALID [2020-07-08 17:37:42,208 INFO L280 TraceCheckUtils]: 7: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {12376#true} is VALID [2020-07-08 17:37:42,208 INFO L280 TraceCheckUtils]: 8: Hoare triple {12376#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400); srcloc: L69-4 {12376#true} is VALID [2020-07-08 17:37:42,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {12376#true} is VALID [2020-07-08 17:37:42,209 INFO L280 TraceCheckUtils]: 10: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-08 17:37:42,209 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {12376#true} {12376#true} #330#return; {12376#true} is VALID [2020-07-08 17:37:42,210 INFO L263 TraceCheckUtils]: 12: Hoare triple {12376#true} call #t~ret33 := main(); {12376#true} is VALID [2020-07-08 17:37:42,210 INFO L280 TraceCheckUtils]: 13: Hoare triple {12376#true} havoc ~i~0; {12376#true} is VALID [2020-07-08 17:37:42,211 INFO L280 TraceCheckUtils]: 14: Hoare triple {12376#true} havoc ~j~0; {12376#true} is VALID [2020-07-08 17:37:42,211 INFO L280 TraceCheckUtils]: 15: Hoare triple {12376#true} ~nmax~0 := 50; {12376#true} is VALID [2020-07-08 17:37:42,213 INFO L280 TraceCheckUtils]: 16: Hoare triple {12376#true} ~n~0 := 5; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,214 INFO L280 TraceCheckUtils]: 17: Hoare triple {12389#(<= main_~n~0 5)} havoc ~chkerr~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,215 INFO L280 TraceCheckUtils]: 18: Hoare triple {12389#(<= main_~n~0 5)} havoc ~eps~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,216 INFO L280 TraceCheckUtils]: 19: Hoare triple {12389#(<= main_~n~0 5)} havoc ~w~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,217 INFO L280 TraceCheckUtils]: 20: Hoare triple {12389#(<= main_~n~0 5)} ~eps~0 := 1.0E-6; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,218 INFO L280 TraceCheckUtils]: 21: Hoare triple {12389#(<= main_~n~0 5)} ~i~0 := 0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,219 INFO L280 TraceCheckUtils]: 22: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~i~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,219 INFO L280 TraceCheckUtils]: 23: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := 0.0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,220 INFO L280 TraceCheckUtils]: 24: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,221 INFO L280 TraceCheckUtils]: 25: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,222 INFO L280 TraceCheckUtils]: 26: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,223 INFO L280 TraceCheckUtils]: 27: Hoare triple {12389#(<= main_~n~0 5)} assume ~i~0 == ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,224 INFO L280 TraceCheckUtils]: 28: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,224 INFO L280 TraceCheckUtils]: 29: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,225 INFO L280 TraceCheckUtils]: 30: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem2; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,227 INFO L280 TraceCheckUtils]: 31: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,228 INFO L280 TraceCheckUtils]: 32: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,229 INFO L280 TraceCheckUtils]: 33: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,230 INFO L280 TraceCheckUtils]: 34: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,231 INFO L280 TraceCheckUtils]: 35: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,233 INFO L280 TraceCheckUtils]: 36: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,233 INFO L280 TraceCheckUtils]: 37: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,234 INFO L280 TraceCheckUtils]: 38: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,235 INFO L280 TraceCheckUtils]: 39: Hoare triple {12389#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,236 INFO L280 TraceCheckUtils]: 40: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,237 INFO L280 TraceCheckUtils]: 41: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,238 INFO L280 TraceCheckUtils]: 42: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,239 INFO L280 TraceCheckUtils]: 43: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,240 INFO L280 TraceCheckUtils]: 44: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,242 INFO L280 TraceCheckUtils]: 45: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,243 INFO L280 TraceCheckUtils]: 46: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,244 INFO L280 TraceCheckUtils]: 47: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,245 INFO L280 TraceCheckUtils]: 48: Hoare triple {12389#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,246 INFO L280 TraceCheckUtils]: 49: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,247 INFO L280 TraceCheckUtils]: 50: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,248 INFO L280 TraceCheckUtils]: 51: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,249 INFO L280 TraceCheckUtils]: 52: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,249 INFO L280 TraceCheckUtils]: 53: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,251 INFO L280 TraceCheckUtils]: 54: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,252 INFO L280 TraceCheckUtils]: 55: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,253 INFO L280 TraceCheckUtils]: 56: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,254 INFO L280 TraceCheckUtils]: 57: Hoare triple {12389#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,255 INFO L280 TraceCheckUtils]: 58: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,257 INFO L280 TraceCheckUtils]: 59: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,259 INFO L280 TraceCheckUtils]: 60: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,260 INFO L280 TraceCheckUtils]: 61: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,260 INFO L280 TraceCheckUtils]: 62: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,261 INFO L280 TraceCheckUtils]: 63: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,262 INFO L280 TraceCheckUtils]: 64: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,263 INFO L280 TraceCheckUtils]: 65: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,264 INFO L280 TraceCheckUtils]: 66: Hoare triple {12389#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,265 INFO L280 TraceCheckUtils]: 67: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,267 INFO L280 TraceCheckUtils]: 68: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,268 INFO L280 TraceCheckUtils]: 69: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,269 INFO L280 TraceCheckUtils]: 70: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,270 INFO L280 TraceCheckUtils]: 71: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,271 INFO L280 TraceCheckUtils]: 72: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,272 INFO L280 TraceCheckUtils]: 73: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,273 INFO L280 TraceCheckUtils]: 74: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,274 INFO L280 TraceCheckUtils]: 75: Hoare triple {12389#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,274 INFO L280 TraceCheckUtils]: 76: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,275 INFO L280 TraceCheckUtils]: 77: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,275 INFO L280 TraceCheckUtils]: 78: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,276 INFO L280 TraceCheckUtils]: 79: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,277 INFO L280 TraceCheckUtils]: 80: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,277 INFO L280 TraceCheckUtils]: 81: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,278 INFO L280 TraceCheckUtils]: 82: Hoare triple {12389#(<= main_~n~0 5)} assume !(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,278 INFO L263 TraceCheckUtils]: 83: Hoare triple {12389#(<= main_~n~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {12376#true} is VALID [2020-07-08 17:37:42,278 INFO L280 TraceCheckUtils]: 84: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2020-07-08 17:37:42,278 INFO L280 TraceCheckUtils]: 85: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2020-07-08 17:37:42,279 INFO L280 TraceCheckUtils]: 86: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-08 17:37:42,280 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {12376#true} {12389#(<= main_~n~0 5)} #334#return; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,280 INFO L280 TraceCheckUtils]: 88: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,281 INFO L280 TraceCheckUtils]: 89: Hoare triple {12389#(<= main_~n~0 5)} #t~post0 := ~i~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,282 INFO L280 TraceCheckUtils]: 90: Hoare triple {12389#(<= main_~n~0 5)} ~i~0 := 1 + #t~post0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,283 INFO L280 TraceCheckUtils]: 91: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,284 INFO L280 TraceCheckUtils]: 92: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~i~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,285 INFO L280 TraceCheckUtils]: 93: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := 0.0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,286 INFO L280 TraceCheckUtils]: 94: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,287 INFO L280 TraceCheckUtils]: 95: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,288 INFO L280 TraceCheckUtils]: 96: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,288 INFO L280 TraceCheckUtils]: 97: Hoare triple {12389#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,289 INFO L280 TraceCheckUtils]: 98: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,291 INFO L280 TraceCheckUtils]: 99: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,291 INFO L280 TraceCheckUtils]: 100: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,292 INFO L280 TraceCheckUtils]: 101: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,292 INFO L280 TraceCheckUtils]: 102: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,293 INFO L280 TraceCheckUtils]: 103: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,293 INFO L280 TraceCheckUtils]: 104: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,294 INFO L280 TraceCheckUtils]: 105: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,295 INFO L280 TraceCheckUtils]: 106: Hoare triple {12389#(<= main_~n~0 5)} assume ~i~0 == ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,296 INFO L280 TraceCheckUtils]: 107: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,298 INFO L280 TraceCheckUtils]: 108: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,299 INFO L280 TraceCheckUtils]: 109: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem2; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,300 INFO L280 TraceCheckUtils]: 110: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,301 INFO L280 TraceCheckUtils]: 111: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,302 INFO L280 TraceCheckUtils]: 112: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,303 INFO L280 TraceCheckUtils]: 113: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,304 INFO L280 TraceCheckUtils]: 114: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,305 INFO L280 TraceCheckUtils]: 115: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,306 INFO L280 TraceCheckUtils]: 116: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,307 INFO L280 TraceCheckUtils]: 117: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,308 INFO L280 TraceCheckUtils]: 118: Hoare triple {12389#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,309 INFO L280 TraceCheckUtils]: 119: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,310 INFO L280 TraceCheckUtils]: 120: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,311 INFO L280 TraceCheckUtils]: 121: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,313 INFO L280 TraceCheckUtils]: 122: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,315 INFO L280 TraceCheckUtils]: 123: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,316 INFO L280 TraceCheckUtils]: 124: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,317 INFO L280 TraceCheckUtils]: 125: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,318 INFO L280 TraceCheckUtils]: 126: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,318 INFO L280 TraceCheckUtils]: 127: Hoare triple {12389#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,319 INFO L280 TraceCheckUtils]: 128: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,320 INFO L280 TraceCheckUtils]: 129: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,321 INFO L280 TraceCheckUtils]: 130: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,322 INFO L280 TraceCheckUtils]: 131: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,323 INFO L280 TraceCheckUtils]: 132: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,325 INFO L280 TraceCheckUtils]: 133: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,326 INFO L280 TraceCheckUtils]: 134: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,327 INFO L280 TraceCheckUtils]: 135: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,328 INFO L280 TraceCheckUtils]: 136: Hoare triple {12389#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,330 INFO L280 TraceCheckUtils]: 137: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,330 INFO L280 TraceCheckUtils]: 138: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,331 INFO L280 TraceCheckUtils]: 139: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,332 INFO L280 TraceCheckUtils]: 140: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,333 INFO L280 TraceCheckUtils]: 141: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,334 INFO L280 TraceCheckUtils]: 142: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,335 INFO L280 TraceCheckUtils]: 143: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,336 INFO L280 TraceCheckUtils]: 144: Hoare triple {12389#(<= main_~n~0 5)} 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 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,337 INFO L280 TraceCheckUtils]: 145: Hoare triple {12389#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,339 INFO L280 TraceCheckUtils]: 146: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,341 INFO L280 TraceCheckUtils]: 147: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,341 INFO L280 TraceCheckUtils]: 148: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,342 INFO L280 TraceCheckUtils]: 149: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,343 INFO L280 TraceCheckUtils]: 150: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 1 + #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,343 INFO L280 TraceCheckUtils]: 151: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,344 INFO L280 TraceCheckUtils]: 152: Hoare triple {12389#(<= main_~n~0 5)} assume !(~j~0 <= ~n~0); {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,344 INFO L263 TraceCheckUtils]: 153: Hoare triple {12389#(<= main_~n~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {12376#true} is VALID [2020-07-08 17:37:42,344 INFO L280 TraceCheckUtils]: 154: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2020-07-08 17:37:42,345 INFO L280 TraceCheckUtils]: 155: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2020-07-08 17:37:42,345 INFO L280 TraceCheckUtils]: 156: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-08 17:37:42,346 INFO L275 TraceCheckUtils]: 157: Hoare quadruple {12376#true} {12389#(<= main_~n~0 5)} #334#return; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,348 INFO L280 TraceCheckUtils]: 158: Hoare triple {12389#(<= main_~n~0 5)} SUMMARY for call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); srcloc: L100 {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,352 INFO L280 TraceCheckUtils]: 159: Hoare triple {12389#(<= main_~n~0 5)} #t~post0 := ~i~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,353 INFO L280 TraceCheckUtils]: 160: Hoare triple {12389#(<= main_~n~0 5)} ~i~0 := 1 + #t~post0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,354 INFO L280 TraceCheckUtils]: 161: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post0; {12389#(<= main_~n~0 5)} is VALID [2020-07-08 17:37:42,356 INFO L280 TraceCheckUtils]: 162: Hoare triple {12389#(<= main_~n~0 5)} assume !!(~i~0 <= ~n~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,357 INFO L280 TraceCheckUtils]: 163: Hoare triple {12398#(<= main_~i~0 5)} ~w~0 := 0.0; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,358 INFO L280 TraceCheckUtils]: 164: Hoare triple {12398#(<= main_~i~0 5)} ~j~0 := 0; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,359 INFO L280 TraceCheckUtils]: 165: Hoare triple {12398#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,360 INFO L280 TraceCheckUtils]: 166: Hoare triple {12398#(<= main_~i~0 5)} 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 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,361 INFO L280 TraceCheckUtils]: 167: Hoare triple {12398#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,362 INFO L280 TraceCheckUtils]: 168: Hoare triple {12398#(<= main_~i~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,364 INFO L280 TraceCheckUtils]: 169: Hoare triple {12398#(<= main_~i~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,365 INFO L280 TraceCheckUtils]: 170: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,366 INFO L280 TraceCheckUtils]: 171: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,367 INFO L280 TraceCheckUtils]: 172: Hoare triple {12398#(<= main_~i~0 5)} ~j~0 := 1 + #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,368 INFO L280 TraceCheckUtils]: 173: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,369 INFO L280 TraceCheckUtils]: 174: Hoare triple {12398#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,371 INFO L280 TraceCheckUtils]: 175: Hoare triple {12398#(<= main_~i~0 5)} 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 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,396 INFO L280 TraceCheckUtils]: 176: Hoare triple {12398#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,397 INFO L280 TraceCheckUtils]: 177: Hoare triple {12398#(<= main_~i~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,398 INFO L280 TraceCheckUtils]: 178: Hoare triple {12398#(<= main_~i~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,399 INFO L280 TraceCheckUtils]: 179: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,400 INFO L280 TraceCheckUtils]: 180: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,401 INFO L280 TraceCheckUtils]: 181: Hoare triple {12398#(<= main_~i~0 5)} ~j~0 := 1 + #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,402 INFO L280 TraceCheckUtils]: 182: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,403 INFO L280 TraceCheckUtils]: 183: Hoare triple {12398#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,404 INFO L280 TraceCheckUtils]: 184: Hoare triple {12398#(<= main_~i~0 5)} 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 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,406 INFO L280 TraceCheckUtils]: 185: Hoare triple {12398#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,407 INFO L280 TraceCheckUtils]: 186: Hoare triple {12398#(<= main_~i~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,408 INFO L280 TraceCheckUtils]: 187: Hoare triple {12398#(<= main_~i~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,409 INFO L280 TraceCheckUtils]: 188: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,410 INFO L280 TraceCheckUtils]: 189: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,410 INFO L280 TraceCheckUtils]: 190: Hoare triple {12398#(<= main_~i~0 5)} ~j~0 := 1 + #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,411 INFO L280 TraceCheckUtils]: 191: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,412 INFO L280 TraceCheckUtils]: 192: Hoare triple {12398#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,414 INFO L280 TraceCheckUtils]: 193: Hoare triple {12398#(<= main_~i~0 5)} 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 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,415 INFO L280 TraceCheckUtils]: 194: Hoare triple {12398#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,416 INFO L280 TraceCheckUtils]: 195: Hoare triple {12398#(<= main_~i~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,417 INFO L280 TraceCheckUtils]: 196: Hoare triple {12398#(<= main_~i~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,418 INFO L280 TraceCheckUtils]: 197: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,419 INFO L280 TraceCheckUtils]: 198: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,420 INFO L280 TraceCheckUtils]: 199: Hoare triple {12398#(<= main_~i~0 5)} ~j~0 := 1 + #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,421 INFO L280 TraceCheckUtils]: 200: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,422 INFO L280 TraceCheckUtils]: 201: Hoare triple {12398#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,423 INFO L280 TraceCheckUtils]: 202: Hoare triple {12398#(<= main_~i~0 5)} 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 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,424 INFO L280 TraceCheckUtils]: 203: Hoare triple {12398#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,424 INFO L280 TraceCheckUtils]: 204: Hoare triple {12398#(<= main_~i~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,426 INFO L280 TraceCheckUtils]: 205: Hoare triple {12398#(<= main_~i~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,427 INFO L280 TraceCheckUtils]: 206: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,428 INFO L280 TraceCheckUtils]: 207: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,429 INFO L280 TraceCheckUtils]: 208: Hoare triple {12398#(<= main_~i~0 5)} ~j~0 := 1 + #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,430 INFO L280 TraceCheckUtils]: 209: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,432 INFO L280 TraceCheckUtils]: 210: Hoare triple {12398#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,433 INFO L280 TraceCheckUtils]: 211: Hoare triple {12398#(<= main_~i~0 5)} 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 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,434 INFO L280 TraceCheckUtils]: 212: Hoare triple {12398#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,435 INFO L280 TraceCheckUtils]: 213: Hoare triple {12398#(<= main_~i~0 5)} SUMMARY for call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); srcloc: L97-4 {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,435 INFO L280 TraceCheckUtils]: 214: Hoare triple {12398#(<= main_~i~0 5)} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,436 INFO L280 TraceCheckUtils]: 215: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,437 INFO L280 TraceCheckUtils]: 216: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,438 INFO L280 TraceCheckUtils]: 217: Hoare triple {12398#(<= main_~i~0 5)} ~j~0 := 1 + #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,439 INFO L280 TraceCheckUtils]: 218: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,441 INFO L280 TraceCheckUtils]: 219: Hoare triple {12398#(<= main_~i~0 5)} assume !(~j~0 <= ~n~0); {12398#(<= main_~i~0 5)} is VALID [2020-07-08 17:37:42,443 INFO L263 TraceCheckUtils]: 220: Hoare triple {12398#(<= main_~i~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {12399#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:37:42,444 INFO L280 TraceCheckUtils]: 221: Hoare triple {12399#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {12400#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:37:42,445 INFO L280 TraceCheckUtils]: 222: Hoare triple {12400#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {12377#false} is VALID [2020-07-08 17:37:42,446 INFO L280 TraceCheckUtils]: 223: Hoare triple {12377#false} assume !false; {12377#false} is VALID [2020-07-08 17:37:42,526 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-08 17:37:42,526 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:42,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1124162188] [2020-07-08 17:37:42,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:42,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 17:37:42,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927246725] [2020-07-08 17:37:42,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2020-07-08 17:37:42,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:42,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 17:37:42,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:42,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 17:37:42,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:42,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 17:37:42,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:37:42,632 INFO L87 Difference]: Start difference. First operand 272 states and 290 transitions. Second operand 7 states. [2020-07-08 17:37:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:44,496 INFO L93 Difference]: Finished difference Result 272 states and 290 transitions. [2020-07-08 17:37:44,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 17:37:44,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2020-07-08 17:37:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:37:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-08 17:37:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:37:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-08 17:37:44,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2020-07-08 17:37:44,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:44,621 INFO L225 Difference]: With dead ends: 272 [2020-07-08 17:37:44,621 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 17:37:44,622 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:37:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 17:37:44,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 17:37:44,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:44,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 17:37:44,623 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 17:37:44,624 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 17:37:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:44,624 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 17:37:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:37:44,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:44,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:44,625 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 17:37:44,625 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 17:37:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:44,625 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 17:37:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:37:44,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:44,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:44,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:44,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 17:37:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 17:37:44,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2020-07-08 17:37:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:44,627 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 17:37:44,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 17:37:44,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 17:37:44,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:37:44,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:44,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 17:37:44,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 17:37:45,494 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 35 [2020-07-08 17:37:47,518 INFO L271 CegarLoopResult]: At program point L118(line 118) the Hoare annotation is: true [2020-07-08 17:37:47,518 INFO L271 CegarLoopResult]: At program point L118-1(line 118) the Hoare annotation is: true [2020-07-08 17:37:47,518 INFO L271 CegarLoopResult]: At program point L118-2(line 118) the Hoare annotation is: true [2020-07-08 17:37:47,518 INFO L271 CegarLoopResult]: At program point L118-3(line 118) the Hoare annotation is: true [2020-07-08 17:37:47,518 INFO L271 CegarLoopResult]: At program point L118-4(line 118) the Hoare annotation is: true [2020-07-08 17:37:47,519 INFO L271 CegarLoopResult]: At program point L118-5(line 118) the Hoare annotation is: true [2020-07-08 17:37:47,519 INFO L271 CegarLoopResult]: At program point L118-6(line 118) the Hoare annotation is: true [2020-07-08 17:37:47,519 INFO L271 CegarLoopResult]: At program point L118-7(line 118) the Hoare annotation is: true [2020-07-08 17:37:47,519 INFO L271 CegarLoopResult]: At program point L135(line 135) the Hoare annotation is: true [2020-07-08 17:37:47,519 INFO L271 CegarLoopResult]: At program point L135-1(line 135) the Hoare annotation is: true [2020-07-08 17:37:47,519 INFO L271 CegarLoopResult]: At program point L119(line 119) the Hoare annotation is: true [2020-07-08 17:37:47,519 INFO L271 CegarLoopResult]: At program point L119-3(lines 119 126) the Hoare annotation is: true [2020-07-08 17:37:47,519 INFO L271 CegarLoopResult]: At program point L119-4(line 119) the Hoare annotation is: true [2020-07-08 17:37:47,519 INFO L271 CegarLoopResult]: At program point L119-5(line 119) the Hoare annotation is: true [2020-07-08 17:37:47,520 INFO L271 CegarLoopResult]: At program point L119-6(lines 119 126) the Hoare annotation is: true [2020-07-08 17:37:47,520 INFO L271 CegarLoopResult]: At program point L119-7(lines 119 126) the Hoare annotation is: true [2020-07-08 17:37:47,520 INFO L271 CegarLoopResult]: At program point L136(line 136) the Hoare annotation is: true [2020-07-08 17:37:47,520 INFO L271 CegarLoopResult]: At program point L136-3(line 136) the Hoare annotation is: true [2020-07-08 17:37:47,520 INFO L271 CegarLoopResult]: At program point L136-4(line 136) the Hoare annotation is: true [2020-07-08 17:37:47,522 INFO L271 CegarLoopResult]: At program point L136-5(lines 136 142) the Hoare annotation is: true [2020-07-08 17:37:47,522 INFO L271 CegarLoopResult]: At program point L136-6(lines 136 142) the Hoare annotation is: true [2020-07-08 17:37:47,522 INFO L271 CegarLoopResult]: At program point ludcmpEXIT(lines 109 153) the Hoare annotation is: true [2020-07-08 17:37:47,523 INFO L264 CegarLoopResult]: At program point ludcmpENTRY(lines 109 153) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,523 INFO L271 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: true [2020-07-08 17:37:47,523 INFO L271 CegarLoopResult]: At program point L121-1(line 121) the Hoare annotation is: true [2020-07-08 17:37:47,523 INFO L271 CegarLoopResult]: At program point L121-2(line 121) the Hoare annotation is: true [2020-07-08 17:37:47,523 INFO L271 CegarLoopResult]: At program point L138(line 138) the Hoare annotation is: true [2020-07-08 17:37:47,523 INFO L271 CegarLoopResult]: At program point L138-1(line 138) the Hoare annotation is: true [2020-07-08 17:37:47,523 INFO L271 CegarLoopResult]: At program point L138-2(line 138) the Hoare annotation is: true [2020-07-08 17:37:47,523 INFO L271 CegarLoopResult]: At program point L122(lines 122 124) the Hoare annotation is: true [2020-07-08 17:37:47,523 INFO L271 CegarLoopResult]: At program point L122-1(lines 122 124) the Hoare annotation is: true [2020-07-08 17:37:47,524 INFO L271 CegarLoopResult]: At program point L139(line 139) the Hoare annotation is: true [2020-07-08 17:37:47,524 INFO L271 CegarLoopResult]: At program point L139-3(lines 139 140) the Hoare annotation is: true [2020-07-08 17:37:47,524 INFO L271 CegarLoopResult]: At program point L139-4(line 139) the Hoare annotation is: true [2020-07-08 17:37:47,524 INFO L271 CegarLoopResult]: At program point L139-5(line 139) the Hoare annotation is: true [2020-07-08 17:37:47,524 INFO L271 CegarLoopResult]: At program point L139-6(lines 139 140) the Hoare annotation is: true [2020-07-08 17:37:47,524 INFO L271 CegarLoopResult]: At program point L139-7(lines 139 140) the Hoare annotation is: true [2020-07-08 17:37:47,524 INFO L271 CegarLoopResult]: At program point L123(line 123) the Hoare annotation is: true [2020-07-08 17:37:47,525 INFO L271 CegarLoopResult]: At program point L123-3(lines 123 124) the Hoare annotation is: true [2020-07-08 17:37:47,525 INFO L271 CegarLoopResult]: At program point L123-4(line 123) the Hoare annotation is: true [2020-07-08 17:37:47,525 INFO L271 CegarLoopResult]: At program point L123-5(line 123) the Hoare annotation is: true [2020-07-08 17:37:47,525 INFO L271 CegarLoopResult]: At program point L123-6(lines 123 124) the Hoare annotation is: true [2020-07-08 17:37:47,525 INFO L271 CegarLoopResult]: At program point L140(line 140) the Hoare annotation is: true [2020-07-08 17:37:47,525 INFO L271 CegarLoopResult]: At program point L140-1(line 140) the Hoare annotation is: true [2020-07-08 17:37:47,525 INFO L271 CegarLoopResult]: At program point L140-2(line 140) the Hoare annotation is: true [2020-07-08 17:37:47,525 INFO L271 CegarLoopResult]: At program point L140-3(line 140) the Hoare annotation is: true [2020-07-08 17:37:47,526 INFO L271 CegarLoopResult]: At program point L140-4(line 140) the Hoare annotation is: true [2020-07-08 17:37:47,526 INFO L271 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: true [2020-07-08 17:37:47,526 INFO L271 CegarLoopResult]: At program point L124-1(line 124) the Hoare annotation is: true [2020-07-08 17:37:47,526 INFO L271 CegarLoopResult]: At program point L124-2(line 124) the Hoare annotation is: true [2020-07-08 17:37:47,526 INFO L271 CegarLoopResult]: At program point L124-3(line 124) the Hoare annotation is: true [2020-07-08 17:37:47,526 INFO L271 CegarLoopResult]: At program point L124-4(line 124) the Hoare annotation is: true [2020-07-08 17:37:47,526 INFO L271 CegarLoopResult]: At program point L141(lines 136 142) the Hoare annotation is: true [2020-07-08 17:37:47,526 INFO L271 CegarLoopResult]: At program point L125(line 125) the Hoare annotation is: true [2020-07-08 17:37:47,527 INFO L271 CegarLoopResult]: At program point L125-1(line 125) the Hoare annotation is: true [2020-07-08 17:37:47,527 INFO L264 CegarLoopResult]: At program point L109(lines 109 153) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,527 INFO L264 CegarLoopResult]: At program point L109-1(lines 109 153) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,527 INFO L271 CegarLoopResult]: At program point L143(line 143) the Hoare annotation is: true [2020-07-08 17:37:47,527 INFO L271 CegarLoopResult]: At program point L143-1(line 143) the Hoare annotation is: true [2020-07-08 17:37:47,527 INFO L271 CegarLoopResult]: At program point L143-2(line 143) the Hoare annotation is: true [2020-07-08 17:37:47,527 INFO L271 CegarLoopResult]: At program point L143-3(line 143) the Hoare annotation is: true [2020-07-08 17:37:47,528 INFO L271 CegarLoopResult]: At program point L127-2(line 127) the Hoare annotation is: true [2020-07-08 17:37:47,528 INFO L271 CegarLoopResult]: At program point L127-3(line 127) the Hoare annotation is: true [2020-07-08 17:37:47,528 INFO L271 CegarLoopResult]: At program point L127-4(lines 127 133) the Hoare annotation is: true [2020-07-08 17:37:47,528 INFO L271 CegarLoopResult]: At program point L144(line 144) the Hoare annotation is: true [2020-07-08 17:37:47,528 INFO L271 CegarLoopResult]: At program point L144-3(lines 144 150) the Hoare annotation is: true [2020-07-08 17:37:47,528 INFO L271 CegarLoopResult]: At program point L144-4(line 144) the Hoare annotation is: true [2020-07-08 17:37:47,528 INFO L271 CegarLoopResult]: At program point L144-5(line 144) the Hoare annotation is: true [2020-07-08 17:37:47,528 INFO L271 CegarLoopResult]: At program point L144-6(lines 144 150) the Hoare annotation is: true [2020-07-08 17:37:47,529 INFO L271 CegarLoopResult]: At program point L144-7(lines 144 150) the Hoare annotation is: true [2020-07-08 17:37:47,529 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,529 INFO L264 CegarLoopResult]: At program point L112-1(line 112) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,530 INFO L264 CegarLoopResult]: At program point L112-2(line 112) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,530 INFO L271 CegarLoopResult]: At program point L129(line 129) the Hoare annotation is: true [2020-07-08 17:37:47,530 INFO L271 CegarLoopResult]: At program point L129-1(line 129) the Hoare annotation is: true [2020-07-08 17:37:47,530 INFO L271 CegarLoopResult]: At program point L129-2(line 129) the Hoare annotation is: true [2020-07-08 17:37:47,530 INFO L271 CegarLoopResult]: At program point L146(line 146) the Hoare annotation is: true [2020-07-08 17:37:47,530 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,530 INFO L271 CegarLoopResult]: At program point L146-1(line 146) the Hoare annotation is: true [2020-07-08 17:37:47,530 INFO L264 CegarLoopResult]: At program point L113-1(line 113) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,530 INFO L271 CegarLoopResult]: At program point L146-2(line 146) the Hoare annotation is: true [2020-07-08 17:37:47,531 INFO L271 CegarLoopResult]: At program point L113-2(lines 110 153) the Hoare annotation is: true [2020-07-08 17:37:47,531 INFO L271 CegarLoopResult]: At program point L113-3(line 113) the Hoare annotation is: true [2020-07-08 17:37:47,531 INFO L271 CegarLoopResult]: At program point L113-4(line 113) the Hoare annotation is: true [2020-07-08 17:37:47,531 INFO L271 CegarLoopResult]: At program point L113-5(line 113) the Hoare annotation is: true [2020-07-08 17:37:47,531 INFO L271 CegarLoopResult]: At program point L113-6(line 113) the Hoare annotation is: true [2020-07-08 17:37:47,531 INFO L271 CegarLoopResult]: At program point L113-7(line 113) the Hoare annotation is: true [2020-07-08 17:37:47,532 INFO L271 CegarLoopResult]: At program point L113-8(line 113) the Hoare annotation is: true [2020-07-08 17:37:47,532 INFO L271 CegarLoopResult]: At program point ludcmpFINAL(lines 109 153) the Hoare annotation is: true [2020-07-08 17:37:47,532 INFO L271 CegarLoopResult]: At program point L130(line 130) the Hoare annotation is: true [2020-07-08 17:37:47,532 INFO L271 CegarLoopResult]: At program point L130-3(lines 130 131) the Hoare annotation is: true [2020-07-08 17:37:47,533 INFO L271 CegarLoopResult]: At program point L130-4(line 130) the Hoare annotation is: true [2020-07-08 17:37:47,533 INFO L271 CegarLoopResult]: At program point L130-5(line 130) the Hoare annotation is: true [2020-07-08 17:37:47,533 INFO L271 CegarLoopResult]: At program point L130-6(lines 130 131) the Hoare annotation is: true [2020-07-08 17:37:47,533 INFO L271 CegarLoopResult]: At program point L130-7(lines 130 131) the Hoare annotation is: true [2020-07-08 17:37:47,533 INFO L271 CegarLoopResult]: At program point L147(line 147) the Hoare annotation is: true [2020-07-08 17:37:47,533 INFO L271 CegarLoopResult]: At program point L147-3(lines 147 148) the Hoare annotation is: true [2020-07-08 17:37:47,533 INFO L271 CegarLoopResult]: At program point L147-4(line 147) the Hoare annotation is: true [2020-07-08 17:37:47,533 INFO L271 CegarLoopResult]: At program point L147-5(line 147) the Hoare annotation is: true [2020-07-08 17:37:47,534 INFO L271 CegarLoopResult]: At program point L147-6(lines 147 148) the Hoare annotation is: true [2020-07-08 17:37:47,534 INFO L271 CegarLoopResult]: At program point L147-7(lines 147 148) the Hoare annotation is: true [2020-07-08 17:37:47,534 INFO L271 CegarLoopResult]: At program point L131(line 131) the Hoare annotation is: true [2020-07-08 17:37:47,534 INFO L271 CegarLoopResult]: At program point L131-1(line 131) the Hoare annotation is: true [2020-07-08 17:37:47,534 INFO L271 CegarLoopResult]: At program point L131-2(line 131) the Hoare annotation is: true [2020-07-08 17:37:47,535 INFO L271 CegarLoopResult]: At program point L131-3(line 131) the Hoare annotation is: true [2020-07-08 17:37:47,535 INFO L271 CegarLoopResult]: At program point L131-4(line 131) the Hoare annotation is: true [2020-07-08 17:37:47,535 INFO L271 CegarLoopResult]: At program point L148(line 148) the Hoare annotation is: true [2020-07-08 17:37:47,535 INFO L271 CegarLoopResult]: At program point L115(line 115) the Hoare annotation is: true [2020-07-08 17:37:47,535 INFO L271 CegarLoopResult]: At program point L148-1(line 148) the Hoare annotation is: true [2020-07-08 17:37:47,535 INFO L271 CegarLoopResult]: At program point L148-2(line 148) the Hoare annotation is: true [2020-07-08 17:37:47,535 INFO L271 CegarLoopResult]: At program point L148-3(line 148) the Hoare annotation is: true [2020-07-08 17:37:47,536 INFO L271 CegarLoopResult]: At program point L148-4(line 148) the Hoare annotation is: true [2020-07-08 17:37:47,536 INFO L271 CegarLoopResult]: At program point L132(lines 127 133) the Hoare annotation is: true [2020-07-08 17:37:47,536 INFO L271 CegarLoopResult]: At program point L149(line 149) the Hoare annotation is: true [2020-07-08 17:37:47,536 INFO L271 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: true [2020-07-08 17:37:47,536 INFO L271 CegarLoopResult]: At program point L149-1(line 149) the Hoare annotation is: true [2020-07-08 17:37:47,536 INFO L271 CegarLoopResult]: At program point L116-3(lines 116 134) the Hoare annotation is: true [2020-07-08 17:37:47,536 INFO L271 CegarLoopResult]: At program point L116-4(line 116) the Hoare annotation is: true [2020-07-08 17:37:47,536 INFO L271 CegarLoopResult]: At program point L116-5(line 116) the Hoare annotation is: true [2020-07-08 17:37:47,536 INFO L271 CegarLoopResult]: At program point L116-6(lines 116 134) the Hoare annotation is: true [2020-07-08 17:37:47,537 INFO L271 CegarLoopResult]: At program point L116-7(lines 116 134) the Hoare annotation is: true [2020-07-08 17:37:47,537 INFO L271 CegarLoopResult]: At program point L69-4(line 69) the Hoare annotation is: true [2020-07-08 17:37:47,537 INFO L271 CegarLoopResult]: At program point L69-5(line 69) the Hoare annotation is: true [2020-07-08 17:37:47,537 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 17:37:47,537 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-08 17:37:47,537 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 17:37:47,537 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#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|)) [2020-07-08 17:37:47,538 INFO L271 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: true [2020-07-08 17:37:47,538 INFO L271 CegarLoopResult]: At program point L69-1(line 69) the Hoare annotation is: true [2020-07-08 17:37:47,538 INFO L271 CegarLoopResult]: At program point L69-2(line 69) the Hoare annotation is: true [2020-07-08 17:37:47,538 INFO L271 CegarLoopResult]: At program point L69-3(line 69) the Hoare annotation is: true [2020-07-08 17:37:47,538 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 17:37:47,538 INFO L271 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: true [2020-07-08 17:37:47,538 INFO L271 CegarLoopResult]: At program point L78(lines 78 79) the Hoare annotation is: true [2020-07-08 17:37:47,538 INFO L271 CegarLoopResult]: At program point L78-1(line 78) the Hoare annotation is: true [2020-07-08 17:37:47,538 INFO L271 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: true [2020-07-08 17:37:47,539 INFO L271 CegarLoopResult]: At program point L78-3(lines 78 79) the Hoare annotation is: true [2020-07-08 17:37:47,539 INFO L271 CegarLoopResult]: At program point fabsEXIT(lines 74 81) the Hoare annotation is: true [2020-07-08 17:37:47,539 INFO L271 CegarLoopResult]: At program point fabsENTRY(lines 74 81) the Hoare annotation is: true [2020-07-08 17:37:47,539 INFO L271 CegarLoopResult]: At program point fabsFINAL(lines 74 81) the Hoare annotation is: true [2020-07-08 17:37:47,539 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 17:37:47,539 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 17:37:47,539 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 17:37:47,539 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 17:37:47,540 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5) (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0)) [2020-07-08 17:37:47,540 INFO L264 CegarLoopResult]: At program point L97-1(line 97) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5) (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0)) [2020-07-08 17:37:47,540 INFO L264 CegarLoopResult]: At program point L97-2(line 97) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5) (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0)) [2020-07-08 17:37:47,540 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,540 INFO L264 CegarLoopResult]: At program point L97-4(line 97) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~j~0 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,540 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (and (<= main_~n~0 5) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (<= 5 main_~n~0) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,540 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 83 107) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-08 17:37:47,540 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-08 17:37:47,541 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~j~0 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,541 INFO L264 CegarLoopResult]: At program point L98-1(line 98) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~j~0 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,541 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,541 INFO L264 CegarLoopResult]: At program point L94-3(lines 94 99) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~j~0 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,541 INFO L264 CegarLoopResult]: At program point L94-4(line 94) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~j~0 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,541 INFO L264 CegarLoopResult]: At program point L94-5(line 94) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,541 INFO L264 CegarLoopResult]: At program point L94-6(lines 94 99) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,542 INFO L264 CegarLoopResult]: At program point L94-7(lines 94 99) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,542 INFO L264 CegarLoopResult]: At program point L86(line 86) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,542 INFO L264 CegarLoopResult]: At program point L86-1(line 86) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,542 INFO L264 CegarLoopResult]: At program point L86-2(line 86) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,542 INFO L264 CegarLoopResult]: At program point L86-3(line 86) the Hoare annotation is: (and (<= main_~n~0 5) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (<= 5 main_~n~0) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,542 INFO L264 CegarLoopResult]: At program point L91(line 91) the Hoare annotation is: (and (<= main_~n~0 5) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (<= 5 main_~n~0) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,542 INFO L264 CegarLoopResult]: At program point L91-3(line 91) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,543 INFO L264 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (and (<= main_~n~0 5) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (<= 5 main_~n~0) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,543 INFO L264 CegarLoopResult]: At program point L91-4(line 91) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0)) [2020-07-08 17:37:47,544 INFO L264 CegarLoopResult]: At program point L87-1(line 87) the Hoare annotation is: (and (<= main_~n~0 5) (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (<= 5 main_~n~0) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,544 INFO L264 CegarLoopResult]: At program point L91-5(lines 91 102) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0)) [2020-07-08 17:37:47,544 INFO L264 CegarLoopResult]: At program point L91-6(lines 91 102) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-08 17:37:47,544 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 83 107) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-08 17:37:47,544 INFO L264 CegarLoopResult]: At program point L104(line 104) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-08 17:37:47,544 INFO L264 CegarLoopResult]: At program point L104-1(line 104) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-08 17:37:47,544 INFO L264 CegarLoopResult]: At program point L104-2(line 104) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-08 17:37:47,544 INFO L264 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,544 INFO L264 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~j~0 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,545 INFO L264 CegarLoopResult]: At program point L96-1(lines 95 99) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~j~0 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,545 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 83 107) the Hoare annotation is: (and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-08 17:37:47,545 INFO L264 CegarLoopResult]: At program point L101(lines 91 102) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0) (<= main_~i~0 5)) [2020-07-08 17:37:47,545 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-08 17:37:47,545 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 3 8) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 17:37:47,545 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 17:37:47,545 INFO L264 CegarLoopResult]: At program point L4(lines 4 6) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 17:37:47,546 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 17:37:47,546 INFO L264 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 17:37:47,579 INFO L163 areAnnotationChecker]: CFG has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 17:37:47,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 05:37:47 BoogieIcfgContainer [2020-07-08 17:37:47,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 17:37:47,597 INFO L168 Benchmark]: Toolchain (without parser) took 41118.15 ms. Allocated memory was 144.2 MB in the beginning and 544.7 MB in the end (delta: 400.6 MB). Free memory was 100.8 MB in the beginning and 387.3 MB in the end (delta: -286.5 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:47,598 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 144.2 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-08 17:37:47,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.54 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.4 MB in the beginning and 178.6 MB in the end (delta: -78.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:47,599 INFO L168 Benchmark]: Boogie Preprocessor took 80.67 ms. Allocated memory is still 202.4 MB. Free memory was 178.6 MB in the beginning and 174.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:47,600 INFO L168 Benchmark]: RCFGBuilder took 1107.68 ms. Allocated memory is still 202.4 MB. Free memory was 174.9 MB in the beginning and 109.6 MB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:47,601 INFO L168 Benchmark]: TraceAbstraction took 39366.20 ms. Allocated memory was 202.4 MB in the beginning and 544.7 MB in the end (delta: 342.4 MB). Free memory was 109.0 MB in the beginning and 387.3 MB in the end (delta: -278.4 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:47,604 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 1.41 ms. Allocated memory is still 144.2 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 553.54 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.4 MB in the beginning and 178.6 MB in the end (delta: -78.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.67 ms. Allocated memory is still 202.4 MB. Free memory was 178.6 MB in the beginning and 174.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1107.68 ms. Allocated memory is still 202.4 MB. Free memory was 174.9 MB in the beginning and 109.6 MB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39366.20 ms. Allocated memory was 202.4 MB in the beginning and 544.7 MB in the end (delta: 342.4 MB). Free memory was 109.0 MB in the beginning and 387.3 MB in the end (delta: -278.4 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: n <= 5 && 5 <= n - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: (n <= 5 && 5 <= n) && i <= 5 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 109]: Procedure Contract for ludcmp Derived contract for procedure ludcmp: 1 - ProcedureContractResult [Line: 74]: Procedure Contract for fabs Derived contract for procedure fabs: 1 - ProcedureContractResult [Line: 83]: Procedure Contract for main Derived contract for procedure main: 5 <= n - ProcedureContractResult [Line: 3]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 186 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 36.3s, OverallIterations: 11, TraceHistogramMax: 18, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 588 SDtfs, 939 SDslu, 1295 SDs, 0 SdLazy, 2119 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 210 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 186 LocationsWithAnnotation, 544 PreInvPairs, 1012 NumberOfFragments, 654 HoareAnnotationTreeSize, 544 FomulaSimplifications, 126636 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 186 FomulaSimplificationsInter, 1689 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...