/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-8fc6572 [2020-07-10 20:21:52,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:52,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:52,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:52,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:52,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:52,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:52,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:52,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:52,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:52,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:52,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:52,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:52,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:52,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:52,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:52,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:52,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:52,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:52,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:52,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:52,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:52,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:52,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:52,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:52,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:52,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:52,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:52,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:52,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:52,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:52,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:52,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:52,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:52,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:52,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:52,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:52,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:52,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:52,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:52,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:52,178 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:52,199 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:52,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:52,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:52,203 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:52,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:52,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:52,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:52,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:52,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:52,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:52,205 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:52,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:52,205 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:52,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:52,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:52,206 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:52,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:52,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:52,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:52,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:52,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:52,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:52,207 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:52,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:52,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:52,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:52,496 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:52,496 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:52,497 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-10 20:21:52,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6927c20/7ac4530bc8d24060aa1c7bc8668267b2/FLAG1dc50cd16 [2020-07-10 20:21:53,092 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:53,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c [2020-07-10 20:21:53,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6927c20/7ac4530bc8d24060aa1c7bc8668267b2/FLAG1dc50cd16 [2020-07-10 20:21:53,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6927c20/7ac4530bc8d24060aa1c7bc8668267b2 [2020-07-10 20:21:53,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:53,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:53,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:53,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:53,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:53,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:53" (1/1) ... [2020-07-10 20:21:53,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@514949ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53, skipping insertion in model container [2020-07-10 20:21:53,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:53" (1/1) ... [2020-07-10 20:21:53,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:53,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:53,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:53,704 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:53,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:53,870 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:53,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53 WrapperNode [2020-07-10 20:21:53,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:53,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:53,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:53,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:53,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53" (1/1) ... [2020-07-10 20:21:53,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53" (1/1) ... [2020-07-10 20:21:53,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53" (1/1) ... [2020-07-10 20:21:53,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53" (1/1) ... [2020-07-10 20:21:53,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53" (1/1) ... [2020-07-10 20:21:53,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53" (1/1) ... [2020-07-10 20:21:53,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53" (1/1) ... [2020-07-10 20:21:53,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:53,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:53,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:53,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:53,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:54,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2020-07-10 20:21:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2020-07-10 20:21:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2020-07-10 20:21:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2020-07-10 20:21:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 20:21:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 20:21:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:54,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:54,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:54,873 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:54,873 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-10 20:21:54,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:54 BoogieIcfgContainer [2020-07-10 20:21:54,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:54,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:54,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:54,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:54,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:53" (1/3) ... [2020-07-10 20:21:54,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac7fb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:54, skipping insertion in model container [2020-07-10 20:21:54,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:53" (2/3) ... [2020-07-10 20:21:54,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac7fb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:54, skipping insertion in model container [2020-07-10 20:21:54,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:54" (3/3) ... [2020-07-10 20:21:54,893 INFO L109 eAbstractionObserver]: Analyzing ICFG lu.cmp.c [2020-07-10 20:21:54,903 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:54,912 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:54,924 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:54,944 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:54,944 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:54,944 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:54,944 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:54,945 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:54,946 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:54,946 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:54,946 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states. [2020-07-10 20:21:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 20:21:54,978 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:54,979 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-10 20:21:54,979 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:54,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1445504148, now seen corresponding path program 1 times [2020-07-10 20:21:54,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:54,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1725766101] [2020-07-10 20:21:54,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:55,347 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-10 20:21:55,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} #valid := #valid[0 := 0]; {189#true} is VALID [2020-07-10 20:21:55,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#true} assume 0 < #StackHeapBarrier; {189#true} is VALID [2020-07-10 20:21:55,349 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-10 20:21:55,350 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {189#true} is VALID [2020-07-10 20:21:55,350 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-10 20:21:55,350 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {189#true} is VALID [2020-07-10 20:21:55,351 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-10 20:21:55,351 INFO L280 TraceCheckUtils]: 8: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {189#true} is VALID [2020-07-10 20:21:55,352 INFO L280 TraceCheckUtils]: 9: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-10 20:21:55,352 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {189#true} {189#true} #330#return; {189#true} is VALID [2020-07-10 20:21:55,358 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-10 20:21:55,358 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-10 20:21:55,358 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#true} #valid := #valid[0 := 0]; {189#true} is VALID [2020-07-10 20:21:55,359 INFO L280 TraceCheckUtils]: 3: Hoare triple {189#true} assume 0 < #StackHeapBarrier; {189#true} is VALID [2020-07-10 20:21:55,359 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-10 20:21:55,360 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {189#true} is VALID [2020-07-10 20:21:55,360 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-10 20:21:55,360 INFO L280 TraceCheckUtils]: 7: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {189#true} is VALID [2020-07-10 20:21:55,361 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-10 20:21:55,361 INFO L280 TraceCheckUtils]: 9: Hoare triple {189#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {189#true} is VALID [2020-07-10 20:21:55,361 INFO L280 TraceCheckUtils]: 10: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-10 20:21:55,362 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {189#true} {189#true} #330#return; {189#true} is VALID [2020-07-10 20:21:55,362 INFO L263 TraceCheckUtils]: 12: Hoare triple {189#true} call #t~ret33 := main(); {189#true} is VALID [2020-07-10 20:21:55,363 INFO L280 TraceCheckUtils]: 13: Hoare triple {189#true} havoc ~i~0; {189#true} is VALID [2020-07-10 20:21:55,363 INFO L280 TraceCheckUtils]: 14: Hoare triple {189#true} havoc ~j~0; {189#true} is VALID [2020-07-10 20:21:55,364 INFO L280 TraceCheckUtils]: 15: Hoare triple {189#true} ~nmax~0 := 50; {189#true} is VALID [2020-07-10 20:21:55,365 INFO L280 TraceCheckUtils]: 16: Hoare triple {189#true} ~n~0 := 5; {202#(<= 5 main_~n~0)} is VALID [2020-07-10 20:21:55,367 INFO L280 TraceCheckUtils]: 17: Hoare triple {202#(<= 5 main_~n~0)} havoc ~chkerr~0; {202#(<= 5 main_~n~0)} is VALID [2020-07-10 20:21:55,369 INFO L280 TraceCheckUtils]: 18: Hoare triple {202#(<= 5 main_~n~0)} havoc ~eps~0; {202#(<= 5 main_~n~0)} is VALID [2020-07-10 20:21:55,370 INFO L280 TraceCheckUtils]: 19: Hoare triple {202#(<= 5 main_~n~0)} havoc ~w~0; {202#(<= 5 main_~n~0)} is VALID [2020-07-10 20:21:55,371 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-10 20:21:55,372 INFO L280 TraceCheckUtils]: 21: Hoare triple {202#(<= 5 main_~n~0)} ~i~0 := 0; {202#(<= 5 main_~n~0)} is VALID [2020-07-10 20:21:55,373 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-10 20:21:55,374 INFO L280 TraceCheckUtils]: 23: Hoare triple {202#(<= 5 main_~n~0)} ~w~0 := 0.0; {202#(<= 5 main_~n~0)} is VALID [2020-07-10 20:21:55,375 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-10 20:21:55,377 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-10 20:21:55,377 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-10 20:21:55,377 INFO L280 TraceCheckUtils]: 27: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2020-07-10 20:21:55,378 INFO L280 TraceCheckUtils]: 28: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2020-07-10 20:21:55,378 INFO L280 TraceCheckUtils]: 29: Hoare triple {190#false} assume !false; {190#false} is VALID [2020-07-10 20:21:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:55,385 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:55,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1725766101] [2020-07-10 20:21:55,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:55,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:55,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496650108] [2020-07-10 20:21:55,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 20:21:55,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:55,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:55,468 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-10 20:21:55,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:55,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:55,480 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 5 states. [2020-07-10 20:21:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:57,307 INFO L93 Difference]: Finished difference Result 367 states and 432 transitions. [2020-07-10 20:21:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:21:57,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 20:21:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 432 transitions. [2020-07-10 20:21:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 432 transitions. [2020-07-10 20:21:57,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 432 transitions. [2020-07-10 20:21:57,845 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-10 20:21:57,866 INFO L225 Difference]: With dead ends: 367 [2020-07-10 20:21:57,866 INFO L226 Difference]: Without dead ends: 64 [2020-07-10 20:21:57,881 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-10 20:21:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-10 20:21:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2020-07-10 20:21:58,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:58,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 49 states. [2020-07-10 20:21:58,111 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 49 states. [2020-07-10 20:21:58,111 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 49 states. [2020-07-10 20:21:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:58,120 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-10 20:21:58,121 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-10 20:21:58,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:58,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:58,123 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 64 states. [2020-07-10 20:21:58,123 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 64 states. [2020-07-10 20:21:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:58,132 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-10 20:21:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-10 20:21:58,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:58,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:58,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:58,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 20:21:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-10 20:21:58,143 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 30 [2020-07-10 20:21:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:58,148 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-10 20:21:58,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:58,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2020-07-10 20:21:58,237 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-10 20:21:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-10 20:21:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:21:58,239 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:58,240 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-10 20:21:58,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:58,240 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -905808642, now seen corresponding path program 1 times [2020-07-10 20:21:58,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:58,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [778277646] [2020-07-10 20:21:58,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:58,419 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-10 20:21:58,420 INFO L280 TraceCheckUtils]: 1: Hoare triple {1171#true} #valid := #valid[0 := 0]; {1171#true} is VALID [2020-07-10 20:21:58,420 INFO L280 TraceCheckUtils]: 2: Hoare triple {1171#true} assume 0 < #StackHeapBarrier; {1171#true} is VALID [2020-07-10 20:21:58,420 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-10 20:21:58,421 INFO L280 TraceCheckUtils]: 4: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1171#true} is VALID [2020-07-10 20:21:58,421 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-10 20:21:58,421 INFO L280 TraceCheckUtils]: 6: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1171#true} is VALID [2020-07-10 20:21:58,422 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-10 20:21:58,422 INFO L280 TraceCheckUtils]: 8: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1171#true} is VALID [2020-07-10 20:21:58,422 INFO L280 TraceCheckUtils]: 9: Hoare triple {1171#true} assume true; {1171#true} is VALID [2020-07-10 20:21:58,423 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1171#true} {1171#true} #330#return; {1171#true} is VALID [2020-07-10 20:21:58,425 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-10 20:21:58,425 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-10 20:21:58,426 INFO L280 TraceCheckUtils]: 2: Hoare triple {1171#true} #valid := #valid[0 := 0]; {1171#true} is VALID [2020-07-10 20:21:58,426 INFO L280 TraceCheckUtils]: 3: Hoare triple {1171#true} assume 0 < #StackHeapBarrier; {1171#true} is VALID [2020-07-10 20:21:58,426 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-10 20:21:58,426 INFO L280 TraceCheckUtils]: 5: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1171#true} is VALID [2020-07-10 20:21:58,427 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-10 20:21:58,427 INFO L280 TraceCheckUtils]: 7: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1171#true} is VALID [2020-07-10 20:21:58,427 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-10 20:21:58,428 INFO L280 TraceCheckUtils]: 9: Hoare triple {1171#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1171#true} is VALID [2020-07-10 20:21:58,428 INFO L280 TraceCheckUtils]: 10: Hoare triple {1171#true} assume true; {1171#true} is VALID [2020-07-10 20:21:58,428 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1171#true} {1171#true} #330#return; {1171#true} is VALID [2020-07-10 20:21:58,429 INFO L263 TraceCheckUtils]: 12: Hoare triple {1171#true} call #t~ret33 := main(); {1171#true} is VALID [2020-07-10 20:21:58,429 INFO L280 TraceCheckUtils]: 13: Hoare triple {1171#true} havoc ~i~0; {1171#true} is VALID [2020-07-10 20:21:58,429 INFO L280 TraceCheckUtils]: 14: Hoare triple {1171#true} havoc ~j~0; {1171#true} is VALID [2020-07-10 20:21:58,430 INFO L280 TraceCheckUtils]: 15: Hoare triple {1171#true} ~nmax~0 := 50; {1171#true} is VALID [2020-07-10 20:21:58,430 INFO L280 TraceCheckUtils]: 16: Hoare triple {1171#true} ~n~0 := 5; {1171#true} is VALID [2020-07-10 20:21:58,430 INFO L280 TraceCheckUtils]: 17: Hoare triple {1171#true} havoc ~chkerr~0; {1171#true} is VALID [2020-07-10 20:21:58,431 INFO L280 TraceCheckUtils]: 18: Hoare triple {1171#true} havoc ~eps~0; {1171#true} is VALID [2020-07-10 20:21:58,431 INFO L280 TraceCheckUtils]: 19: Hoare triple {1171#true} havoc ~w~0; {1171#true} is VALID [2020-07-10 20:21:58,431 INFO L280 TraceCheckUtils]: 20: Hoare triple {1171#true} ~eps~0 := 1.0E-6; {1171#true} is VALID [2020-07-10 20:21:58,432 INFO L280 TraceCheckUtils]: 21: Hoare triple {1171#true} ~i~0 := 0; {1184#(= 0 main_~i~0)} is VALID [2020-07-10 20:21:58,433 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-10 20:21:58,434 INFO L280 TraceCheckUtils]: 23: Hoare triple {1184#(= 0 main_~i~0)} ~w~0 := 0.0; {1184#(= 0 main_~i~0)} is VALID [2020-07-10 20:21:58,435 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-10 20:21:58,436 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-10 20:21:58,437 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-10 20:21:58,438 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-10 20:21:58,438 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-10 20:21:58,438 INFO L280 TraceCheckUtils]: 29: Hoare triple {1172#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {1172#false} is VALID [2020-07-10 20:21:58,439 INFO L280 TraceCheckUtils]: 30: Hoare triple {1172#false} havoc #t~mem3; {1172#false} is VALID [2020-07-10 20:21:58,439 INFO L280 TraceCheckUtils]: 31: Hoare triple {1172#false} #t~post1 := ~j~0; {1172#false} is VALID [2020-07-10 20:21:58,439 INFO L280 TraceCheckUtils]: 32: Hoare triple {1172#false} ~j~0 := 1 + #t~post1; {1172#false} is VALID [2020-07-10 20:21:58,440 INFO L280 TraceCheckUtils]: 33: Hoare triple {1172#false} havoc #t~post1; {1172#false} is VALID [2020-07-10 20:21:58,440 INFO L280 TraceCheckUtils]: 34: Hoare triple {1172#false} assume !(~j~0 <= ~n~0); {1172#false} is VALID [2020-07-10 20:21:58,440 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-10 20:21:58,440 INFO L280 TraceCheckUtils]: 36: Hoare triple {1172#false} ~cond := #in~cond; {1172#false} is VALID [2020-07-10 20:21:58,441 INFO L280 TraceCheckUtils]: 37: Hoare triple {1172#false} assume 0 == ~cond; {1172#false} is VALID [2020-07-10 20:21:58,441 INFO L280 TraceCheckUtils]: 38: Hoare triple {1172#false} assume !false; {1172#false} is VALID [2020-07-10 20:21:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:58,444 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:58,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [778277646] [2020-07-10 20:21:58,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:58,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:58,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375020762] [2020-07-10 20:21:58,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-10 20:21:58,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:58,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:58,487 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-10 20:21:58,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:58,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:58,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:58,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:58,488 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2020-07-10 20:21:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:59,131 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2020-07-10 20:21:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:21:59,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-10 20:21:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-10 20:21:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-10 20:21:59,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 109 transitions. [2020-07-10 20:21:59,281 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-10 20:21:59,285 INFO L225 Difference]: With dead ends: 103 [2020-07-10 20:21:59,285 INFO L226 Difference]: Without dead ends: 76 [2020-07-10 20:21:59,287 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:21:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-10 20:21:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2020-07-10 20:21:59,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:59,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 55 states. [2020-07-10 20:21:59,461 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 55 states. [2020-07-10 20:21:59,461 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 55 states. [2020-07-10 20:21:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:59,465 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2020-07-10 20:21:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2020-07-10 20:21:59,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:59,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:59,467 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 76 states. [2020-07-10 20:21:59,467 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 76 states. [2020-07-10 20:21:59,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:59,471 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2020-07-10 20:21:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2020-07-10 20:21:59,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:59,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:59,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:59,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 20:21:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-07-10 20:21:59,475 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 39 [2020-07-10 20:21:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:59,476 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-07-10 20:21:59,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:59,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2020-07-10 20:21:59,571 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-10 20:21:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-10 20:21:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 20:21:59,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:59,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:59,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:59,573 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:59,573 INFO L82 PathProgramCache]: Analyzing trace with hash -361483259, now seen corresponding path program 1 times [2020-07-10 20:21:59,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:59,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1140198480] [2020-07-10 20:21:59,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:59,739 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-10 20:21:59,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {1661#true} #valid := #valid[0 := 0]; {1661#true} is VALID [2020-07-10 20:21:59,740 INFO L280 TraceCheckUtils]: 2: Hoare triple {1661#true} assume 0 < #StackHeapBarrier; {1661#true} is VALID [2020-07-10 20:21:59,741 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-10 20:21:59,741 INFO L280 TraceCheckUtils]: 4: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1661#true} is VALID [2020-07-10 20:21:59,741 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-10 20:21:59,742 INFO L280 TraceCheckUtils]: 6: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1661#true} is VALID [2020-07-10 20:21:59,742 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-10 20:21:59,743 INFO L280 TraceCheckUtils]: 8: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1661#true} is VALID [2020-07-10 20:21:59,743 INFO L280 TraceCheckUtils]: 9: Hoare triple {1661#true} assume true; {1661#true} is VALID [2020-07-10 20:21:59,744 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1661#true} {1661#true} #330#return; {1661#true} is VALID [2020-07-10 20:21:59,745 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-10 20:21:59,746 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-10 20:21:59,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {1661#true} #valid := #valid[0 := 0]; {1661#true} is VALID [2020-07-10 20:21:59,746 INFO L280 TraceCheckUtils]: 3: Hoare triple {1661#true} assume 0 < #StackHeapBarrier; {1661#true} is VALID [2020-07-10 20:21:59,747 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-10 20:21:59,747 INFO L280 TraceCheckUtils]: 5: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {1661#true} is VALID [2020-07-10 20:21:59,747 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-10 20:21:59,748 INFO L280 TraceCheckUtils]: 7: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {1661#true} is VALID [2020-07-10 20:21:59,748 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-10 20:21:59,748 INFO L280 TraceCheckUtils]: 9: Hoare triple {1661#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1661#true} is VALID [2020-07-10 20:21:59,749 INFO L280 TraceCheckUtils]: 10: Hoare triple {1661#true} assume true; {1661#true} is VALID [2020-07-10 20:21:59,749 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1661#true} {1661#true} #330#return; {1661#true} is VALID [2020-07-10 20:21:59,749 INFO L263 TraceCheckUtils]: 12: Hoare triple {1661#true} call #t~ret33 := main(); {1661#true} is VALID [2020-07-10 20:21:59,749 INFO L280 TraceCheckUtils]: 13: Hoare triple {1661#true} havoc ~i~0; {1661#true} is VALID [2020-07-10 20:21:59,750 INFO L280 TraceCheckUtils]: 14: Hoare triple {1661#true} havoc ~j~0; {1661#true} is VALID [2020-07-10 20:21:59,750 INFO L280 TraceCheckUtils]: 15: Hoare triple {1661#true} ~nmax~0 := 50; {1661#true} is VALID [2020-07-10 20:21:59,750 INFO L280 TraceCheckUtils]: 16: Hoare triple {1661#true} ~n~0 := 5; {1661#true} is VALID [2020-07-10 20:21:59,750 INFO L280 TraceCheckUtils]: 17: Hoare triple {1661#true} havoc ~chkerr~0; {1661#true} is VALID [2020-07-10 20:21:59,751 INFO L280 TraceCheckUtils]: 18: Hoare triple {1661#true} havoc ~eps~0; {1661#true} is VALID [2020-07-10 20:21:59,751 INFO L280 TraceCheckUtils]: 19: Hoare triple {1661#true} havoc ~w~0; {1661#true} is VALID [2020-07-10 20:21:59,751 INFO L280 TraceCheckUtils]: 20: Hoare triple {1661#true} ~eps~0 := 1.0E-6; {1661#true} is VALID [2020-07-10 20:21:59,762 INFO L280 TraceCheckUtils]: 21: Hoare triple {1661#true} ~i~0 := 0; {1674#(= 0 main_~i~0)} is VALID [2020-07-10 20:21:59,763 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-10 20:21:59,764 INFO L280 TraceCheckUtils]: 23: Hoare triple {1674#(= 0 main_~i~0)} ~w~0 := 0.0; {1674#(= 0 main_~i~0)} is VALID [2020-07-10 20:21:59,781 INFO L280 TraceCheckUtils]: 24: Hoare triple {1674#(= 0 main_~i~0)} ~j~0 := 0; {1674#(= 0 main_~i~0)} is VALID [2020-07-10 20:21:59,782 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-10 20:21:59,787 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-10 20:21:59,788 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-10 20:21:59,788 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-10 20:21:59,789 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-10 20:21:59,790 INFO L280 TraceCheckUtils]: 30: Hoare triple {1674#(= 0 main_~i~0)} havoc #t~mem2; {1674#(= 0 main_~i~0)} is VALID [2020-07-10 20:21:59,790 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-10 20:21:59,791 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-10 20:21:59,791 INFO L280 TraceCheckUtils]: 33: Hoare triple {1674#(= 0 main_~i~0)} havoc #t~mem3; {1674#(= 0 main_~i~0)} is VALID [2020-07-10 20:21:59,792 INFO L280 TraceCheckUtils]: 34: Hoare triple {1674#(= 0 main_~i~0)} #t~post1 := ~j~0; {1674#(= 0 main_~i~0)} is VALID [2020-07-10 20:21:59,793 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-10 20:21:59,793 INFO L280 TraceCheckUtils]: 36: Hoare triple {1674#(= 0 main_~i~0)} havoc #t~post1; {1674#(= 0 main_~i~0)} is VALID [2020-07-10 20:21:59,794 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-10 20:21:59,795 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-10 20:21:59,796 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-10 20:21:59,796 INFO L280 TraceCheckUtils]: 40: Hoare triple {1676#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1662#false} is VALID [2020-07-10 20:21:59,797 INFO L280 TraceCheckUtils]: 41: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2020-07-10 20:21:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:59,801 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:59,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1140198480] [2020-07-10 20:21:59,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:59,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:21:59,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311567128] [2020-07-10 20:21:59,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-10 20:21:59,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:59,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:21:59,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:59,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:21:59,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:59,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:21:59,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:21:59,843 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 6 states. [2020-07-10 20:22:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:00,689 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2020-07-10 20:22:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:22:00,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-10 20:22:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:22:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-10 20:22:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:22:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-10 20:22:00,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2020-07-10 20:22:00,808 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-10 20:22:00,812 INFO L225 Difference]: With dead ends: 77 [2020-07-10 20:22:00,812 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 20:22:00,813 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-10 20:22:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 20:22:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-07-10 20:22:01,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:01,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 72 states. [2020-07-10 20:22:01,082 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 72 states. [2020-07-10 20:22:01,082 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 72 states. [2020-07-10 20:22:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,086 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2020-07-10 20:22:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-07-10 20:22:01,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:01,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:01,088 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 75 states. [2020-07-10 20:22:01,088 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 75 states. [2020-07-10 20:22:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,092 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2020-07-10 20:22:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-07-10 20:22:01,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:01,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:01,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:01,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-10 20:22:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2020-07-10 20:22:01,099 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 42 [2020-07-10 20:22:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:01,100 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2020-07-10 20:22:01,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:22:01,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2020-07-10 20:22:01,223 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-10 20:22:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-10 20:22:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-10 20:22:01,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:01,226 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-10 20:22:01,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:01,227 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:01,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1960696442, now seen corresponding path program 1 times [2020-07-10 20:22:01,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:01,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408603532] [2020-07-10 20:22:01,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:01,546 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-10 20:22:01,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {2136#true} #valid := #valid[0 := 0]; {2136#true} is VALID [2020-07-10 20:22:01,546 INFO L280 TraceCheckUtils]: 2: Hoare triple {2136#true} assume 0 < #StackHeapBarrier; {2136#true} is VALID [2020-07-10 20:22:01,547 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-10 20:22:01,547 INFO L280 TraceCheckUtils]: 4: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {2136#true} is VALID [2020-07-10 20:22:01,547 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-10 20:22:01,547 INFO L280 TraceCheckUtils]: 6: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {2136#true} is VALID [2020-07-10 20:22:01,547 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-10 20:22:01,548 INFO L280 TraceCheckUtils]: 8: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2136#true} is VALID [2020-07-10 20:22:01,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-10 20:22:01,548 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2136#true} {2136#true} #330#return; {2136#true} is VALID [2020-07-10 20:22:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:01,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {2136#true} ~cond := #in~cond; {2136#true} is VALID [2020-07-10 20:22:01,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {2136#true} assume !(0 == ~cond); {2136#true} is VALID [2020-07-10 20:22:01,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-10 20:22:01,553 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2136#true} {2137#false} #334#return; {2137#false} is VALID [2020-07-10 20:22:01,555 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-10 20:22:01,555 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-10 20:22:01,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {2136#true} #valid := #valid[0 := 0]; {2136#true} is VALID [2020-07-10 20:22:01,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {2136#true} assume 0 < #StackHeapBarrier; {2136#true} is VALID [2020-07-10 20:22:01,556 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-10 20:22:01,556 INFO L280 TraceCheckUtils]: 5: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {2136#true} is VALID [2020-07-10 20:22:01,556 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-10 20:22:01,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {2136#true} is VALID [2020-07-10 20:22:01,557 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-10 20:22:01,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {2136#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2136#true} is VALID [2020-07-10 20:22:01,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-10 20:22:01,557 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2136#true} {2136#true} #330#return; {2136#true} is VALID [2020-07-10 20:22:01,558 INFO L263 TraceCheckUtils]: 12: Hoare triple {2136#true} call #t~ret33 := main(); {2136#true} is VALID [2020-07-10 20:22:01,558 INFO L280 TraceCheckUtils]: 13: Hoare triple {2136#true} havoc ~i~0; {2136#true} is VALID [2020-07-10 20:22:01,558 INFO L280 TraceCheckUtils]: 14: Hoare triple {2136#true} havoc ~j~0; {2136#true} is VALID [2020-07-10 20:22:01,558 INFO L280 TraceCheckUtils]: 15: Hoare triple {2136#true} ~nmax~0 := 50; {2136#true} is VALID [2020-07-10 20:22:01,559 INFO L280 TraceCheckUtils]: 16: Hoare triple {2136#true} ~n~0 := 5; {2149#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:01,560 INFO L280 TraceCheckUtils]: 17: Hoare triple {2149#(<= 5 main_~n~0)} havoc ~chkerr~0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:01,563 INFO L280 TraceCheckUtils]: 18: Hoare triple {2149#(<= 5 main_~n~0)} havoc ~eps~0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:01,564 INFO L280 TraceCheckUtils]: 19: Hoare triple {2149#(<= 5 main_~n~0)} havoc ~w~0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:01,564 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-10 20:22:01,564 INFO L280 TraceCheckUtils]: 21: Hoare triple {2149#(<= 5 main_~n~0)} ~i~0 := 0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:01,565 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-10 20:22:01,566 INFO L280 TraceCheckUtils]: 23: Hoare triple {2149#(<= 5 main_~n~0)} ~w~0 := 0.0; {2149#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:01,566 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-10 20:22:01,567 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-10 20:22:01,568 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-10 20:22:01,569 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-10 20:22:01,570 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-10 20:22:01,571 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-10 20:22:01,572 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-10 20:22:01,572 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-10 20:22:01,573 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-10 20:22:01,574 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-10 20:22:01,575 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-10 20:22:01,576 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-10 20:22:01,577 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-10 20:22:01,578 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-10 20:22:01,579 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-10 20:22:01,579 INFO L280 TraceCheckUtils]: 39: Hoare triple {2136#true} ~cond := #in~cond; {2136#true} is VALID [2020-07-10 20:22:01,579 INFO L280 TraceCheckUtils]: 40: Hoare triple {2136#true} assume !(0 == ~cond); {2136#true} is VALID [2020-07-10 20:22:01,579 INFO L280 TraceCheckUtils]: 41: Hoare triple {2136#true} assume true; {2136#true} is VALID [2020-07-10 20:22:01,580 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2136#true} {2137#false} #334#return; {2137#false} is VALID [2020-07-10 20:22:01,580 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-10 20:22:01,580 INFO L280 TraceCheckUtils]: 44: Hoare triple {2137#false} #t~post0 := ~i~0; {2137#false} is VALID [2020-07-10 20:22:01,580 INFO L280 TraceCheckUtils]: 45: Hoare triple {2137#false} ~i~0 := 1 + #t~post0; {2137#false} is VALID [2020-07-10 20:22:01,581 INFO L280 TraceCheckUtils]: 46: Hoare triple {2137#false} havoc #t~post0; {2137#false} is VALID [2020-07-10 20:22:01,581 INFO L280 TraceCheckUtils]: 47: Hoare triple {2137#false} assume !!(~i~0 <= ~n~0); {2137#false} is VALID [2020-07-10 20:22:01,581 INFO L280 TraceCheckUtils]: 48: Hoare triple {2137#false} ~w~0 := 0.0; {2137#false} is VALID [2020-07-10 20:22:01,582 INFO L280 TraceCheckUtils]: 49: Hoare triple {2137#false} ~j~0 := 0; {2137#false} is VALID [2020-07-10 20:22:01,582 INFO L280 TraceCheckUtils]: 50: Hoare triple {2137#false} assume !!(~j~0 <= ~n~0); {2137#false} is VALID [2020-07-10 20:22:01,582 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-10 20:22:01,582 INFO L280 TraceCheckUtils]: 52: Hoare triple {2137#false} assume !(~i~0 == ~j~0); {2137#false} is VALID [2020-07-10 20:22:01,583 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-10 20:22:01,583 INFO L280 TraceCheckUtils]: 54: Hoare triple {2137#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {2137#false} is VALID [2020-07-10 20:22:01,583 INFO L280 TraceCheckUtils]: 55: Hoare triple {2137#false} havoc #t~mem3; {2137#false} is VALID [2020-07-10 20:22:01,583 INFO L280 TraceCheckUtils]: 56: Hoare triple {2137#false} #t~post1 := ~j~0; {2137#false} is VALID [2020-07-10 20:22:01,584 INFO L280 TraceCheckUtils]: 57: Hoare triple {2137#false} ~j~0 := 1 + #t~post1; {2137#false} is VALID [2020-07-10 20:22:01,584 INFO L280 TraceCheckUtils]: 58: Hoare triple {2137#false} havoc #t~post1; {2137#false} is VALID [2020-07-10 20:22:01,584 INFO L280 TraceCheckUtils]: 59: Hoare triple {2137#false} assume !(~j~0 <= ~n~0); {2137#false} is VALID [2020-07-10 20:22:01,584 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-10 20:22:01,585 INFO L280 TraceCheckUtils]: 61: Hoare triple {2137#false} ~cond := #in~cond; {2137#false} is VALID [2020-07-10 20:22:01,585 INFO L280 TraceCheckUtils]: 62: Hoare triple {2137#false} assume 0 == ~cond; {2137#false} is VALID [2020-07-10 20:22:01,585 INFO L280 TraceCheckUtils]: 63: Hoare triple {2137#false} assume !false; {2137#false} is VALID [2020-07-10 20:22:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:01,590 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:01,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408603532] [2020-07-10 20:22:01,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:01,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:22:01,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529747208] [2020-07-10 20:22:01,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2020-07-10 20:22:01,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:01,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:22:01,661 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-10 20:22:01,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:22:01,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:22:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:22:01,662 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 7 states. [2020-07-10 20:22:02,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:02,512 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2020-07-10 20:22:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:22:02,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2020-07-10 20:22:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2020-07-10 20:22:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2020-07-10 20:22:02,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 109 transitions. [2020-07-10 20:22:02,657 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-10 20:22:02,661 INFO L225 Difference]: With dead ends: 146 [2020-07-10 20:22:02,661 INFO L226 Difference]: Without dead ends: 114 [2020-07-10 20:22:02,662 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-10 20:22:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-10 20:22:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2020-07-10 20:22:02,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:02,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 94 states. [2020-07-10 20:22:02,938 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 94 states. [2020-07-10 20:22:02,939 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 94 states. [2020-07-10 20:22:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:02,944 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2020-07-10 20:22:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2020-07-10 20:22:02,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:02,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:02,945 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 114 states. [2020-07-10 20:22:02,945 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 114 states. [2020-07-10 20:22:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:02,949 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2020-07-10 20:22:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2020-07-10 20:22:02,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:02,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:02,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:02,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-10 20:22:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2020-07-10 20:22:02,954 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 64 [2020-07-10 20:22:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:02,955 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2020-07-10 20:22:02,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:22:02,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 99 transitions. [2020-07-10 20:22:03,113 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-10 20:22:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2020-07-10 20:22:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-10 20:22:03,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:03,115 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-10 20:22:03,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:22:03,116 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1491522468, now seen corresponding path program 2 times [2020-07-10 20:22:03,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:03,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67521068] [2020-07-10 20:22:03,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,369 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-10 20:22:03,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {2878#true} #valid := #valid[0 := 0]; {2878#true} is VALID [2020-07-10 20:22:03,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {2878#true} assume 0 < #StackHeapBarrier; {2878#true} is VALID [2020-07-10 20:22:03,370 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-10 20:22:03,371 INFO L280 TraceCheckUtils]: 4: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {2878#true} is VALID [2020-07-10 20:22:03,371 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-10 20:22:03,371 INFO L280 TraceCheckUtils]: 6: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {2878#true} is VALID [2020-07-10 20:22:03,372 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-10 20:22:03,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2878#true} is VALID [2020-07-10 20:22:03,372 INFO L280 TraceCheckUtils]: 9: Hoare triple {2878#true} assume true; {2878#true} is VALID [2020-07-10 20:22:03,373 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2878#true} {2878#true} #330#return; {2878#true} is VALID [2020-07-10 20:22:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2020-07-10 20:22:03,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2020-07-10 20:22:03,379 INFO L280 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2020-07-10 20:22:03,390 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2879#false} #334#return; {2879#false} is VALID [2020-07-10 20:22:03,392 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-10 20:22:03,393 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-10 20:22:03,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {2878#true} #valid := #valid[0 := 0]; {2878#true} is VALID [2020-07-10 20:22:03,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {2878#true} assume 0 < #StackHeapBarrier; {2878#true} is VALID [2020-07-10 20:22:03,393 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-10 20:22:03,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {2878#true} is VALID [2020-07-10 20:22:03,394 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-10 20:22:03,394 INFO L280 TraceCheckUtils]: 7: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {2878#true} is VALID [2020-07-10 20:22:03,394 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-10 20:22:03,395 INFO L280 TraceCheckUtils]: 9: Hoare triple {2878#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2878#true} is VALID [2020-07-10 20:22:03,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {2878#true} assume true; {2878#true} is VALID [2020-07-10 20:22:03,395 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2878#true} {2878#true} #330#return; {2878#true} is VALID [2020-07-10 20:22:03,395 INFO L263 TraceCheckUtils]: 12: Hoare triple {2878#true} call #t~ret33 := main(); {2878#true} is VALID [2020-07-10 20:22:03,396 INFO L280 TraceCheckUtils]: 13: Hoare triple {2878#true} havoc ~i~0; {2878#true} is VALID [2020-07-10 20:22:03,396 INFO L280 TraceCheckUtils]: 14: Hoare triple {2878#true} havoc ~j~0; {2878#true} is VALID [2020-07-10 20:22:03,396 INFO L280 TraceCheckUtils]: 15: Hoare triple {2878#true} ~nmax~0 := 50; {2878#true} is VALID [2020-07-10 20:22:03,398 INFO L280 TraceCheckUtils]: 16: Hoare triple {2878#true} ~n~0 := 5; {2891#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:03,398 INFO L280 TraceCheckUtils]: 17: Hoare triple {2891#(<= 5 main_~n~0)} havoc ~chkerr~0; {2891#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:03,399 INFO L280 TraceCheckUtils]: 18: Hoare triple {2891#(<= 5 main_~n~0)} havoc ~eps~0; {2891#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:03,400 INFO L280 TraceCheckUtils]: 19: Hoare triple {2891#(<= 5 main_~n~0)} havoc ~w~0; {2891#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:03,400 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-10 20:22:03,401 INFO L280 TraceCheckUtils]: 21: Hoare triple {2891#(<= 5 main_~n~0)} ~i~0 := 0; {2891#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:03,401 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-10 20:22:03,402 INFO L280 TraceCheckUtils]: 23: Hoare triple {2891#(<= 5 main_~n~0)} ~w~0 := 0.0; {2891#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:03,403 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-10 20:22:03,404 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-10 20:22:03,404 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-10 20:22:03,405 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-10 20:22:03,405 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-10 20:22:03,406 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-10 20:22:03,406 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-10 20:22:03,407 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-10 20:22:03,408 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-10 20:22:03,408 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-10 20:22:03,409 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-10 20:22:03,409 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-10 20:22:03,410 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-10 20:22:03,410 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-10 20:22:03,410 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-10 20:22:03,411 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-10 20:22:03,411 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-10 20:22:03,412 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-10 20:22:03,412 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-10 20:22:03,412 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-10 20:22:03,413 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-10 20:22:03,414 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-10 20:22:03,414 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-10 20:22:03,414 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-10 20:22:03,414 INFO L280 TraceCheckUtils]: 48: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2020-07-10 20:22:03,415 INFO L280 TraceCheckUtils]: 49: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2020-07-10 20:22:03,415 INFO L280 TraceCheckUtils]: 50: Hoare triple {2878#true} assume true; {2878#true} is VALID [2020-07-10 20:22:03,415 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2878#true} {2879#false} #334#return; {2879#false} is VALID [2020-07-10 20:22:03,415 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-10 20:22:03,416 INFO L280 TraceCheckUtils]: 53: Hoare triple {2879#false} #t~post0 := ~i~0; {2879#false} is VALID [2020-07-10 20:22:03,416 INFO L280 TraceCheckUtils]: 54: Hoare triple {2879#false} ~i~0 := 1 + #t~post0; {2879#false} is VALID [2020-07-10 20:22:03,416 INFO L280 TraceCheckUtils]: 55: Hoare triple {2879#false} havoc #t~post0; {2879#false} is VALID [2020-07-10 20:22:03,416 INFO L280 TraceCheckUtils]: 56: Hoare triple {2879#false} assume !!(~i~0 <= ~n~0); {2879#false} is VALID [2020-07-10 20:22:03,416 INFO L280 TraceCheckUtils]: 57: Hoare triple {2879#false} ~w~0 := 0.0; {2879#false} is VALID [2020-07-10 20:22:03,417 INFO L280 TraceCheckUtils]: 58: Hoare triple {2879#false} ~j~0 := 0; {2879#false} is VALID [2020-07-10 20:22:03,417 INFO L280 TraceCheckUtils]: 59: Hoare triple {2879#false} assume !!(~j~0 <= ~n~0); {2879#false} is VALID [2020-07-10 20:22:03,417 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-10 20:22:03,417 INFO L280 TraceCheckUtils]: 61: Hoare triple {2879#false} assume !(~i~0 == ~j~0); {2879#false} is VALID [2020-07-10 20:22:03,418 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-10 20:22:03,418 INFO L280 TraceCheckUtils]: 63: Hoare triple {2879#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {2879#false} is VALID [2020-07-10 20:22:03,418 INFO L280 TraceCheckUtils]: 64: Hoare triple {2879#false} havoc #t~mem3; {2879#false} is VALID [2020-07-10 20:22:03,418 INFO L280 TraceCheckUtils]: 65: Hoare triple {2879#false} #t~post1 := ~j~0; {2879#false} is VALID [2020-07-10 20:22:03,418 INFO L280 TraceCheckUtils]: 66: Hoare triple {2879#false} ~j~0 := 1 + #t~post1; {2879#false} is VALID [2020-07-10 20:22:03,418 INFO L280 TraceCheckUtils]: 67: Hoare triple {2879#false} havoc #t~post1; {2879#false} is VALID [2020-07-10 20:22:03,419 INFO L280 TraceCheckUtils]: 68: Hoare triple {2879#false} assume !!(~j~0 <= ~n~0); {2879#false} is VALID [2020-07-10 20:22:03,419 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-10 20:22:03,419 INFO L280 TraceCheckUtils]: 70: Hoare triple {2879#false} assume !(~i~0 == ~j~0); {2879#false} is VALID [2020-07-10 20:22:03,419 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-10 20:22:03,419 INFO L280 TraceCheckUtils]: 72: Hoare triple {2879#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {2879#false} is VALID [2020-07-10 20:22:03,419 INFO L280 TraceCheckUtils]: 73: Hoare triple {2879#false} havoc #t~mem3; {2879#false} is VALID [2020-07-10 20:22:03,420 INFO L280 TraceCheckUtils]: 74: Hoare triple {2879#false} #t~post1 := ~j~0; {2879#false} is VALID [2020-07-10 20:22:03,420 INFO L280 TraceCheckUtils]: 75: Hoare triple {2879#false} ~j~0 := 1 + #t~post1; {2879#false} is VALID [2020-07-10 20:22:03,420 INFO L280 TraceCheckUtils]: 76: Hoare triple {2879#false} havoc #t~post1; {2879#false} is VALID [2020-07-10 20:22:03,420 INFO L280 TraceCheckUtils]: 77: Hoare triple {2879#false} assume !(~j~0 <= ~n~0); {2879#false} is VALID [2020-07-10 20:22:03,420 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-10 20:22:03,420 INFO L280 TraceCheckUtils]: 79: Hoare triple {2879#false} ~cond := #in~cond; {2879#false} is VALID [2020-07-10 20:22:03,421 INFO L280 TraceCheckUtils]: 80: Hoare triple {2879#false} assume 0 == ~cond; {2879#false} is VALID [2020-07-10 20:22:03,421 INFO L280 TraceCheckUtils]: 81: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2020-07-10 20:22:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:03,428 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:03,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67521068] [2020-07-10 20:22:03,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:03,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:22:03,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592734451] [2020-07-10 20:22:03,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2020-07-10 20:22:03,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:03,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:22:03,516 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-10 20:22:03,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:22:03,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:22:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:22:03,517 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 9 states. [2020-07-10 20:22:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:04,639 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2020-07-10 20:22:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 20:22:04,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2020-07-10 20:22:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:22:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2020-07-10 20:22:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:22:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2020-07-10 20:22:04,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 122 transitions. [2020-07-10 20:22:04,802 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-10 20:22:04,806 INFO L225 Difference]: With dead ends: 182 [2020-07-10 20:22:04,806 INFO L226 Difference]: Without dead ends: 138 [2020-07-10 20:22:04,807 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-10 20:22:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-10 20:22:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2020-07-10 20:22:05,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:05,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 118 states. [2020-07-10 20:22:05,177 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 118 states. [2020-07-10 20:22:05,177 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 118 states. [2020-07-10 20:22:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,182 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2020-07-10 20:22:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2020-07-10 20:22:05,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:05,182 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 138 states. [2020-07-10 20:22:05,183 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 138 states. [2020-07-10 20:22:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,187 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2020-07-10 20:22:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2020-07-10 20:22:05,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:05,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:05,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-07-10 20:22:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2020-07-10 20:22:05,191 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 82 [2020-07-10 20:22:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:05,191 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2020-07-10 20:22:05,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:22:05,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 118 states and 125 transitions. [2020-07-10 20:22:05,398 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-10 20:22:05,398 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2020-07-10 20:22:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-07-10 20:22:05,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:05,400 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-10 20:22:05,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:22:05,400 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:05,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:05,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2108507974, now seen corresponding path program 3 times [2020-07-10 20:22:05,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:05,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [539955318] [2020-07-10 20:22:05,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:05,656 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-10 20:22:05,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {3796#true} #valid := #valid[0 := 0]; {3796#true} is VALID [2020-07-10 20:22:05,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {3796#true} assume 0 < #StackHeapBarrier; {3796#true} is VALID [2020-07-10 20:22:05,658 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-10 20:22:05,658 INFO L280 TraceCheckUtils]: 4: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {3796#true} is VALID [2020-07-10 20:22:05,658 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-10 20:22:05,659 INFO L280 TraceCheckUtils]: 6: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {3796#true} is VALID [2020-07-10 20:22:05,659 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-10 20:22:05,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {3796#true} is VALID [2020-07-10 20:22:05,659 INFO L280 TraceCheckUtils]: 9: Hoare triple {3796#true} assume true; {3796#true} is VALID [2020-07-10 20:22:05,660 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3796#true} {3796#true} #330#return; {3796#true} is VALID [2020-07-10 20:22:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:05,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {3796#true} ~cond := #in~cond; {3796#true} is VALID [2020-07-10 20:22:05,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {3796#true} assume !(0 == ~cond); {3796#true} is VALID [2020-07-10 20:22:05,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {3796#true} assume true; {3796#true} is VALID [2020-07-10 20:22:05,665 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3796#true} {3797#false} #334#return; {3797#false} is VALID [2020-07-10 20:22:05,667 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-10 20:22:05,667 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-10 20:22:05,668 INFO L280 TraceCheckUtils]: 2: Hoare triple {3796#true} #valid := #valid[0 := 0]; {3796#true} is VALID [2020-07-10 20:22:05,668 INFO L280 TraceCheckUtils]: 3: Hoare triple {3796#true} assume 0 < #StackHeapBarrier; {3796#true} is VALID [2020-07-10 20:22:05,668 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-10 20:22:05,669 INFO L280 TraceCheckUtils]: 5: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {3796#true} is VALID [2020-07-10 20:22:05,669 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-10 20:22:05,669 INFO L280 TraceCheckUtils]: 7: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {3796#true} is VALID [2020-07-10 20:22:05,670 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-10 20:22:05,670 INFO L280 TraceCheckUtils]: 9: Hoare triple {3796#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {3796#true} is VALID [2020-07-10 20:22:05,670 INFO L280 TraceCheckUtils]: 10: Hoare triple {3796#true} assume true; {3796#true} is VALID [2020-07-10 20:22:05,670 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3796#true} {3796#true} #330#return; {3796#true} is VALID [2020-07-10 20:22:05,671 INFO L263 TraceCheckUtils]: 12: Hoare triple {3796#true} call #t~ret33 := main(); {3796#true} is VALID [2020-07-10 20:22:05,671 INFO L280 TraceCheckUtils]: 13: Hoare triple {3796#true} havoc ~i~0; {3796#true} is VALID [2020-07-10 20:22:05,671 INFO L280 TraceCheckUtils]: 14: Hoare triple {3796#true} havoc ~j~0; {3796#true} is VALID [2020-07-10 20:22:05,671 INFO L280 TraceCheckUtils]: 15: Hoare triple {3796#true} ~nmax~0 := 50; {3796#true} is VALID [2020-07-10 20:22:05,672 INFO L280 TraceCheckUtils]: 16: Hoare triple {3796#true} ~n~0 := 5; {3809#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:05,673 INFO L280 TraceCheckUtils]: 17: Hoare triple {3809#(<= 5 main_~n~0)} havoc ~chkerr~0; {3809#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:05,674 INFO L280 TraceCheckUtils]: 18: Hoare triple {3809#(<= 5 main_~n~0)} havoc ~eps~0; {3809#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:05,674 INFO L280 TraceCheckUtils]: 19: Hoare triple {3809#(<= 5 main_~n~0)} havoc ~w~0; {3809#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:05,675 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-10 20:22:05,675 INFO L280 TraceCheckUtils]: 21: Hoare triple {3809#(<= 5 main_~n~0)} ~i~0 := 0; {3809#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:05,676 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-10 20:22:05,677 INFO L280 TraceCheckUtils]: 23: Hoare triple {3809#(<= 5 main_~n~0)} ~w~0 := 0.0; {3809#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:05,677 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-10 20:22:05,678 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-10 20:22:05,679 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-10 20:22:05,680 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-10 20:22:05,681 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-10 20:22:05,682 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-10 20:22:05,682 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-10 20:22:05,683 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-10 20:22:05,684 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-10 20:22:05,685 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-10 20:22:05,685 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-10 20:22:05,686 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-10 20:22:05,687 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-10 20:22:05,688 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-10 20:22:05,688 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-10 20:22:05,689 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-10 20:22:05,690 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-10 20:22:05,691 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-10 20:22:05,691 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-10 20:22:05,692 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-10 20:22:05,693 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-10 20:22:05,694 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-10 20:22:05,694 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-10 20:22:05,695 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-10 20:22:05,701 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-10 20:22:05,702 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-10 20:22:05,702 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-10 20:22:05,703 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-10 20:22:05,704 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-10 20:22:05,705 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-10 20:22:05,706 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-10 20:22:05,706 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-10 20:22:05,707 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-10 20:22:05,707 INFO L280 TraceCheckUtils]: 57: Hoare triple {3796#true} ~cond := #in~cond; {3796#true} is VALID [2020-07-10 20:22:05,707 INFO L280 TraceCheckUtils]: 58: Hoare triple {3796#true} assume !(0 == ~cond); {3796#true} is VALID [2020-07-10 20:22:05,708 INFO L280 TraceCheckUtils]: 59: Hoare triple {3796#true} assume true; {3796#true} is VALID [2020-07-10 20:22:05,708 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3796#true} {3797#false} #334#return; {3797#false} is VALID [2020-07-10 20:22:05,708 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-10 20:22:05,708 INFO L280 TraceCheckUtils]: 62: Hoare triple {3797#false} #t~post0 := ~i~0; {3797#false} is VALID [2020-07-10 20:22:05,709 INFO L280 TraceCheckUtils]: 63: Hoare triple {3797#false} ~i~0 := 1 + #t~post0; {3797#false} is VALID [2020-07-10 20:22:05,709 INFO L280 TraceCheckUtils]: 64: Hoare triple {3797#false} havoc #t~post0; {3797#false} is VALID [2020-07-10 20:22:05,709 INFO L280 TraceCheckUtils]: 65: Hoare triple {3797#false} assume !!(~i~0 <= ~n~0); {3797#false} is VALID [2020-07-10 20:22:05,709 INFO L280 TraceCheckUtils]: 66: Hoare triple {3797#false} ~w~0 := 0.0; {3797#false} is VALID [2020-07-10 20:22:05,710 INFO L280 TraceCheckUtils]: 67: Hoare triple {3797#false} ~j~0 := 0; {3797#false} is VALID [2020-07-10 20:22:05,710 INFO L280 TraceCheckUtils]: 68: Hoare triple {3797#false} assume !!(~j~0 <= ~n~0); {3797#false} is VALID [2020-07-10 20:22:05,710 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-10 20:22:05,710 INFO L280 TraceCheckUtils]: 70: Hoare triple {3797#false} assume !(~i~0 == ~j~0); {3797#false} is VALID [2020-07-10 20:22:05,711 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-10 20:22:05,711 INFO L280 TraceCheckUtils]: 72: Hoare triple {3797#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {3797#false} is VALID [2020-07-10 20:22:05,711 INFO L280 TraceCheckUtils]: 73: Hoare triple {3797#false} havoc #t~mem3; {3797#false} is VALID [2020-07-10 20:22:05,711 INFO L280 TraceCheckUtils]: 74: Hoare triple {3797#false} #t~post1 := ~j~0; {3797#false} is VALID [2020-07-10 20:22:05,712 INFO L280 TraceCheckUtils]: 75: Hoare triple {3797#false} ~j~0 := 1 + #t~post1; {3797#false} is VALID [2020-07-10 20:22:05,712 INFO L280 TraceCheckUtils]: 76: Hoare triple {3797#false} havoc #t~post1; {3797#false} is VALID [2020-07-10 20:22:05,712 INFO L280 TraceCheckUtils]: 77: Hoare triple {3797#false} assume !!(~j~0 <= ~n~0); {3797#false} is VALID [2020-07-10 20:22:05,712 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-10 20:22:05,713 INFO L280 TraceCheckUtils]: 79: Hoare triple {3797#false} assume !(~i~0 == ~j~0); {3797#false} is VALID [2020-07-10 20:22:05,713 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-10 20:22:05,713 INFO L280 TraceCheckUtils]: 81: Hoare triple {3797#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {3797#false} is VALID [2020-07-10 20:22:05,713 INFO L280 TraceCheckUtils]: 82: Hoare triple {3797#false} havoc #t~mem3; {3797#false} is VALID [2020-07-10 20:22:05,713 INFO L280 TraceCheckUtils]: 83: Hoare triple {3797#false} #t~post1 := ~j~0; {3797#false} is VALID [2020-07-10 20:22:05,714 INFO L280 TraceCheckUtils]: 84: Hoare triple {3797#false} ~j~0 := 1 + #t~post1; {3797#false} is VALID [2020-07-10 20:22:05,714 INFO L280 TraceCheckUtils]: 85: Hoare triple {3797#false} havoc #t~post1; {3797#false} is VALID [2020-07-10 20:22:05,714 INFO L280 TraceCheckUtils]: 86: Hoare triple {3797#false} assume !!(~j~0 <= ~n~0); {3797#false} is VALID [2020-07-10 20:22:05,714 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-10 20:22:05,714 INFO L280 TraceCheckUtils]: 88: Hoare triple {3797#false} assume !(~i~0 == ~j~0); {3797#false} is VALID [2020-07-10 20:22:05,715 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-10 20:22:05,715 INFO L280 TraceCheckUtils]: 90: Hoare triple {3797#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {3797#false} is VALID [2020-07-10 20:22:05,715 INFO L280 TraceCheckUtils]: 91: Hoare triple {3797#false} havoc #t~mem3; {3797#false} is VALID [2020-07-10 20:22:05,715 INFO L280 TraceCheckUtils]: 92: Hoare triple {3797#false} #t~post1 := ~j~0; {3797#false} is VALID [2020-07-10 20:22:05,715 INFO L280 TraceCheckUtils]: 93: Hoare triple {3797#false} ~j~0 := 1 + #t~post1; {3797#false} is VALID [2020-07-10 20:22:05,716 INFO L280 TraceCheckUtils]: 94: Hoare triple {3797#false} havoc #t~post1; {3797#false} is VALID [2020-07-10 20:22:05,716 INFO L280 TraceCheckUtils]: 95: Hoare triple {3797#false} assume !(~j~0 <= ~n~0); {3797#false} is VALID [2020-07-10 20:22:05,716 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-10 20:22:05,716 INFO L280 TraceCheckUtils]: 97: Hoare triple {3797#false} ~cond := #in~cond; {3797#false} is VALID [2020-07-10 20:22:05,716 INFO L280 TraceCheckUtils]: 98: Hoare triple {3797#false} assume 0 == ~cond; {3797#false} is VALID [2020-07-10 20:22:05,717 INFO L280 TraceCheckUtils]: 99: Hoare triple {3797#false} assume !false; {3797#false} is VALID [2020-07-10 20:22:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:05,739 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:05,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [539955318] [2020-07-10 20:22:05,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:05,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:22:05,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235850611] [2020-07-10 20:22:05,740 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2020-07-10 20:22:05,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:05,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:22:05,830 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-10 20:22:05,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:22:05,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:05,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:22:05,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:22:05,831 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 11 states. [2020-07-10 20:22:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,495 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2020-07-10 20:22:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 20:22:07,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2020-07-10 20:22:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:22:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2020-07-10 20:22:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:22:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2020-07-10 20:22:07,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 135 transitions. [2020-07-10 20:22:07,662 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-10 20:22:07,666 INFO L225 Difference]: With dead ends: 218 [2020-07-10 20:22:07,666 INFO L226 Difference]: Without dead ends: 162 [2020-07-10 20:22:07,667 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-10 20:22:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-10 20:22:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2020-07-10 20:22:08,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:08,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 142 states. [2020-07-10 20:22:08,071 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 142 states. [2020-07-10 20:22:08,071 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 142 states. [2020-07-10 20:22:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:08,078 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2020-07-10 20:22:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2020-07-10 20:22:08,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:08,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:08,078 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 162 states. [2020-07-10 20:22:08,079 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 162 states. [2020-07-10 20:22:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:08,084 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2020-07-10 20:22:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2020-07-10 20:22:08,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:08,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:08,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:08,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-10 20:22:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2020-07-10 20:22:08,090 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 100 [2020-07-10 20:22:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:08,090 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2020-07-10 20:22:08,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:22:08,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 151 transitions. [2020-07-10 20:22:08,340 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-10 20:22:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2020-07-10 20:22:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-07-10 20:22:08,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:08,343 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-10 20:22:08,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:22:08,343 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1471539684, now seen corresponding path program 4 times [2020-07-10 20:22:08,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:08,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [394614440] [2020-07-10 20:22:08,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:08,697 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-10 20:22:08,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {4890#true} #valid := #valid[0 := 0]; {4890#true} is VALID [2020-07-10 20:22:08,698 INFO L280 TraceCheckUtils]: 2: Hoare triple {4890#true} assume 0 < #StackHeapBarrier; {4890#true} is VALID [2020-07-10 20:22:08,698 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-10 20:22:08,698 INFO L280 TraceCheckUtils]: 4: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {4890#true} is VALID [2020-07-10 20:22:08,699 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-10 20:22:08,699 INFO L280 TraceCheckUtils]: 6: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {4890#true} is VALID [2020-07-10 20:22:08,699 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-10 20:22:08,699 INFO L280 TraceCheckUtils]: 8: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {4890#true} is VALID [2020-07-10 20:22:08,700 INFO L280 TraceCheckUtils]: 9: Hoare triple {4890#true} assume true; {4890#true} is VALID [2020-07-10 20:22:08,700 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {4890#true} {4890#true} #330#return; {4890#true} is VALID [2020-07-10 20:22:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:08,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2020-07-10 20:22:08,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2020-07-10 20:22:08,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {4890#true} assume true; {4890#true} is VALID [2020-07-10 20:22:08,709 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4890#true} {4903#(= 0 main_~i~0)} #334#return; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,711 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-10 20:22:08,711 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-10 20:22:08,711 INFO L280 TraceCheckUtils]: 2: Hoare triple {4890#true} #valid := #valid[0 := 0]; {4890#true} is VALID [2020-07-10 20:22:08,711 INFO L280 TraceCheckUtils]: 3: Hoare triple {4890#true} assume 0 < #StackHeapBarrier; {4890#true} is VALID [2020-07-10 20:22:08,712 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-10 20:22:08,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {4890#true} is VALID [2020-07-10 20:22:08,712 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-10 20:22:08,712 INFO L280 TraceCheckUtils]: 7: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {4890#true} is VALID [2020-07-10 20:22:08,712 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-10 20:22:08,713 INFO L280 TraceCheckUtils]: 9: Hoare triple {4890#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {4890#true} is VALID [2020-07-10 20:22:08,713 INFO L280 TraceCheckUtils]: 10: Hoare triple {4890#true} assume true; {4890#true} is VALID [2020-07-10 20:22:08,713 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {4890#true} {4890#true} #330#return; {4890#true} is VALID [2020-07-10 20:22:08,713 INFO L263 TraceCheckUtils]: 12: Hoare triple {4890#true} call #t~ret33 := main(); {4890#true} is VALID [2020-07-10 20:22:08,713 INFO L280 TraceCheckUtils]: 13: Hoare triple {4890#true} havoc ~i~0; {4890#true} is VALID [2020-07-10 20:22:08,714 INFO L280 TraceCheckUtils]: 14: Hoare triple {4890#true} havoc ~j~0; {4890#true} is VALID [2020-07-10 20:22:08,714 INFO L280 TraceCheckUtils]: 15: Hoare triple {4890#true} ~nmax~0 := 50; {4890#true} is VALID [2020-07-10 20:22:08,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {4890#true} ~n~0 := 5; {4890#true} is VALID [2020-07-10 20:22:08,714 INFO L280 TraceCheckUtils]: 17: Hoare triple {4890#true} havoc ~chkerr~0; {4890#true} is VALID [2020-07-10 20:22:08,714 INFO L280 TraceCheckUtils]: 18: Hoare triple {4890#true} havoc ~eps~0; {4890#true} is VALID [2020-07-10 20:22:08,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {4890#true} havoc ~w~0; {4890#true} is VALID [2020-07-10 20:22:08,715 INFO L280 TraceCheckUtils]: 20: Hoare triple {4890#true} ~eps~0 := 1.0E-6; {4890#true} is VALID [2020-07-10 20:22:08,716 INFO L280 TraceCheckUtils]: 21: Hoare triple {4890#true} ~i~0 := 0; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,716 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-10 20:22:08,717 INFO L280 TraceCheckUtils]: 23: Hoare triple {4903#(= 0 main_~i~0)} ~w~0 := 0.0; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {4903#(= 0 main_~i~0)} ~j~0 := 0; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,718 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-10 20:22:08,718 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-10 20:22:08,719 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-10 20:22:08,720 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-10 20:22:08,720 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-10 20:22:08,721 INFO L280 TraceCheckUtils]: 30: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~mem2; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,721 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-10 20:22:08,722 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-10 20:22:08,722 INFO L280 TraceCheckUtils]: 33: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~mem3; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,723 INFO L280 TraceCheckUtils]: 34: Hoare triple {4903#(= 0 main_~i~0)} #t~post1 := ~j~0; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,723 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-10 20:22:08,724 INFO L280 TraceCheckUtils]: 36: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,724 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-10 20:22:08,725 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-10 20:22:08,725 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-10 20:22:08,726 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-10 20:22:08,726 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-10 20:22:08,727 INFO L280 TraceCheckUtils]: 42: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~mem3; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,727 INFO L280 TraceCheckUtils]: 43: Hoare triple {4903#(= 0 main_~i~0)} #t~post1 := ~j~0; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,728 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-10 20:22:08,729 INFO L280 TraceCheckUtils]: 45: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,729 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-10 20:22:08,730 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-10 20:22:08,731 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-10 20:22:08,731 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-10 20:22:08,732 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-10 20:22:08,733 INFO L280 TraceCheckUtils]: 51: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~mem3; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,733 INFO L280 TraceCheckUtils]: 52: Hoare triple {4903#(= 0 main_~i~0)} #t~post1 := ~j~0; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,734 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-10 20:22:08,735 INFO L280 TraceCheckUtils]: 54: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,735 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-10 20:22:08,736 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-10 20:22:08,737 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-10 20:22:08,737 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-10 20:22:08,738 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-10 20:22:08,741 INFO L280 TraceCheckUtils]: 60: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~mem3; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,743 INFO L280 TraceCheckUtils]: 61: Hoare triple {4903#(= 0 main_~i~0)} #t~post1 := ~j~0; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,764 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-10 20:22:08,766 INFO L280 TraceCheckUtils]: 63: Hoare triple {4903#(= 0 main_~i~0)} havoc #t~post1; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,766 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-10 20:22:08,767 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-10 20:22:08,767 INFO L280 TraceCheckUtils]: 66: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2020-07-10 20:22:08,767 INFO L280 TraceCheckUtils]: 67: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2020-07-10 20:22:08,768 INFO L280 TraceCheckUtils]: 68: Hoare triple {4890#true} assume true; {4890#true} is VALID [2020-07-10 20:22:08,768 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4890#true} {4903#(= 0 main_~i~0)} #334#return; {4903#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:08,769 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-10 20:22:08,771 INFO L280 TraceCheckUtils]: 71: Hoare triple {4903#(= 0 main_~i~0)} #t~post0 := ~i~0; {4908#(= |main_#t~post0| 0)} is VALID [2020-07-10 20:22:08,771 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-10 20:22:08,772 INFO L280 TraceCheckUtils]: 73: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~post0; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,772 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-10 20:22:08,773 INFO L280 TraceCheckUtils]: 75: Hoare triple {4909#(<= main_~i~0 1)} ~w~0 := 0.0; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,773 INFO L280 TraceCheckUtils]: 76: Hoare triple {4909#(<= main_~i~0 1)} ~j~0 := 0; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,774 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-10 20:22:08,775 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-10 20:22:08,776 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-10 20:22:08,776 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-10 20:22:08,777 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-10 20:22:08,778 INFO L280 TraceCheckUtils]: 82: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~mem3; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,778 INFO L280 TraceCheckUtils]: 83: Hoare triple {4909#(<= main_~i~0 1)} #t~post1 := ~j~0; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,779 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-10 20:22:08,780 INFO L280 TraceCheckUtils]: 85: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,780 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-10 20:22:08,781 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-10 20:22:08,782 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-10 20:22:08,783 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-10 20:22:08,783 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-10 20:22:08,784 INFO L280 TraceCheckUtils]: 91: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~mem3; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,785 INFO L280 TraceCheckUtils]: 92: Hoare triple {4909#(<= main_~i~0 1)} #t~post1 := ~j~0; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,785 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-10 20:22:08,786 INFO L280 TraceCheckUtils]: 94: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,787 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-10 20:22:08,788 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-10 20:22:08,789 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-10 20:22:08,789 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-10 20:22:08,790 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-10 20:22:08,790 INFO L280 TraceCheckUtils]: 100: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~mem3; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,791 INFO L280 TraceCheckUtils]: 101: Hoare triple {4909#(<= main_~i~0 1)} #t~post1 := ~j~0; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,791 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-10 20:22:08,792 INFO L280 TraceCheckUtils]: 103: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,792 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-10 20:22:08,793 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-10 20:22:08,793 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-10 20:22:08,794 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-10 20:22:08,794 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-10 20:22:08,795 INFO L280 TraceCheckUtils]: 109: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~mem3; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,795 INFO L280 TraceCheckUtils]: 110: Hoare triple {4909#(<= main_~i~0 1)} #t~post1 := ~j~0; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,796 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-10 20:22:08,796 INFO L280 TraceCheckUtils]: 112: Hoare triple {4909#(<= main_~i~0 1)} havoc #t~post1; {4909#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:08,797 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-10 20:22:08,798 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-10 20:22:08,799 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-10 20:22:08,799 INFO L280 TraceCheckUtils]: 116: Hoare triple {4911#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4891#false} is VALID [2020-07-10 20:22:08,800 INFO L280 TraceCheckUtils]: 117: Hoare triple {4891#false} assume !false; {4891#false} is VALID [2020-07-10 20:22:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:08,819 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:08,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [394614440] [2020-07-10 20:22:08,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:08,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:22:08,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259610034] [2020-07-10 20:22:08,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 118 [2020-07-10 20:22:08,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:08,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:22:08,895 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-10 20:22:08,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:22:08,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:08,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:22:08,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:22:08,897 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 8 states. [2020-07-10 20:22:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:10,268 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2020-07-10 20:22:10,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 20:22:10,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 118 [2020-07-10 20:22:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:22:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2020-07-10 20:22:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:22:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2020-07-10 20:22:10,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 102 transitions. [2020-07-10 20:22:10,404 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-10 20:22:10,410 INFO L225 Difference]: With dead ends: 208 [2020-07-10 20:22:10,410 INFO L226 Difference]: Without dead ends: 206 [2020-07-10 20:22:10,411 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-10 20:22:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-10 20:22:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2020-07-10 20:22:11,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:11,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 203 states. [2020-07-10 20:22:11,051 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 203 states. [2020-07-10 20:22:11,051 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 203 states. [2020-07-10 20:22:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:11,058 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2020-07-10 20:22:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 220 transitions. [2020-07-10 20:22:11,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:11,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:11,059 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 206 states. [2020-07-10 20:22:11,059 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 206 states. [2020-07-10 20:22:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:11,066 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2020-07-10 20:22:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 220 transitions. [2020-07-10 20:22:11,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:11,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:11,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:11,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-07-10 20:22:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 217 transitions. [2020-07-10 20:22:11,074 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 217 transitions. Word has length 118 [2020-07-10 20:22:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:11,074 INFO L479 AbstractCegarLoop]: Abstraction has 203 states and 217 transitions. [2020-07-10 20:22:11,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:22:11,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 203 states and 217 transitions. [2020-07-10 20:22:11,482 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-10 20:22:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 217 transitions. [2020-07-10 20:22:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-07-10 20:22:11,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:11,485 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-10 20:22:11,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:22:11,485 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:11,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2112155237, now seen corresponding path program 5 times [2020-07-10 20:22:11,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:11,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1388300000] [2020-07-10 20:22:11,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:11,762 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-10 20:22:11,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {6162#true} #valid := #valid[0 := 0]; {6162#true} is VALID [2020-07-10 20:22:11,762 INFO L280 TraceCheckUtils]: 2: Hoare triple {6162#true} assume 0 < #StackHeapBarrier; {6162#true} is VALID [2020-07-10 20:22:11,762 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-10 20:22:11,763 INFO L280 TraceCheckUtils]: 4: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {6162#true} is VALID [2020-07-10 20:22:11,763 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-10 20:22:11,763 INFO L280 TraceCheckUtils]: 6: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {6162#true} is VALID [2020-07-10 20:22:11,763 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-10 20:22:11,764 INFO L280 TraceCheckUtils]: 8: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {6162#true} is VALID [2020-07-10 20:22:11,764 INFO L280 TraceCheckUtils]: 9: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-10 20:22:11,764 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {6162#true} {6162#true} #330#return; {6162#true} is VALID [2020-07-10 20:22:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:11,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {6162#true} ~cond := #in~cond; {6162#true} is VALID [2020-07-10 20:22:11,772 INFO L280 TraceCheckUtils]: 1: Hoare triple {6162#true} assume !(0 == ~cond); {6162#true} is VALID [2020-07-10 20:22:11,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-10 20:22:11,773 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6162#true} {6163#false} #334#return; {6163#false} is VALID [2020-07-10 20:22:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:11,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {6162#true} ~cond := #in~cond; {6162#true} is VALID [2020-07-10 20:22:11,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {6162#true} assume !(0 == ~cond); {6162#true} is VALID [2020-07-10 20:22:11,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-10 20:22:11,778 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6162#true} {6163#false} #334#return; {6163#false} is VALID [2020-07-10 20:22:11,780 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-10 20:22:11,780 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-10 20:22:11,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {6162#true} #valid := #valid[0 := 0]; {6162#true} is VALID [2020-07-10 20:22:11,781 INFO L280 TraceCheckUtils]: 3: Hoare triple {6162#true} assume 0 < #StackHeapBarrier; {6162#true} is VALID [2020-07-10 20:22:11,781 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-10 20:22:11,781 INFO L280 TraceCheckUtils]: 5: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {6162#true} is VALID [2020-07-10 20:22:11,782 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-10 20:22:11,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {6162#true} is VALID [2020-07-10 20:22:11,782 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-10 20:22:11,783 INFO L280 TraceCheckUtils]: 9: Hoare triple {6162#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {6162#true} is VALID [2020-07-10 20:22:11,783 INFO L280 TraceCheckUtils]: 10: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-10 20:22:11,783 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {6162#true} {6162#true} #330#return; {6162#true} is VALID [2020-07-10 20:22:11,783 INFO L263 TraceCheckUtils]: 12: Hoare triple {6162#true} call #t~ret33 := main(); {6162#true} is VALID [2020-07-10 20:22:11,784 INFO L280 TraceCheckUtils]: 13: Hoare triple {6162#true} havoc ~i~0; {6162#true} is VALID [2020-07-10 20:22:11,784 INFO L280 TraceCheckUtils]: 14: Hoare triple {6162#true} havoc ~j~0; {6162#true} is VALID [2020-07-10 20:22:11,784 INFO L280 TraceCheckUtils]: 15: Hoare triple {6162#true} ~nmax~0 := 50; {6162#true} is VALID [2020-07-10 20:22:11,785 INFO L280 TraceCheckUtils]: 16: Hoare triple {6162#true} ~n~0 := 5; {6175#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:11,786 INFO L280 TraceCheckUtils]: 17: Hoare triple {6175#(<= 5 main_~n~0)} havoc ~chkerr~0; {6175#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:11,787 INFO L280 TraceCheckUtils]: 18: Hoare triple {6175#(<= 5 main_~n~0)} havoc ~eps~0; {6175#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:11,788 INFO L280 TraceCheckUtils]: 19: Hoare triple {6175#(<= 5 main_~n~0)} havoc ~w~0; {6175#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:11,788 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-10 20:22:11,789 INFO L280 TraceCheckUtils]: 21: Hoare triple {6175#(<= 5 main_~n~0)} ~i~0 := 0; {6175#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:11,789 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-10 20:22:11,790 INFO L280 TraceCheckUtils]: 23: Hoare triple {6175#(<= 5 main_~n~0)} ~w~0 := 0.0; {6175#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:11,791 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-10 20:22:11,791 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-10 20:22:11,794 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-10 20:22:11,795 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-10 20:22:11,796 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-10 20:22:11,797 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-10 20:22:11,797 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-10 20:22:11,798 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-10 20:22:11,799 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-10 20:22:11,800 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-10 20:22:11,800 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-10 20:22:11,801 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-10 20:22:11,802 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-10 20:22:11,802 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-10 20:22:11,803 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-10 20:22:11,803 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-10 20:22:11,804 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-10 20:22:11,804 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-10 20:22:11,805 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-10 20:22:11,806 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-10 20:22:11,807 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-10 20:22:11,807 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-10 20:22:11,808 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-10 20:22:11,808 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-10 20:22:11,809 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-10 20:22:11,809 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-10 20:22:11,810 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-10 20:22:11,810 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-10 20:22:11,813 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-10 20:22:11,814 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-10 20:22:11,815 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-10 20:22:11,816 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-10 20:22:11,817 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-10 20:22:11,817 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-10 20:22:11,818 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-10 20:22:11,819 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-10 20:22:11,819 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-10 20:22:11,820 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-10 20:22:11,822 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-10 20:22:11,822 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-10 20:22:11,823 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-10 20:22:11,824 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-10 20:22:11,824 INFO L280 TraceCheckUtils]: 66: Hoare triple {6162#true} ~cond := #in~cond; {6162#true} is VALID [2020-07-10 20:22:11,824 INFO L280 TraceCheckUtils]: 67: Hoare triple {6162#true} assume !(0 == ~cond); {6162#true} is VALID [2020-07-10 20:22:11,824 INFO L280 TraceCheckUtils]: 68: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-10 20:22:11,825 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {6162#true} {6163#false} #334#return; {6163#false} is VALID [2020-07-10 20:22:11,825 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-10 20:22:11,825 INFO L280 TraceCheckUtils]: 71: Hoare triple {6163#false} #t~post0 := ~i~0; {6163#false} is VALID [2020-07-10 20:22:11,826 INFO L280 TraceCheckUtils]: 72: Hoare triple {6163#false} ~i~0 := 1 + #t~post0; {6163#false} is VALID [2020-07-10 20:22:11,826 INFO L280 TraceCheckUtils]: 73: Hoare triple {6163#false} havoc #t~post0; {6163#false} is VALID [2020-07-10 20:22:11,827 INFO L280 TraceCheckUtils]: 74: Hoare triple {6163#false} assume !!(~i~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,827 INFO L280 TraceCheckUtils]: 75: Hoare triple {6163#false} ~w~0 := 0.0; {6163#false} is VALID [2020-07-10 20:22:11,827 INFO L280 TraceCheckUtils]: 76: Hoare triple {6163#false} ~j~0 := 0; {6163#false} is VALID [2020-07-10 20:22:11,828 INFO L280 TraceCheckUtils]: 77: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,828 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-10 20:22:11,828 INFO L280 TraceCheckUtils]: 79: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-10 20:22:11,828 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-10 20:22:11,829 INFO L280 TraceCheckUtils]: 81: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-10 20:22:11,829 INFO L280 TraceCheckUtils]: 82: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-10 20:22:11,829 INFO L280 TraceCheckUtils]: 83: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-10 20:22:11,829 INFO L280 TraceCheckUtils]: 84: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,829 INFO L280 TraceCheckUtils]: 85: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,830 INFO L280 TraceCheckUtils]: 86: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,830 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-10 20:22:11,830 INFO L280 TraceCheckUtils]: 88: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-10 20:22:11,830 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-10 20:22:11,830 INFO L280 TraceCheckUtils]: 90: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-10 20:22:11,831 INFO L280 TraceCheckUtils]: 91: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-10 20:22:11,831 INFO L280 TraceCheckUtils]: 92: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-10 20:22:11,831 INFO L280 TraceCheckUtils]: 93: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,831 INFO L280 TraceCheckUtils]: 94: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,832 INFO L280 TraceCheckUtils]: 95: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,832 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-10 20:22:11,832 INFO L280 TraceCheckUtils]: 97: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-10 20:22:11,832 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-10 20:22:11,832 INFO L280 TraceCheckUtils]: 99: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-10 20:22:11,833 INFO L280 TraceCheckUtils]: 100: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-10 20:22:11,833 INFO L280 TraceCheckUtils]: 101: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-10 20:22:11,833 INFO L280 TraceCheckUtils]: 102: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,833 INFO L280 TraceCheckUtils]: 103: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,833 INFO L280 TraceCheckUtils]: 104: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,834 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-10 20:22:11,834 INFO L280 TraceCheckUtils]: 106: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-10 20:22:11,834 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-10 20:22:11,834 INFO L280 TraceCheckUtils]: 108: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-10 20:22:11,834 INFO L280 TraceCheckUtils]: 109: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-10 20:22:11,835 INFO L280 TraceCheckUtils]: 110: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-10 20:22:11,835 INFO L280 TraceCheckUtils]: 111: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,835 INFO L280 TraceCheckUtils]: 112: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,835 INFO L280 TraceCheckUtils]: 113: Hoare triple {6163#false} assume !(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,835 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-10 20:22:11,836 INFO L280 TraceCheckUtils]: 115: Hoare triple {6162#true} ~cond := #in~cond; {6162#true} is VALID [2020-07-10 20:22:11,836 INFO L280 TraceCheckUtils]: 116: Hoare triple {6162#true} assume !(0 == ~cond); {6162#true} is VALID [2020-07-10 20:22:11,836 INFO L280 TraceCheckUtils]: 117: Hoare triple {6162#true} assume true; {6162#true} is VALID [2020-07-10 20:22:11,836 INFO L275 TraceCheckUtils]: 118: Hoare quadruple {6162#true} {6163#false} #334#return; {6163#false} is VALID [2020-07-10 20:22:11,836 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-10 20:22:11,837 INFO L280 TraceCheckUtils]: 120: Hoare triple {6163#false} #t~post0 := ~i~0; {6163#false} is VALID [2020-07-10 20:22:11,837 INFO L280 TraceCheckUtils]: 121: Hoare triple {6163#false} ~i~0 := 1 + #t~post0; {6163#false} is VALID [2020-07-10 20:22:11,837 INFO L280 TraceCheckUtils]: 122: Hoare triple {6163#false} havoc #t~post0; {6163#false} is VALID [2020-07-10 20:22:11,837 INFO L280 TraceCheckUtils]: 123: Hoare triple {6163#false} assume !!(~i~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,837 INFO L280 TraceCheckUtils]: 124: Hoare triple {6163#false} ~w~0 := 0.0; {6163#false} is VALID [2020-07-10 20:22:11,838 INFO L280 TraceCheckUtils]: 125: Hoare triple {6163#false} ~j~0 := 0; {6163#false} is VALID [2020-07-10 20:22:11,838 INFO L280 TraceCheckUtils]: 126: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,838 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-10 20:22:11,838 INFO L280 TraceCheckUtils]: 128: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-10 20:22:11,838 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-10 20:22:11,839 INFO L280 TraceCheckUtils]: 130: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-10 20:22:11,839 INFO L280 TraceCheckUtils]: 131: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-10 20:22:11,839 INFO L280 TraceCheckUtils]: 132: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-10 20:22:11,839 INFO L280 TraceCheckUtils]: 133: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,840 INFO L280 TraceCheckUtils]: 134: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,840 INFO L280 TraceCheckUtils]: 135: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,840 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-10 20:22:11,841 INFO L280 TraceCheckUtils]: 137: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-10 20:22:11,841 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-10 20:22:11,841 INFO L280 TraceCheckUtils]: 139: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-10 20:22:11,842 INFO L280 TraceCheckUtils]: 140: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-10 20:22:11,842 INFO L280 TraceCheckUtils]: 141: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-10 20:22:11,842 INFO L280 TraceCheckUtils]: 142: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,842 INFO L280 TraceCheckUtils]: 143: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,843 INFO L280 TraceCheckUtils]: 144: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,843 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-10 20:22:11,843 INFO L280 TraceCheckUtils]: 146: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-10 20:22:11,843 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-10 20:22:11,844 INFO L280 TraceCheckUtils]: 148: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-10 20:22:11,844 INFO L280 TraceCheckUtils]: 149: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-10 20:22:11,844 INFO L280 TraceCheckUtils]: 150: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-10 20:22:11,845 INFO L280 TraceCheckUtils]: 151: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,845 INFO L280 TraceCheckUtils]: 152: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,845 INFO L280 TraceCheckUtils]: 153: Hoare triple {6163#false} assume !!(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,846 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-10 20:22:11,846 INFO L280 TraceCheckUtils]: 155: Hoare triple {6163#false} assume !(~i~0 == ~j~0); {6163#false} is VALID [2020-07-10 20:22:11,846 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-10 20:22:11,846 INFO L280 TraceCheckUtils]: 157: Hoare triple {6163#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {6163#false} is VALID [2020-07-10 20:22:11,847 INFO L280 TraceCheckUtils]: 158: Hoare triple {6163#false} havoc #t~mem3; {6163#false} is VALID [2020-07-10 20:22:11,847 INFO L280 TraceCheckUtils]: 159: Hoare triple {6163#false} #t~post1 := ~j~0; {6163#false} is VALID [2020-07-10 20:22:11,847 INFO L280 TraceCheckUtils]: 160: Hoare triple {6163#false} ~j~0 := 1 + #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,848 INFO L280 TraceCheckUtils]: 161: Hoare triple {6163#false} havoc #t~post1; {6163#false} is VALID [2020-07-10 20:22:11,848 INFO L280 TraceCheckUtils]: 162: Hoare triple {6163#false} assume !(~j~0 <= ~n~0); {6163#false} is VALID [2020-07-10 20:22:11,848 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-10 20:22:11,848 INFO L280 TraceCheckUtils]: 164: Hoare triple {6163#false} ~cond := #in~cond; {6163#false} is VALID [2020-07-10 20:22:11,849 INFO L280 TraceCheckUtils]: 165: Hoare triple {6163#false} assume 0 == ~cond; {6163#false} is VALID [2020-07-10 20:22:11,849 INFO L280 TraceCheckUtils]: 166: Hoare triple {6163#false} assume !false; {6163#false} is VALID [2020-07-10 20:22:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:11,884 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:11,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1388300000] [2020-07-10 20:22:11,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:11,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 20:22:11,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841146227] [2020-07-10 20:22:11,886 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2020-07-10 20:22:11,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:11,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 20:22:11,988 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-10 20:22:11,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 20:22:11,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 20:22:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:22:11,989 INFO L87 Difference]: Start difference. First operand 203 states and 217 transitions. Second operand 13 states. [2020-07-10 20:22:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:14,190 INFO L93 Difference]: Finished difference Result 398 states and 431 transitions. [2020-07-10 20:22:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 20:22:14,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2020-07-10 20:22:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:22:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 148 transitions. [2020-07-10 20:22:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:22:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 148 transitions. [2020-07-10 20:22:14,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 148 transitions. [2020-07-10 20:22:14,394 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-10 20:22:14,402 INFO L225 Difference]: With dead ends: 398 [2020-07-10 20:22:14,403 INFO L226 Difference]: Without dead ends: 269 [2020-07-10 20:22:14,404 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-10 20:22:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-07-10 20:22:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2020-07-10 20:22:15,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:15,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand 239 states. [2020-07-10 20:22:15,154 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 239 states. [2020-07-10 20:22:15,154 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 239 states. [2020-07-10 20:22:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:15,163 INFO L93 Difference]: Finished difference Result 269 states and 289 transitions. [2020-07-10 20:22:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 289 transitions. [2020-07-10 20:22:15,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:15,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:15,164 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 269 states. [2020-07-10 20:22:15,164 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 269 states. [2020-07-10 20:22:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:15,172 INFO L93 Difference]: Finished difference Result 269 states and 289 transitions. [2020-07-10 20:22:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 289 transitions. [2020-07-10 20:22:15,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:15,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:15,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:15,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-10 20:22:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 256 transitions. [2020-07-10 20:22:15,180 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 256 transitions. Word has length 167 [2020-07-10 20:22:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:15,180 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 256 transitions. [2020-07-10 20:22:15,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 20:22:15,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 239 states and 256 transitions. [2020-07-10 20:22:15,602 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-10 20:22:15,602 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 256 transitions. [2020-07-10 20:22:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-07-10 20:22:15,606 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:15,606 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-10 20:22:15,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:22:15,607 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash 917121735, now seen corresponding path program 6 times [2020-07-10 20:22:15,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:15,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1747441645] [2020-07-10 20:22:15,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:15,948 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-10 20:22:15,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} #valid := #valid[0 := 0]; {8036#true} is VALID [2020-07-10 20:22:15,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume 0 < #StackHeapBarrier; {8036#true} is VALID [2020-07-10 20:22:15,949 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-10 20:22:15,949 INFO L280 TraceCheckUtils]: 4: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {8036#true} is VALID [2020-07-10 20:22:15,950 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-10 20:22:15,950 INFO L280 TraceCheckUtils]: 6: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {8036#true} is VALID [2020-07-10 20:22:15,950 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-10 20:22:15,950 INFO L280 TraceCheckUtils]: 8: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {8036#true} is VALID [2020-07-10 20:22:15,950 INFO L280 TraceCheckUtils]: 9: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:22:15,951 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {8036#true} {8036#true} #330#return; {8036#true} is VALID [2020-07-10 20:22:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:15,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:22:15,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:22:15,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:22:15,955 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8037#false} #334#return; {8037#false} is VALID [2020-07-10 20:22:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:15,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:22:15,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:22:15,958 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:22:15,958 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8037#false} #334#return; {8037#false} is VALID [2020-07-10 20:22:15,960 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-10 20:22:15,960 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-10 20:22:15,960 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} #valid := #valid[0 := 0]; {8036#true} is VALID [2020-07-10 20:22:15,961 INFO L280 TraceCheckUtils]: 3: Hoare triple {8036#true} assume 0 < #StackHeapBarrier; {8036#true} is VALID [2020-07-10 20:22:15,961 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-10 20:22:15,961 INFO L280 TraceCheckUtils]: 5: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {8036#true} is VALID [2020-07-10 20:22:15,961 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-10 20:22:15,961 INFO L280 TraceCheckUtils]: 7: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {8036#true} is VALID [2020-07-10 20:22:15,962 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-10 20:22:15,962 INFO L280 TraceCheckUtils]: 9: Hoare triple {8036#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {8036#true} is VALID [2020-07-10 20:22:15,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:22:15,962 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {8036#true} {8036#true} #330#return; {8036#true} is VALID [2020-07-10 20:22:15,962 INFO L263 TraceCheckUtils]: 12: Hoare triple {8036#true} call #t~ret33 := main(); {8036#true} is VALID [2020-07-10 20:22:15,963 INFO L280 TraceCheckUtils]: 13: Hoare triple {8036#true} havoc ~i~0; {8036#true} is VALID [2020-07-10 20:22:15,963 INFO L280 TraceCheckUtils]: 14: Hoare triple {8036#true} havoc ~j~0; {8036#true} is VALID [2020-07-10 20:22:15,963 INFO L280 TraceCheckUtils]: 15: Hoare triple {8036#true} ~nmax~0 := 50; {8036#true} is VALID [2020-07-10 20:22:15,964 INFO L280 TraceCheckUtils]: 16: Hoare triple {8036#true} ~n~0 := 5; {8049#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:15,964 INFO L280 TraceCheckUtils]: 17: Hoare triple {8049#(<= 5 main_~n~0)} havoc ~chkerr~0; {8049#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:15,965 INFO L280 TraceCheckUtils]: 18: Hoare triple {8049#(<= 5 main_~n~0)} havoc ~eps~0; {8049#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:15,965 INFO L280 TraceCheckUtils]: 19: Hoare triple {8049#(<= 5 main_~n~0)} havoc ~w~0; {8049#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:15,966 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-10 20:22:15,967 INFO L280 TraceCheckUtils]: 21: Hoare triple {8049#(<= 5 main_~n~0)} ~i~0 := 0; {8049#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:15,967 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-10 20:22:15,968 INFO L280 TraceCheckUtils]: 23: Hoare triple {8049#(<= 5 main_~n~0)} ~w~0 := 0.0; {8049#(<= 5 main_~n~0)} is VALID [2020-07-10 20:22:15,968 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-10 20:22:15,969 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-10 20:22:15,970 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-10 20:22:15,971 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-10 20:22:15,972 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-10 20:22:15,972 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-10 20:22:15,973 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-10 20:22:15,974 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-10 20:22:15,975 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-10 20:22:15,975 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-10 20:22:15,976 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-10 20:22:15,977 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-10 20:22:15,977 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-10 20:22:15,978 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-10 20:22:15,978 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-10 20:22:15,979 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-10 20:22:15,979 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-10 20:22:15,980 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-10 20:22:15,981 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-10 20:22:15,981 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-10 20:22:15,982 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-10 20:22:15,983 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-10 20:22:15,983 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-10 20:22:15,984 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-10 20:22:15,984 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-10 20:22:15,985 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-10 20:22:15,985 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-10 20:22:15,986 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-10 20:22:15,987 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-10 20:22:15,987 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-10 20:22:15,988 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-10 20:22:15,988 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-10 20:22:15,989 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-10 20:22:15,990 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-10 20:22:15,990 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-10 20:22:15,991 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-10 20:22:15,991 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-10 20:22:15,992 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-10 20:22:15,993 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-10 20:22:15,994 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-10 20:22:15,994 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-10 20:22:15,995 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-10 20:22:15,995 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-10 20:22:15,996 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-10 20:22:15,997 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-10 20:22:15,997 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-10 20:22:15,998 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-10 20:22:15,999 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-10 20:22:15,999 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-10 20:22:16,000 INFO L280 TraceCheckUtils]: 73: Hoare triple {8060#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,000 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-10 20:22:16,000 INFO L280 TraceCheckUtils]: 75: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:22:16,001 INFO L280 TraceCheckUtils]: 76: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:22:16,001 INFO L280 TraceCheckUtils]: 77: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:22:16,001 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {8036#true} {8037#false} #334#return; {8037#false} is VALID [2020-07-10 20:22:16,001 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-10 20:22:16,001 INFO L280 TraceCheckUtils]: 80: Hoare triple {8037#false} #t~post0 := ~i~0; {8037#false} is VALID [2020-07-10 20:22:16,002 INFO L280 TraceCheckUtils]: 81: Hoare triple {8037#false} ~i~0 := 1 + #t~post0; {8037#false} is VALID [2020-07-10 20:22:16,002 INFO L280 TraceCheckUtils]: 82: Hoare triple {8037#false} havoc #t~post0; {8037#false} is VALID [2020-07-10 20:22:16,002 INFO L280 TraceCheckUtils]: 83: Hoare triple {8037#false} assume !!(~i~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,002 INFO L280 TraceCheckUtils]: 84: Hoare triple {8037#false} ~w~0 := 0.0; {8037#false} is VALID [2020-07-10 20:22:16,002 INFO L280 TraceCheckUtils]: 85: Hoare triple {8037#false} ~j~0 := 0; {8037#false} is VALID [2020-07-10 20:22:16,003 INFO L280 TraceCheckUtils]: 86: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,003 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-10 20:22:16,003 INFO L280 TraceCheckUtils]: 88: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-10 20:22:16,003 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-10 20:22:16,003 INFO L280 TraceCheckUtils]: 90: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-10 20:22:16,004 INFO L280 TraceCheckUtils]: 91: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-10 20:22:16,004 INFO L280 TraceCheckUtils]: 92: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-10 20:22:16,004 INFO L280 TraceCheckUtils]: 93: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,005 INFO L280 TraceCheckUtils]: 94: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,005 INFO L280 TraceCheckUtils]: 95: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,005 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-10 20:22:16,006 INFO L280 TraceCheckUtils]: 97: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-10 20:22:16,006 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-10 20:22:16,006 INFO L280 TraceCheckUtils]: 99: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-10 20:22:16,007 INFO L280 TraceCheckUtils]: 100: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-10 20:22:16,007 INFO L280 TraceCheckUtils]: 101: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-10 20:22:16,008 INFO L280 TraceCheckUtils]: 102: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,008 INFO L280 TraceCheckUtils]: 103: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,008 INFO L280 TraceCheckUtils]: 104: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,009 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-10 20:22:16,009 INFO L280 TraceCheckUtils]: 106: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-10 20:22:16,009 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-10 20:22:16,010 INFO L280 TraceCheckUtils]: 108: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-10 20:22:16,010 INFO L280 TraceCheckUtils]: 109: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-10 20:22:16,010 INFO L280 TraceCheckUtils]: 110: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-10 20:22:16,011 INFO L280 TraceCheckUtils]: 111: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,039 INFO L280 TraceCheckUtils]: 112: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,040 INFO L280 TraceCheckUtils]: 113: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,040 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-10 20:22:16,041 INFO L280 TraceCheckUtils]: 115: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-10 20:22:16,041 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-10 20:22:16,041 INFO L280 TraceCheckUtils]: 117: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-10 20:22:16,042 INFO L280 TraceCheckUtils]: 118: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-10 20:22:16,042 INFO L280 TraceCheckUtils]: 119: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-10 20:22:16,042 INFO L280 TraceCheckUtils]: 120: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,043 INFO L280 TraceCheckUtils]: 121: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,043 INFO L280 TraceCheckUtils]: 122: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,043 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-10 20:22:16,044 INFO L280 TraceCheckUtils]: 124: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-10 20:22:16,044 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-10 20:22:16,044 INFO L280 TraceCheckUtils]: 126: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-10 20:22:16,045 INFO L280 TraceCheckUtils]: 127: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-10 20:22:16,045 INFO L280 TraceCheckUtils]: 128: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-10 20:22:16,045 INFO L280 TraceCheckUtils]: 129: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,046 INFO L280 TraceCheckUtils]: 130: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,046 INFO L280 TraceCheckUtils]: 131: Hoare triple {8037#false} assume !(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,046 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-10 20:22:16,047 INFO L280 TraceCheckUtils]: 133: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:22:16,047 INFO L280 TraceCheckUtils]: 134: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:22:16,047 INFO L280 TraceCheckUtils]: 135: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:22:16,048 INFO L275 TraceCheckUtils]: 136: Hoare quadruple {8036#true} {8037#false} #334#return; {8037#false} is VALID [2020-07-10 20:22:16,048 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-10 20:22:16,048 INFO L280 TraceCheckUtils]: 138: Hoare triple {8037#false} #t~post0 := ~i~0; {8037#false} is VALID [2020-07-10 20:22:16,049 INFO L280 TraceCheckUtils]: 139: Hoare triple {8037#false} ~i~0 := 1 + #t~post0; {8037#false} is VALID [2020-07-10 20:22:16,049 INFO L280 TraceCheckUtils]: 140: Hoare triple {8037#false} havoc #t~post0; {8037#false} is VALID [2020-07-10 20:22:16,049 INFO L280 TraceCheckUtils]: 141: Hoare triple {8037#false} assume !!(~i~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,050 INFO L280 TraceCheckUtils]: 142: Hoare triple {8037#false} ~w~0 := 0.0; {8037#false} is VALID [2020-07-10 20:22:16,050 INFO L280 TraceCheckUtils]: 143: Hoare triple {8037#false} ~j~0 := 0; {8037#false} is VALID [2020-07-10 20:22:16,050 INFO L280 TraceCheckUtils]: 144: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,051 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-10 20:22:16,051 INFO L280 TraceCheckUtils]: 146: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-10 20:22:16,051 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-10 20:22:16,052 INFO L280 TraceCheckUtils]: 148: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-10 20:22:16,052 INFO L280 TraceCheckUtils]: 149: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-10 20:22:16,052 INFO L280 TraceCheckUtils]: 150: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-10 20:22:16,053 INFO L280 TraceCheckUtils]: 151: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,053 INFO L280 TraceCheckUtils]: 152: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,053 INFO L280 TraceCheckUtils]: 153: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,054 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-10 20:22:16,054 INFO L280 TraceCheckUtils]: 155: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-10 20:22:16,054 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-10 20:22:16,055 INFO L280 TraceCheckUtils]: 157: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-10 20:22:16,055 INFO L280 TraceCheckUtils]: 158: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-10 20:22:16,055 INFO L280 TraceCheckUtils]: 159: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-10 20:22:16,056 INFO L280 TraceCheckUtils]: 160: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,056 INFO L280 TraceCheckUtils]: 161: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,056 INFO L280 TraceCheckUtils]: 162: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,057 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-10 20:22:16,057 INFO L280 TraceCheckUtils]: 164: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-10 20:22:16,057 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-10 20:22:16,058 INFO L280 TraceCheckUtils]: 166: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-10 20:22:16,058 INFO L280 TraceCheckUtils]: 167: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-10 20:22:16,058 INFO L280 TraceCheckUtils]: 168: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-10 20:22:16,059 INFO L280 TraceCheckUtils]: 169: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,059 INFO L280 TraceCheckUtils]: 170: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,059 INFO L280 TraceCheckUtils]: 171: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,060 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-10 20:22:16,060 INFO L280 TraceCheckUtils]: 173: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-10 20:22:16,060 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-10 20:22:16,061 INFO L280 TraceCheckUtils]: 175: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-10 20:22:16,061 INFO L280 TraceCheckUtils]: 176: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-10 20:22:16,061 INFO L280 TraceCheckUtils]: 177: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-10 20:22:16,062 INFO L280 TraceCheckUtils]: 178: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,062 INFO L280 TraceCheckUtils]: 179: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,062 INFO L280 TraceCheckUtils]: 180: Hoare triple {8037#false} assume !!(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,063 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-10 20:22:16,063 INFO L280 TraceCheckUtils]: 182: Hoare triple {8037#false} assume !(~i~0 == ~j~0); {8037#false} is VALID [2020-07-10 20:22:16,063 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-10 20:22:16,064 INFO L280 TraceCheckUtils]: 184: Hoare triple {8037#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {8037#false} is VALID [2020-07-10 20:22:16,064 INFO L280 TraceCheckUtils]: 185: Hoare triple {8037#false} havoc #t~mem3; {8037#false} is VALID [2020-07-10 20:22:16,064 INFO L280 TraceCheckUtils]: 186: Hoare triple {8037#false} #t~post1 := ~j~0; {8037#false} is VALID [2020-07-10 20:22:16,065 INFO L280 TraceCheckUtils]: 187: Hoare triple {8037#false} ~j~0 := 1 + #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,065 INFO L280 TraceCheckUtils]: 188: Hoare triple {8037#false} havoc #t~post1; {8037#false} is VALID [2020-07-10 20:22:16,065 INFO L280 TraceCheckUtils]: 189: Hoare triple {8037#false} assume !(~j~0 <= ~n~0); {8037#false} is VALID [2020-07-10 20:22:16,066 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-10 20:22:16,066 INFO L280 TraceCheckUtils]: 191: Hoare triple {8037#false} ~cond := #in~cond; {8037#false} is VALID [2020-07-10 20:22:16,066 INFO L280 TraceCheckUtils]: 192: Hoare triple {8037#false} assume 0 == ~cond; {8037#false} is VALID [2020-07-10 20:22:16,067 INFO L280 TraceCheckUtils]: 193: Hoare triple {8037#false} assume !false; {8037#false} is VALID [2020-07-10 20:22:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:16,128 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:16,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1747441645] [2020-07-10 20:22:16,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:16,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 20:22:16,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589498762] [2020-07-10 20:22:16,130 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 194 [2020-07-10 20:22:16,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:16,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 20:22:16,285 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-10 20:22:16,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 20:22:16,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 20:22:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:22:16,286 INFO L87 Difference]: Start difference. First operand 239 states and 256 transitions. Second operand 15 states. [2020-07-10 20:22:19,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:19,077 INFO L93 Difference]: Finished difference Result 428 states and 463 transitions. [2020-07-10 20:22:19,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-10 20:22:19,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 194 [2020-07-10 20:22:19,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:22:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 150 transitions. [2020-07-10 20:22:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:22:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 150 transitions. [2020-07-10 20:22:19,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 150 transitions. [2020-07-10 20:22:19,262 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-10 20:22:19,269 INFO L225 Difference]: With dead ends: 428 [2020-07-10 20:22:19,270 INFO L226 Difference]: Without dead ends: 275 [2020-07-10 20:22:19,271 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-10 20:22:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-07-10 20:22:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2020-07-10 20:22:20,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:20,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 275 states. [2020-07-10 20:22:20,204 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 275 states. [2020-07-10 20:22:20,205 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 275 states. [2020-07-10 20:22:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:20,213 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2020-07-10 20:22:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 295 transitions. [2020-07-10 20:22:20,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:20,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:20,214 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 275 states. [2020-07-10 20:22:20,215 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 275 states. [2020-07-10 20:22:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:20,222 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2020-07-10 20:22:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 295 transitions. [2020-07-10 20:22:20,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:20,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:20,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:20,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-07-10 20:22:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 295 transitions. [2020-07-10 20:22:20,231 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 295 transitions. Word has length 194 [2020-07-10 20:22:20,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:20,232 INFO L479 AbstractCegarLoop]: Abstraction has 275 states and 295 transitions. [2020-07-10 20:22:20,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 20:22:20,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 275 states and 295 transitions. [2020-07-10 20:22:20,743 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-10 20:22:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 295 transitions. [2020-07-10 20:22:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2020-07-10 20:22:20,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:20,745 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-10 20:22:20,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 20:22:20,746 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:20,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash 374306853, now seen corresponding path program 7 times [2020-07-10 20:22:20,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:20,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246594910] [2020-07-10 20:22:20,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:21,093 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-10 20:22:21,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {10062#true} #valid := #valid[0 := 0]; {10062#true} is VALID [2020-07-10 20:22:21,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {10062#true} assume 0 < #StackHeapBarrier; {10062#true} is VALID [2020-07-10 20:22:21,094 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-10 20:22:21,094 INFO L280 TraceCheckUtils]: 4: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {10062#true} is VALID [2020-07-10 20:22:21,095 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-10 20:22:21,095 INFO L280 TraceCheckUtils]: 6: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {10062#true} is VALID [2020-07-10 20:22:21,095 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-10 20:22:21,095 INFO L280 TraceCheckUtils]: 8: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {10062#true} is VALID [2020-07-10 20:22:21,096 INFO L280 TraceCheckUtils]: 9: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-10 20:22:21,096 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {10062#true} {10062#true} #330#return; {10062#true} is VALID [2020-07-10 20:22:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:21,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {10062#true} ~cond := #in~cond; {10062#true} is VALID [2020-07-10 20:22:21,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {10062#true} assume !(0 == ~cond); {10062#true} is VALID [2020-07-10 20:22:21,101 INFO L280 TraceCheckUtils]: 2: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-10 20:22:21,102 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10062#true} {10075#(= 0 main_~i~0)} #334#return; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:21,106 INFO L280 TraceCheckUtils]: 0: Hoare triple {10062#true} ~cond := #in~cond; {10062#true} is VALID [2020-07-10 20:22:21,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {10062#true} assume !(0 == ~cond); {10062#true} is VALID [2020-07-10 20:22:21,106 INFO L280 TraceCheckUtils]: 2: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-10 20:22:21,106 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10062#true} {10063#false} #334#return; {10063#false} is VALID [2020-07-10 20:22:21,108 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-10 20:22:21,108 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-10 20:22:21,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {10062#true} #valid := #valid[0 := 0]; {10062#true} is VALID [2020-07-10 20:22:21,108 INFO L280 TraceCheckUtils]: 3: Hoare triple {10062#true} assume 0 < #StackHeapBarrier; {10062#true} is VALID [2020-07-10 20:22:21,109 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-10 20:22:21,109 INFO L280 TraceCheckUtils]: 5: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {10062#true} is VALID [2020-07-10 20:22:21,109 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-10 20:22:21,109 INFO L280 TraceCheckUtils]: 7: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {10062#true} is VALID [2020-07-10 20:22:21,110 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-10 20:22:21,110 INFO L280 TraceCheckUtils]: 9: Hoare triple {10062#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {10062#true} is VALID [2020-07-10 20:22:21,110 INFO L280 TraceCheckUtils]: 10: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-10 20:22:21,110 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {10062#true} {10062#true} #330#return; {10062#true} is VALID [2020-07-10 20:22:21,111 INFO L263 TraceCheckUtils]: 12: Hoare triple {10062#true} call #t~ret33 := main(); {10062#true} is VALID [2020-07-10 20:22:21,111 INFO L280 TraceCheckUtils]: 13: Hoare triple {10062#true} havoc ~i~0; {10062#true} is VALID [2020-07-10 20:22:21,111 INFO L280 TraceCheckUtils]: 14: Hoare triple {10062#true} havoc ~j~0; {10062#true} is VALID [2020-07-10 20:22:21,111 INFO L280 TraceCheckUtils]: 15: Hoare triple {10062#true} ~nmax~0 := 50; {10062#true} is VALID [2020-07-10 20:22:21,111 INFO L280 TraceCheckUtils]: 16: Hoare triple {10062#true} ~n~0 := 5; {10062#true} is VALID [2020-07-10 20:22:21,112 INFO L280 TraceCheckUtils]: 17: Hoare triple {10062#true} havoc ~chkerr~0; {10062#true} is VALID [2020-07-10 20:22:21,112 INFO L280 TraceCheckUtils]: 18: Hoare triple {10062#true} havoc ~eps~0; {10062#true} is VALID [2020-07-10 20:22:21,112 INFO L280 TraceCheckUtils]: 19: Hoare triple {10062#true} havoc ~w~0; {10062#true} is VALID [2020-07-10 20:22:21,112 INFO L280 TraceCheckUtils]: 20: Hoare triple {10062#true} ~eps~0 := 1.0E-6; {10062#true} is VALID [2020-07-10 20:22:21,113 INFO L280 TraceCheckUtils]: 21: Hoare triple {10062#true} ~i~0 := 0; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,114 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-10 20:22:21,114 INFO L280 TraceCheckUtils]: 23: Hoare triple {10075#(= 0 main_~i~0)} ~w~0 := 0.0; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,115 INFO L280 TraceCheckUtils]: 24: Hoare triple {10075#(= 0 main_~i~0)} ~j~0 := 0; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,116 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-10 20:22:21,116 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-10 20:22:21,117 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-10 20:22:21,117 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-10 20:22:21,118 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-10 20:22:21,119 INFO L280 TraceCheckUtils]: 30: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem2; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,119 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-10 20:22:21,120 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-10 20:22:21,121 INFO L280 TraceCheckUtils]: 33: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,122 INFO L280 TraceCheckUtils]: 34: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,123 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-10 20:22:21,124 INFO L280 TraceCheckUtils]: 36: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,124 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-10 20:22:21,125 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-10 20:22:21,126 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-10 20:22:21,127 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-10 20:22:21,128 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-10 20:22:21,129 INFO L280 TraceCheckUtils]: 42: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,130 INFO L280 TraceCheckUtils]: 43: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,131 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-10 20:22:21,131 INFO L280 TraceCheckUtils]: 45: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,132 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-10 20:22:21,133 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-10 20:22:21,134 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-10 20:22:21,135 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-10 20:22:21,136 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-10 20:22:21,137 INFO L280 TraceCheckUtils]: 51: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,138 INFO L280 TraceCheckUtils]: 52: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,139 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-10 20:22:21,139 INFO L280 TraceCheckUtils]: 54: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,140 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-10 20:22:21,141 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-10 20:22:21,142 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-10 20:22:21,143 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-10 20:22:21,144 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-10 20:22:21,145 INFO L280 TraceCheckUtils]: 60: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,146 INFO L280 TraceCheckUtils]: 61: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,147 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-10 20:22:21,147 INFO L280 TraceCheckUtils]: 63: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,148 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-10 20:22:21,149 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-10 20:22:21,150 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-10 20:22:21,151 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-10 20:22:21,152 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-10 20:22:21,153 INFO L280 TraceCheckUtils]: 69: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,154 INFO L280 TraceCheckUtils]: 70: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,155 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-10 20:22:21,156 INFO L280 TraceCheckUtils]: 72: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,157 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-10 20:22:21,157 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-10 20:22:21,158 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-10 20:22:21,159 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-10 20:22:21,160 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-10 20:22:21,161 INFO L280 TraceCheckUtils]: 78: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~mem3; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,162 INFO L280 TraceCheckUtils]: 79: Hoare triple {10075#(= 0 main_~i~0)} #t~post1 := ~j~0; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,163 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-10 20:22:21,164 INFO L280 TraceCheckUtils]: 81: Hoare triple {10075#(= 0 main_~i~0)} havoc #t~post1; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,164 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-10 20:22:21,165 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-10 20:22:21,165 INFO L280 TraceCheckUtils]: 84: Hoare triple {10062#true} ~cond := #in~cond; {10062#true} is VALID [2020-07-10 20:22:21,165 INFO L280 TraceCheckUtils]: 85: Hoare triple {10062#true} assume !(0 == ~cond); {10062#true} is VALID [2020-07-10 20:22:21,166 INFO L280 TraceCheckUtils]: 86: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-10 20:22:21,167 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {10062#true} {10075#(= 0 main_~i~0)} #334#return; {10075#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:21,168 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-10 20:22:21,169 INFO L280 TraceCheckUtils]: 89: Hoare triple {10075#(= 0 main_~i~0)} #t~post0 := ~i~0; {10080#(= |main_#t~post0| 0)} is VALID [2020-07-10 20:22:21,170 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-10 20:22:21,171 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-10 20:22:21,172 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-10 20:22:21,174 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-10 20:22:21,175 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-10 20:22:21,176 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-10 20:22:21,177 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-10 20:22:21,178 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-10 20:22:21,180 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-10 20:22:21,181 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-10 20:22:21,182 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-10 20:22:21,183 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-10 20:22:21,184 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-10 20:22:21,186 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-10 20:22:21,187 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-10 20:22:21,188 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-10 20:22:21,189 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-10 20:22:21,189 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-10 20:22:21,189 INFO L280 TraceCheckUtils]: 108: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,190 INFO L280 TraceCheckUtils]: 109: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,190 INFO L280 TraceCheckUtils]: 110: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,190 INFO L280 TraceCheckUtils]: 111: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,190 INFO L280 TraceCheckUtils]: 112: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,191 INFO L280 TraceCheckUtils]: 113: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,191 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-10 20:22:21,191 INFO L280 TraceCheckUtils]: 115: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-10 20:22:21,191 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-10 20:22:21,192 INFO L280 TraceCheckUtils]: 117: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,192 INFO L280 TraceCheckUtils]: 118: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,192 INFO L280 TraceCheckUtils]: 119: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,192 INFO L280 TraceCheckUtils]: 120: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,193 INFO L280 TraceCheckUtils]: 121: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,193 INFO L280 TraceCheckUtils]: 122: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,193 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-10 20:22:21,193 INFO L280 TraceCheckUtils]: 124: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-10 20:22:21,194 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-10 20:22:21,194 INFO L280 TraceCheckUtils]: 126: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,194 INFO L280 TraceCheckUtils]: 127: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,195 INFO L280 TraceCheckUtils]: 128: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,195 INFO L280 TraceCheckUtils]: 129: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,195 INFO L280 TraceCheckUtils]: 130: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,196 INFO L280 TraceCheckUtils]: 131: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,196 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-10 20:22:21,196 INFO L280 TraceCheckUtils]: 133: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-10 20:22:21,197 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-10 20:22:21,197 INFO L280 TraceCheckUtils]: 135: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,197 INFO L280 TraceCheckUtils]: 136: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,198 INFO L280 TraceCheckUtils]: 137: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,198 INFO L280 TraceCheckUtils]: 138: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,198 INFO L280 TraceCheckUtils]: 139: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,199 INFO L280 TraceCheckUtils]: 140: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,199 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-10 20:22:21,199 INFO L280 TraceCheckUtils]: 142: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-10 20:22:21,200 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-10 20:22:21,200 INFO L280 TraceCheckUtils]: 144: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,201 INFO L280 TraceCheckUtils]: 145: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,201 INFO L280 TraceCheckUtils]: 146: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,201 INFO L280 TraceCheckUtils]: 147: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,202 INFO L280 TraceCheckUtils]: 148: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,202 INFO L280 TraceCheckUtils]: 149: Hoare triple {10063#false} assume !(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,202 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-10 20:22:21,203 INFO L280 TraceCheckUtils]: 151: Hoare triple {10062#true} ~cond := #in~cond; {10062#true} is VALID [2020-07-10 20:22:21,203 INFO L280 TraceCheckUtils]: 152: Hoare triple {10062#true} assume !(0 == ~cond); {10062#true} is VALID [2020-07-10 20:22:21,203 INFO L280 TraceCheckUtils]: 153: Hoare triple {10062#true} assume true; {10062#true} is VALID [2020-07-10 20:22:21,204 INFO L275 TraceCheckUtils]: 154: Hoare quadruple {10062#true} {10063#false} #334#return; {10063#false} is VALID [2020-07-10 20:22:21,204 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-10 20:22:21,204 INFO L280 TraceCheckUtils]: 156: Hoare triple {10063#false} #t~post0 := ~i~0; {10063#false} is VALID [2020-07-10 20:22:21,205 INFO L280 TraceCheckUtils]: 157: Hoare triple {10063#false} ~i~0 := 1 + #t~post0; {10063#false} is VALID [2020-07-10 20:22:21,205 INFO L280 TraceCheckUtils]: 158: Hoare triple {10063#false} havoc #t~post0; {10063#false} is VALID [2020-07-10 20:22:21,205 INFO L280 TraceCheckUtils]: 159: Hoare triple {10063#false} assume !!(~i~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,205 INFO L280 TraceCheckUtils]: 160: Hoare triple {10063#false} ~w~0 := 0.0; {10063#false} is VALID [2020-07-10 20:22:21,206 INFO L280 TraceCheckUtils]: 161: Hoare triple {10063#false} ~j~0 := 0; {10063#false} is VALID [2020-07-10 20:22:21,206 INFO L280 TraceCheckUtils]: 162: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,207 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-10 20:22:21,207 INFO L280 TraceCheckUtils]: 164: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-10 20:22:21,207 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-10 20:22:21,208 INFO L280 TraceCheckUtils]: 166: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,208 INFO L280 TraceCheckUtils]: 167: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,208 INFO L280 TraceCheckUtils]: 168: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,209 INFO L280 TraceCheckUtils]: 169: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,209 INFO L280 TraceCheckUtils]: 170: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,209 INFO L280 TraceCheckUtils]: 171: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,210 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-10 20:22:21,210 INFO L280 TraceCheckUtils]: 173: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-10 20:22:21,210 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-10 20:22:21,211 INFO L280 TraceCheckUtils]: 175: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,211 INFO L280 TraceCheckUtils]: 176: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,211 INFO L280 TraceCheckUtils]: 177: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,212 INFO L280 TraceCheckUtils]: 178: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,212 INFO L280 TraceCheckUtils]: 179: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,212 INFO L280 TraceCheckUtils]: 180: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,213 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-10 20:22:21,213 INFO L280 TraceCheckUtils]: 182: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-10 20:22:21,213 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-10 20:22:21,214 INFO L280 TraceCheckUtils]: 184: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,214 INFO L280 TraceCheckUtils]: 185: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,214 INFO L280 TraceCheckUtils]: 186: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,215 INFO L280 TraceCheckUtils]: 187: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,215 INFO L280 TraceCheckUtils]: 188: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,215 INFO L280 TraceCheckUtils]: 189: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,216 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-10 20:22:21,216 INFO L280 TraceCheckUtils]: 191: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-10 20:22:21,216 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-10 20:22:21,217 INFO L280 TraceCheckUtils]: 193: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,217 INFO L280 TraceCheckUtils]: 194: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,217 INFO L280 TraceCheckUtils]: 195: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,218 INFO L280 TraceCheckUtils]: 196: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,218 INFO L280 TraceCheckUtils]: 197: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,218 INFO L280 TraceCheckUtils]: 198: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,219 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-10 20:22:21,219 INFO L280 TraceCheckUtils]: 200: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-10 20:22:21,219 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-10 20:22:21,220 INFO L280 TraceCheckUtils]: 202: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,220 INFO L280 TraceCheckUtils]: 203: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,220 INFO L280 TraceCheckUtils]: 204: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,221 INFO L280 TraceCheckUtils]: 205: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,221 INFO L280 TraceCheckUtils]: 206: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,221 INFO L280 TraceCheckUtils]: 207: Hoare triple {10063#false} assume !!(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,222 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-10 20:22:21,222 INFO L280 TraceCheckUtils]: 209: Hoare triple {10063#false} assume !(~i~0 == ~j~0); {10063#false} is VALID [2020-07-10 20:22:21,222 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-10 20:22:21,223 INFO L280 TraceCheckUtils]: 211: Hoare triple {10063#false} ~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3); {10063#false} is VALID [2020-07-10 20:22:21,223 INFO L280 TraceCheckUtils]: 212: Hoare triple {10063#false} havoc #t~mem3; {10063#false} is VALID [2020-07-10 20:22:21,223 INFO L280 TraceCheckUtils]: 213: Hoare triple {10063#false} #t~post1 := ~j~0; {10063#false} is VALID [2020-07-10 20:22:21,224 INFO L280 TraceCheckUtils]: 214: Hoare triple {10063#false} ~j~0 := 1 + #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,224 INFO L280 TraceCheckUtils]: 215: Hoare triple {10063#false} havoc #t~post1; {10063#false} is VALID [2020-07-10 20:22:21,225 INFO L280 TraceCheckUtils]: 216: Hoare triple {10063#false} assume !(~j~0 <= ~n~0); {10063#false} is VALID [2020-07-10 20:22:21,225 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-10 20:22:21,225 INFO L280 TraceCheckUtils]: 218: Hoare triple {10063#false} ~cond := #in~cond; {10063#false} is VALID [2020-07-10 20:22:21,226 INFO L280 TraceCheckUtils]: 219: Hoare triple {10063#false} assume 0 == ~cond; {10063#false} is VALID [2020-07-10 20:22:21,226 INFO L280 TraceCheckUtils]: 220: Hoare triple {10063#false} assume !false; {10063#false} is VALID [2020-07-10 20:22:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:21,292 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:21,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246594910] [2020-07-10 20:22:21,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:21,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:22:21,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831416618] [2020-07-10 20:22:21,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 221 [2020-07-10 20:22:21,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:21,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:22:21,436 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-10 20:22:21,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:22:21,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:21,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:22:21,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:22:21,437 INFO L87 Difference]: Start difference. First operand 275 states and 295 transitions. Second operand 9 states. [2020-07-10 20:22:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:24,067 INFO L93 Difference]: Finished difference Result 512 states and 545 transitions. [2020-07-10 20:22:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 20:22:24,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 221 [2020-07-10 20:22:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:22:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2020-07-10 20:22:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:22:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2020-07-10 20:22:24,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2020-07-10 20:22:24,243 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-10 20:22:24,252 INFO L225 Difference]: With dead ends: 512 [2020-07-10 20:22:24,252 INFO L226 Difference]: Without dead ends: 350 [2020-07-10 20:22:24,253 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-10 20:22:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-07-10 20:22:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 272. [2020-07-10 20:22:25,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:25,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand 272 states. [2020-07-10 20:22:25,266 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand 272 states. [2020-07-10 20:22:25,266 INFO L87 Difference]: Start difference. First operand 350 states. Second operand 272 states. [2020-07-10 20:22:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:25,275 INFO L93 Difference]: Finished difference Result 350 states and 368 transitions. [2020-07-10 20:22:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 368 transitions. [2020-07-10 20:22:25,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:25,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:25,276 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand 350 states. [2020-07-10 20:22:25,277 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 350 states. [2020-07-10 20:22:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:25,286 INFO L93 Difference]: Finished difference Result 350 states and 368 transitions. [2020-07-10 20:22:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 368 transitions. [2020-07-10 20:22:25,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:25,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:25,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:25,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-07-10 20:22:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 290 transitions. [2020-07-10 20:22:25,294 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 290 transitions. Word has length 221 [2020-07-10 20:22:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:25,295 INFO L479 AbstractCegarLoop]: Abstraction has 272 states and 290 transitions. [2020-07-10 20:22:25,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:22:25,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 272 states and 290 transitions. [2020-07-10 20:22:25,893 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-10 20:22:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 290 transitions. [2020-07-10 20:22:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-07-10 20:22:25,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:25,898 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-10 20:22:25,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 20:22:25,898 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:25,899 INFO L82 PathProgramCache]: Analyzing trace with hash -368860214, now seen corresponding path program 8 times [2020-07-10 20:22:25,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:25,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [46523730] [2020-07-10 20:22:25,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:26,142 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-10 20:22:26,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {12376#true} #valid := #valid[0 := 0]; {12376#true} is VALID [2020-07-10 20:22:26,142 INFO L280 TraceCheckUtils]: 2: Hoare triple {12376#true} assume 0 < #StackHeapBarrier; {12376#true} is VALID [2020-07-10 20:22:26,142 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-10 20:22:26,143 INFO L280 TraceCheckUtils]: 4: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {12376#true} is VALID [2020-07-10 20:22:26,143 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-10 20:22:26,143 INFO L280 TraceCheckUtils]: 6: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {12376#true} is VALID [2020-07-10 20:22:26,143 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-10 20:22:26,143 INFO L280 TraceCheckUtils]: 8: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {12376#true} is VALID [2020-07-10 20:22:26,144 INFO L280 TraceCheckUtils]: 9: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-10 20:22:26,144 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {12376#true} {12376#true} #330#return; {12376#true} is VALID [2020-07-10 20:22:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:26,149 INFO L280 TraceCheckUtils]: 0: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2020-07-10 20:22:26,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2020-07-10 20:22:26,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-10 20:22:26,150 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12376#true} {12389#(<= main_~n~0 5)} #334#return; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:26,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2020-07-10 20:22:26,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2020-07-10 20:22:26,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-10 20:22:26,156 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12376#true} {12389#(<= main_~n~0 5)} #334#return; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,157 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-10 20:22:26,158 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-10 20:22:26,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {12376#true} #valid := #valid[0 := 0]; {12376#true} is VALID [2020-07-10 20:22:26,158 INFO L280 TraceCheckUtils]: 3: Hoare triple {12376#true} assume 0 < #StackHeapBarrier; {12376#true} is VALID [2020-07-10 20:22:26,159 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-10 20:22:26,159 INFO L280 TraceCheckUtils]: 5: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base); {12376#true} is VALID [2020-07-10 20:22:26,159 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-10 20:22:26,159 INFO L280 TraceCheckUtils]: 7: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base); {12376#true} is VALID [2020-07-10 20:22:26,159 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-10 20:22:26,160 INFO L280 TraceCheckUtils]: 9: Hoare triple {12376#true} #memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {12376#true} is VALID [2020-07-10 20:22:26,160 INFO L280 TraceCheckUtils]: 10: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-10 20:22:26,160 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {12376#true} {12376#true} #330#return; {12376#true} is VALID [2020-07-10 20:22:26,160 INFO L263 TraceCheckUtils]: 12: Hoare triple {12376#true} call #t~ret33 := main(); {12376#true} is VALID [2020-07-10 20:22:26,160 INFO L280 TraceCheckUtils]: 13: Hoare triple {12376#true} havoc ~i~0; {12376#true} is VALID [2020-07-10 20:22:26,161 INFO L280 TraceCheckUtils]: 14: Hoare triple {12376#true} havoc ~j~0; {12376#true} is VALID [2020-07-10 20:22:26,161 INFO L280 TraceCheckUtils]: 15: Hoare triple {12376#true} ~nmax~0 := 50; {12376#true} is VALID [2020-07-10 20:22:26,161 INFO L280 TraceCheckUtils]: 16: Hoare triple {12376#true} ~n~0 := 5; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,162 INFO L280 TraceCheckUtils]: 17: Hoare triple {12389#(<= main_~n~0 5)} havoc ~chkerr~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,162 INFO L280 TraceCheckUtils]: 18: Hoare triple {12389#(<= main_~n~0 5)} havoc ~eps~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,163 INFO L280 TraceCheckUtils]: 19: Hoare triple {12389#(<= main_~n~0 5)} havoc ~w~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,163 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-10 20:22:26,164 INFO L280 TraceCheckUtils]: 21: Hoare triple {12389#(<= main_~n~0 5)} ~i~0 := 0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,164 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-10 20:22:26,165 INFO L280 TraceCheckUtils]: 23: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := 0.0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,165 INFO L280 TraceCheckUtils]: 24: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,166 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-10 20:22:26,166 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-10 20:22:26,167 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-10 20:22:26,167 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-10 20:22:26,168 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-10 20:22:26,168 INFO L280 TraceCheckUtils]: 30: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem2; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,169 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-10 20:22:26,170 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-10 20:22:26,170 INFO L280 TraceCheckUtils]: 33: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,171 INFO L280 TraceCheckUtils]: 34: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,171 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-10 20:22:26,172 INFO L280 TraceCheckUtils]: 36: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,172 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-10 20:22:26,173 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-10 20:22:26,173 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-10 20:22:26,174 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-10 20:22:26,174 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-10 20:22:26,175 INFO L280 TraceCheckUtils]: 42: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,175 INFO L280 TraceCheckUtils]: 43: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,176 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-10 20:22:26,176 INFO L280 TraceCheckUtils]: 45: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,177 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-10 20:22:26,178 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-10 20:22:26,178 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-10 20:22:26,179 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-10 20:22:26,179 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-10 20:22:26,180 INFO L280 TraceCheckUtils]: 51: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,180 INFO L280 TraceCheckUtils]: 52: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,181 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-10 20:22:26,181 INFO L280 TraceCheckUtils]: 54: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,182 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-10 20:22:26,182 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-10 20:22:26,183 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-10 20:22:26,184 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-10 20:22:26,184 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-10 20:22:26,185 INFO L280 TraceCheckUtils]: 60: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,185 INFO L280 TraceCheckUtils]: 61: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,186 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-10 20:22:26,186 INFO L280 TraceCheckUtils]: 63: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,187 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-10 20:22:26,187 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-10 20:22:26,188 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-10 20:22:26,188 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-10 20:22:26,189 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-10 20:22:26,189 INFO L280 TraceCheckUtils]: 69: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,189 INFO L280 TraceCheckUtils]: 70: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,190 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-10 20:22:26,190 INFO L280 TraceCheckUtils]: 72: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,191 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-10 20:22:26,191 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-10 20:22:26,192 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-10 20:22:26,192 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-10 20:22:26,193 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-10 20:22:26,193 INFO L280 TraceCheckUtils]: 78: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,194 INFO L280 TraceCheckUtils]: 79: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,194 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-10 20:22:26,195 INFO L280 TraceCheckUtils]: 81: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,195 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-10 20:22:26,196 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-10 20:22:26,196 INFO L280 TraceCheckUtils]: 84: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2020-07-10 20:22:26,196 INFO L280 TraceCheckUtils]: 85: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2020-07-10 20:22:26,196 INFO L280 TraceCheckUtils]: 86: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-10 20:22:26,197 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {12376#true} {12389#(<= main_~n~0 5)} #334#return; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,197 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-10 20:22:26,198 INFO L280 TraceCheckUtils]: 89: Hoare triple {12389#(<= main_~n~0 5)} #t~post0 := ~i~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,198 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-10 20:22:26,199 INFO L280 TraceCheckUtils]: 91: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,199 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-10 20:22:26,200 INFO L280 TraceCheckUtils]: 93: Hoare triple {12389#(<= main_~n~0 5)} ~w~0 := 0.0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,200 INFO L280 TraceCheckUtils]: 94: Hoare triple {12389#(<= main_~n~0 5)} ~j~0 := 0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,201 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-10 20:22:26,201 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-10 20:22:26,202 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-10 20:22:26,202 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-10 20:22:26,203 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-10 20:22:26,203 INFO L280 TraceCheckUtils]: 100: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,204 INFO L280 TraceCheckUtils]: 101: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,204 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-10 20:22:26,205 INFO L280 TraceCheckUtils]: 103: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,205 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-10 20:22:26,206 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-10 20:22:26,206 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-10 20:22:26,207 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-10 20:22:26,207 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-10 20:22:26,208 INFO L280 TraceCheckUtils]: 109: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem2; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,208 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-10 20:22:26,209 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-10 20:22:26,209 INFO L280 TraceCheckUtils]: 112: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,210 INFO L280 TraceCheckUtils]: 113: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,210 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-10 20:22:26,211 INFO L280 TraceCheckUtils]: 115: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,211 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-10 20:22:26,212 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-10 20:22:26,212 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-10 20:22:26,213 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-10 20:22:26,213 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-10 20:22:26,214 INFO L280 TraceCheckUtils]: 121: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,214 INFO L280 TraceCheckUtils]: 122: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,215 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-10 20:22:26,215 INFO L280 TraceCheckUtils]: 124: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,216 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-10 20:22:26,216 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-10 20:22:26,217 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-10 20:22:26,217 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-10 20:22:26,218 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-10 20:22:26,218 INFO L280 TraceCheckUtils]: 130: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,219 INFO L280 TraceCheckUtils]: 131: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,219 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-10 20:22:26,220 INFO L280 TraceCheckUtils]: 133: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,220 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-10 20:22:26,221 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-10 20:22:26,221 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-10 20:22:26,222 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-10 20:22:26,222 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-10 20:22:26,223 INFO L280 TraceCheckUtils]: 139: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,223 INFO L280 TraceCheckUtils]: 140: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,224 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-10 20:22:26,224 INFO L280 TraceCheckUtils]: 142: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,225 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-10 20:22:26,225 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-10 20:22:26,226 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-10 20:22:26,227 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-10 20:22:26,227 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-10 20:22:26,228 INFO L280 TraceCheckUtils]: 148: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~mem3; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,228 INFO L280 TraceCheckUtils]: 149: Hoare triple {12389#(<= main_~n~0 5)} #t~post1 := ~j~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,229 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-10 20:22:26,230 INFO L280 TraceCheckUtils]: 151: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post1; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,231 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-10 20:22:26,231 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-10 20:22:26,231 INFO L280 TraceCheckUtils]: 154: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2020-07-10 20:22:26,231 INFO L280 TraceCheckUtils]: 155: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2020-07-10 20:22:26,231 INFO L280 TraceCheckUtils]: 156: Hoare triple {12376#true} assume true; {12376#true} is VALID [2020-07-10 20:22:26,232 INFO L275 TraceCheckUtils]: 157: Hoare quadruple {12376#true} {12389#(<= main_~n~0 5)} #334#return; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,233 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-10 20:22:26,235 INFO L280 TraceCheckUtils]: 159: Hoare triple {12389#(<= main_~n~0 5)} #t~post0 := ~i~0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,236 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-10 20:22:26,237 INFO L280 TraceCheckUtils]: 161: Hoare triple {12389#(<= main_~n~0 5)} havoc #t~post0; {12389#(<= main_~n~0 5)} is VALID [2020-07-10 20:22:26,237 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-10 20:22:26,238 INFO L280 TraceCheckUtils]: 163: Hoare triple {12398#(<= main_~i~0 5)} ~w~0 := 0.0; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,238 INFO L280 TraceCheckUtils]: 164: Hoare triple {12398#(<= main_~i~0 5)} ~j~0 := 0; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,239 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-10 20:22:26,240 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-10 20:22:26,240 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-10 20:22:26,241 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-10 20:22:26,241 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-10 20:22:26,242 INFO L280 TraceCheckUtils]: 170: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,242 INFO L280 TraceCheckUtils]: 171: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,243 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-10 20:22:26,244 INFO L280 TraceCheckUtils]: 173: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,244 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-10 20:22:26,245 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-10 20:22:26,245 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-10 20:22:26,246 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-10 20:22:26,246 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-10 20:22:26,247 INFO L280 TraceCheckUtils]: 179: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,247 INFO L280 TraceCheckUtils]: 180: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,248 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-10 20:22:26,249 INFO L280 TraceCheckUtils]: 182: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,249 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-10 20:22:26,250 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-10 20:22:26,251 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-10 20:22:26,251 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-10 20:22:26,252 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-10 20:22:26,252 INFO L280 TraceCheckUtils]: 188: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,253 INFO L280 TraceCheckUtils]: 189: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,253 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-10 20:22:26,254 INFO L280 TraceCheckUtils]: 191: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,254 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-10 20:22:26,255 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-10 20:22:26,255 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-10 20:22:26,256 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-10 20:22:26,257 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-10 20:22:26,257 INFO L280 TraceCheckUtils]: 197: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,258 INFO L280 TraceCheckUtils]: 198: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,258 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-10 20:22:26,259 INFO L280 TraceCheckUtils]: 200: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,259 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-10 20:22:26,260 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-10 20:22:26,260 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-10 20:22:26,261 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-10 20:22:26,262 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-10 20:22:26,262 INFO L280 TraceCheckUtils]: 206: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,263 INFO L280 TraceCheckUtils]: 207: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,263 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-10 20:22:26,264 INFO L280 TraceCheckUtils]: 209: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,265 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-10 20:22:26,265 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-10 20:22:26,266 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-10 20:22:26,266 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-10 20:22:26,267 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-10 20:22:26,267 INFO L280 TraceCheckUtils]: 215: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~mem3; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,268 INFO L280 TraceCheckUtils]: 216: Hoare triple {12398#(<= main_~i~0 5)} #t~post1 := ~j~0; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,268 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-10 20:22:26,269 INFO L280 TraceCheckUtils]: 218: Hoare triple {12398#(<= main_~i~0 5)} havoc #t~post1; {12398#(<= main_~i~0 5)} is VALID [2020-07-10 20:22:26,270 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-10 20:22:26,271 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-10 20:22:26,272 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-10 20:22:26,273 INFO L280 TraceCheckUtils]: 222: Hoare triple {12400#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {12377#false} is VALID [2020-07-10 20:22:26,273 INFO L280 TraceCheckUtils]: 223: Hoare triple {12377#false} assume !false; {12377#false} is VALID [2020-07-10 20:22:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:26,322 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:26,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [46523730] [2020-07-10 20:22:26,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:26,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:22:26,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911074254] [2020-07-10 20:22:26,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2020-07-10 20:22:26,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:26,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:22:26,400 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-10 20:22:26,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:22:26,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:26,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:22:26,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:22:26,401 INFO L87 Difference]: Start difference. First operand 272 states and 290 transitions. Second operand 7 states. [2020-07-10 20:22:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:28,182 INFO L93 Difference]: Finished difference Result 272 states and 290 transitions. [2020-07-10 20:22:28,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:22:28,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2020-07-10 20:22:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-10 20:22:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-10 20:22:28,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2020-07-10 20:22:28,268 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-10 20:22:28,269 INFO L225 Difference]: With dead ends: 272 [2020-07-10 20:22:28,269 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:22:28,270 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-10 20:22:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:22:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:22:28,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:28,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:28,271 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:28,271 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:28,271 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:28,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:28,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:28,272 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:28,272 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:28,272 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:28,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:28,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:28,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:28,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:22:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:22:28,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2020-07-10 20:22:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:28,273 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:22:28,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:22:28,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:22:28,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:28,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:28,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 20:22:28,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:22:30,498 INFO L271 CegarLoopResult]: At program point L118(line 118) the Hoare annotation is: true [2020-07-10 20:22:30,498 INFO L271 CegarLoopResult]: At program point L118-1(line 118) the Hoare annotation is: true [2020-07-10 20:22:30,498 INFO L271 CegarLoopResult]: At program point L118-2(line 118) the Hoare annotation is: true [2020-07-10 20:22:30,498 INFO L271 CegarLoopResult]: At program point L118-3(line 118) the Hoare annotation is: true [2020-07-10 20:22:30,499 INFO L271 CegarLoopResult]: At program point L118-4(line 118) the Hoare annotation is: true [2020-07-10 20:22:30,499 INFO L271 CegarLoopResult]: At program point L118-5(line 118) the Hoare annotation is: true [2020-07-10 20:22:30,499 INFO L271 CegarLoopResult]: At program point L118-6(line 118) the Hoare annotation is: true [2020-07-10 20:22:30,499 INFO L271 CegarLoopResult]: At program point L118-7(line 118) the Hoare annotation is: true [2020-07-10 20:22:30,499 INFO L271 CegarLoopResult]: At program point L135(line 135) the Hoare annotation is: true [2020-07-10 20:22:30,499 INFO L271 CegarLoopResult]: At program point L135-1(line 135) the Hoare annotation is: true [2020-07-10 20:22:30,499 INFO L271 CegarLoopResult]: At program point L119(line 119) the Hoare annotation is: true [2020-07-10 20:22:30,499 INFO L271 CegarLoopResult]: At program point L119-3(lines 119 126) the Hoare annotation is: true [2020-07-10 20:22:30,500 INFO L271 CegarLoopResult]: At program point L119-4(line 119) the Hoare annotation is: true [2020-07-10 20:22:30,500 INFO L271 CegarLoopResult]: At program point L119-5(line 119) the Hoare annotation is: true [2020-07-10 20:22:30,500 INFO L271 CegarLoopResult]: At program point L119-6(lines 119 126) the Hoare annotation is: true [2020-07-10 20:22:30,500 INFO L271 CegarLoopResult]: At program point L119-7(lines 119 126) the Hoare annotation is: true [2020-07-10 20:22:30,500 INFO L271 CegarLoopResult]: At program point L136(line 136) the Hoare annotation is: true [2020-07-10 20:22:30,500 INFO L271 CegarLoopResult]: At program point L136-3(line 136) the Hoare annotation is: true [2020-07-10 20:22:30,500 INFO L271 CegarLoopResult]: At program point L136-4(line 136) the Hoare annotation is: true [2020-07-10 20:22:30,500 INFO L271 CegarLoopResult]: At program point L136-5(lines 136 142) the Hoare annotation is: true [2020-07-10 20:22:30,501 INFO L271 CegarLoopResult]: At program point L136-6(lines 136 142) the Hoare annotation is: true [2020-07-10 20:22:30,501 INFO L271 CegarLoopResult]: At program point ludcmpEXIT(lines 109 153) the Hoare annotation is: true [2020-07-10 20:22:30,501 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-10 20:22:30,501 INFO L271 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: true [2020-07-10 20:22:30,501 INFO L271 CegarLoopResult]: At program point L121-1(line 121) the Hoare annotation is: true [2020-07-10 20:22:30,501 INFO L271 CegarLoopResult]: At program point L121-2(line 121) the Hoare annotation is: true [2020-07-10 20:22:30,501 INFO L271 CegarLoopResult]: At program point L138(line 138) the Hoare annotation is: true [2020-07-10 20:22:30,502 INFO L271 CegarLoopResult]: At program point L138-1(line 138) the Hoare annotation is: true [2020-07-10 20:22:30,502 INFO L271 CegarLoopResult]: At program point L138-2(line 138) the Hoare annotation is: true [2020-07-10 20:22:30,502 INFO L271 CegarLoopResult]: At program point L122(lines 122 124) the Hoare annotation is: true [2020-07-10 20:22:30,502 INFO L271 CegarLoopResult]: At program point L122-1(lines 122 124) the Hoare annotation is: true [2020-07-10 20:22:30,502 INFO L271 CegarLoopResult]: At program point L139(line 139) the Hoare annotation is: true [2020-07-10 20:22:30,502 INFO L271 CegarLoopResult]: At program point L139-3(lines 139 140) the Hoare annotation is: true [2020-07-10 20:22:30,502 INFO L271 CegarLoopResult]: At program point L139-4(line 139) the Hoare annotation is: true [2020-07-10 20:22:30,502 INFO L271 CegarLoopResult]: At program point L139-5(line 139) the Hoare annotation is: true [2020-07-10 20:22:30,502 INFO L271 CegarLoopResult]: At program point L139-6(lines 139 140) the Hoare annotation is: true [2020-07-10 20:22:30,503 INFO L271 CegarLoopResult]: At program point L139-7(lines 139 140) the Hoare annotation is: true [2020-07-10 20:22:30,503 INFO L271 CegarLoopResult]: At program point L123(line 123) the Hoare annotation is: true [2020-07-10 20:22:30,503 INFO L271 CegarLoopResult]: At program point L123-3(lines 123 124) the Hoare annotation is: true [2020-07-10 20:22:30,503 INFO L271 CegarLoopResult]: At program point L123-4(line 123) the Hoare annotation is: true [2020-07-10 20:22:30,503 INFO L271 CegarLoopResult]: At program point L123-5(line 123) the Hoare annotation is: true [2020-07-10 20:22:30,503 INFO L271 CegarLoopResult]: At program point L123-6(lines 123 124) the Hoare annotation is: true [2020-07-10 20:22:30,503 INFO L271 CegarLoopResult]: At program point L140(line 140) the Hoare annotation is: true [2020-07-10 20:22:30,503 INFO L271 CegarLoopResult]: At program point L140-1(line 140) the Hoare annotation is: true [2020-07-10 20:22:30,504 INFO L271 CegarLoopResult]: At program point L140-2(line 140) the Hoare annotation is: true [2020-07-10 20:22:30,504 INFO L271 CegarLoopResult]: At program point L140-3(line 140) the Hoare annotation is: true [2020-07-10 20:22:30,504 INFO L271 CegarLoopResult]: At program point L140-4(line 140) the Hoare annotation is: true [2020-07-10 20:22:30,504 INFO L271 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: true [2020-07-10 20:22:30,504 INFO L271 CegarLoopResult]: At program point L124-1(line 124) the Hoare annotation is: true [2020-07-10 20:22:30,504 INFO L271 CegarLoopResult]: At program point L124-2(line 124) the Hoare annotation is: true [2020-07-10 20:22:30,504 INFO L271 CegarLoopResult]: At program point L124-3(line 124) the Hoare annotation is: true [2020-07-10 20:22:30,504 INFO L271 CegarLoopResult]: At program point L124-4(line 124) the Hoare annotation is: true [2020-07-10 20:22:30,504 INFO L271 CegarLoopResult]: At program point L141(lines 136 142) the Hoare annotation is: true [2020-07-10 20:22:30,504 INFO L271 CegarLoopResult]: At program point L125(line 125) the Hoare annotation is: true [2020-07-10 20:22:30,505 INFO L271 CegarLoopResult]: At program point L125-1(line 125) the Hoare annotation is: true [2020-07-10 20:22:30,505 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-10 20:22:30,505 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-10 20:22:30,505 INFO L271 CegarLoopResult]: At program point L143(line 143) the Hoare annotation is: true [2020-07-10 20:22:30,505 INFO L271 CegarLoopResult]: At program point L143-1(line 143) the Hoare annotation is: true [2020-07-10 20:22:30,505 INFO L271 CegarLoopResult]: At program point L143-2(line 143) the Hoare annotation is: true [2020-07-10 20:22:30,505 INFO L271 CegarLoopResult]: At program point L143-3(line 143) the Hoare annotation is: true [2020-07-10 20:22:30,506 INFO L271 CegarLoopResult]: At program point L127-2(line 127) the Hoare annotation is: true [2020-07-10 20:22:30,506 INFO L271 CegarLoopResult]: At program point L127-3(line 127) the Hoare annotation is: true [2020-07-10 20:22:30,506 INFO L271 CegarLoopResult]: At program point L127-4(lines 127 133) the Hoare annotation is: true [2020-07-10 20:22:30,506 INFO L271 CegarLoopResult]: At program point L144(line 144) the Hoare annotation is: true [2020-07-10 20:22:30,506 INFO L271 CegarLoopResult]: At program point L144-3(lines 144 150) the Hoare annotation is: true [2020-07-10 20:22:30,506 INFO L271 CegarLoopResult]: At program point L144-4(line 144) the Hoare annotation is: true [2020-07-10 20:22:30,506 INFO L271 CegarLoopResult]: At program point L144-5(line 144) the Hoare annotation is: true [2020-07-10 20:22:30,506 INFO L271 CegarLoopResult]: At program point L144-6(lines 144 150) the Hoare annotation is: true [2020-07-10 20:22:30,506 INFO L271 CegarLoopResult]: At program point L144-7(lines 144 150) the Hoare annotation is: true [2020-07-10 20:22:30,507 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-10 20:22:30,507 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-10 20:22:30,507 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-10 20:22:30,507 INFO L271 CegarLoopResult]: At program point L129(line 129) the Hoare annotation is: true [2020-07-10 20:22:30,507 INFO L271 CegarLoopResult]: At program point L129-1(line 129) the Hoare annotation is: true [2020-07-10 20:22:30,507 INFO L271 CegarLoopResult]: At program point L129-2(line 129) the Hoare annotation is: true [2020-07-10 20:22:30,507 INFO L271 CegarLoopResult]: At program point L146(line 146) the Hoare annotation is: true [2020-07-10 20:22:30,507 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-10 20:22:30,508 INFO L271 CegarLoopResult]: At program point L146-1(line 146) the Hoare annotation is: true [2020-07-10 20:22:30,508 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-10 20:22:30,508 INFO L271 CegarLoopResult]: At program point L146-2(line 146) the Hoare annotation is: true [2020-07-10 20:22:30,508 INFO L271 CegarLoopResult]: At program point L113-2(lines 110 153) the Hoare annotation is: true [2020-07-10 20:22:30,508 INFO L271 CegarLoopResult]: At program point L113-3(line 113) the Hoare annotation is: true [2020-07-10 20:22:30,508 INFO L271 CegarLoopResult]: At program point L113-4(line 113) the Hoare annotation is: true [2020-07-10 20:22:30,508 INFO L271 CegarLoopResult]: At program point L113-5(line 113) the Hoare annotation is: true [2020-07-10 20:22:30,508 INFO L271 CegarLoopResult]: At program point L113-6(line 113) the Hoare annotation is: true [2020-07-10 20:22:30,509 INFO L271 CegarLoopResult]: At program point L113-7(line 113) the Hoare annotation is: true [2020-07-10 20:22:30,509 INFO L271 CegarLoopResult]: At program point L113-8(line 113) the Hoare annotation is: true [2020-07-10 20:22:30,509 INFO L271 CegarLoopResult]: At program point ludcmpFINAL(lines 109 153) the Hoare annotation is: true [2020-07-10 20:22:30,509 INFO L271 CegarLoopResult]: At program point L130(line 130) the Hoare annotation is: true [2020-07-10 20:22:30,509 INFO L271 CegarLoopResult]: At program point L130-3(lines 130 131) the Hoare annotation is: true [2020-07-10 20:22:30,509 INFO L271 CegarLoopResult]: At program point L130-4(line 130) the Hoare annotation is: true [2020-07-10 20:22:30,509 INFO L271 CegarLoopResult]: At program point L130-5(line 130) the Hoare annotation is: true [2020-07-10 20:22:30,509 INFO L271 CegarLoopResult]: At program point L130-6(lines 130 131) the Hoare annotation is: true [2020-07-10 20:22:30,509 INFO L271 CegarLoopResult]: At program point L130-7(lines 130 131) the Hoare annotation is: true [2020-07-10 20:22:30,510 INFO L271 CegarLoopResult]: At program point L147(line 147) the Hoare annotation is: true [2020-07-10 20:22:30,510 INFO L271 CegarLoopResult]: At program point L147-3(lines 147 148) the Hoare annotation is: true [2020-07-10 20:22:30,510 INFO L271 CegarLoopResult]: At program point L147-4(line 147) the Hoare annotation is: true [2020-07-10 20:22:30,510 INFO L271 CegarLoopResult]: At program point L147-5(line 147) the Hoare annotation is: true [2020-07-10 20:22:30,510 INFO L271 CegarLoopResult]: At program point L147-6(lines 147 148) the Hoare annotation is: true [2020-07-10 20:22:30,510 INFO L271 CegarLoopResult]: At program point L147-7(lines 147 148) the Hoare annotation is: true [2020-07-10 20:22:30,510 INFO L271 CegarLoopResult]: At program point L131(line 131) the Hoare annotation is: true [2020-07-10 20:22:30,510 INFO L271 CegarLoopResult]: At program point L131-1(line 131) the Hoare annotation is: true [2020-07-10 20:22:30,510 INFO L271 CegarLoopResult]: At program point L131-2(line 131) the Hoare annotation is: true [2020-07-10 20:22:30,511 INFO L271 CegarLoopResult]: At program point L131-3(line 131) the Hoare annotation is: true [2020-07-10 20:22:30,511 INFO L271 CegarLoopResult]: At program point L131-4(line 131) the Hoare annotation is: true [2020-07-10 20:22:30,511 INFO L271 CegarLoopResult]: At program point L148(line 148) the Hoare annotation is: true [2020-07-10 20:22:30,511 INFO L271 CegarLoopResult]: At program point L115(line 115) the Hoare annotation is: true [2020-07-10 20:22:30,511 INFO L271 CegarLoopResult]: At program point L148-1(line 148) the Hoare annotation is: true [2020-07-10 20:22:30,511 INFO L271 CegarLoopResult]: At program point L148-2(line 148) the Hoare annotation is: true [2020-07-10 20:22:30,511 INFO L271 CegarLoopResult]: At program point L148-3(line 148) the Hoare annotation is: true [2020-07-10 20:22:30,512 INFO L271 CegarLoopResult]: At program point L148-4(line 148) the Hoare annotation is: true [2020-07-10 20:22:30,512 INFO L271 CegarLoopResult]: At program point L132(lines 127 133) the Hoare annotation is: true [2020-07-10 20:22:30,512 INFO L271 CegarLoopResult]: At program point L149(line 149) the Hoare annotation is: true [2020-07-10 20:22:30,512 INFO L271 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: true [2020-07-10 20:22:30,512 INFO L271 CegarLoopResult]: At program point L149-1(line 149) the Hoare annotation is: true [2020-07-10 20:22:30,512 INFO L271 CegarLoopResult]: At program point L116-3(lines 116 134) the Hoare annotation is: true [2020-07-10 20:22:30,512 INFO L271 CegarLoopResult]: At program point L116-4(line 116) the Hoare annotation is: true [2020-07-10 20:22:30,512 INFO L271 CegarLoopResult]: At program point L116-5(line 116) the Hoare annotation is: true [2020-07-10 20:22:30,513 INFO L271 CegarLoopResult]: At program point L116-6(lines 116 134) the Hoare annotation is: true [2020-07-10 20:22:30,513 INFO L271 CegarLoopResult]: At program point L116-7(lines 116 134) the Hoare annotation is: true [2020-07-10 20:22:30,513 INFO L271 CegarLoopResult]: At program point L69-4(line 69) the Hoare annotation is: true [2020-07-10 20:22:30,513 INFO L271 CegarLoopResult]: At program point L69-5(line 69) the Hoare annotation is: true [2020-07-10 20:22:30,513 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:30,513 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:30,513 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:30,513 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-10 20:22:30,514 INFO L271 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: true [2020-07-10 20:22:30,514 INFO L271 CegarLoopResult]: At program point L69-1(line 69) the Hoare annotation is: true [2020-07-10 20:22:30,514 INFO L271 CegarLoopResult]: At program point L69-2(line 69) the Hoare annotation is: true [2020-07-10 20:22:30,514 INFO L271 CegarLoopResult]: At program point L69-3(line 69) the Hoare annotation is: true [2020-07-10 20:22:30,514 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:30,514 INFO L271 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: true [2020-07-10 20:22:30,514 INFO L271 CegarLoopResult]: At program point L78(lines 78 79) the Hoare annotation is: true [2020-07-10 20:22:30,514 INFO L271 CegarLoopResult]: At program point L78-1(line 78) the Hoare annotation is: true [2020-07-10 20:22:30,515 INFO L271 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: true [2020-07-10 20:22:30,515 INFO L271 CegarLoopResult]: At program point L78-3(lines 78 79) the Hoare annotation is: true [2020-07-10 20:22:30,515 INFO L271 CegarLoopResult]: At program point fabsEXIT(lines 74 81) the Hoare annotation is: true [2020-07-10 20:22:30,515 INFO L271 CegarLoopResult]: At program point fabsENTRY(lines 74 81) the Hoare annotation is: true [2020-07-10 20:22:30,515 INFO L271 CegarLoopResult]: At program point fabsFINAL(lines 74 81) the Hoare annotation is: true [2020-07-10 20:22:30,515 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:30,515 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:30,515 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:22:30,515 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:30,516 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-10 20:22:30,516 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-10 20:22:30,516 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-10 20:22:30,516 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-10 20:22:30,516 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-10 20:22:30,516 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-10 20:22:30,516 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 83 107) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-10 20:22:30,517 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-10 20:22:30,517 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-10 20:22:30,517 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-10 20:22:30,517 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-10 20:22:30,517 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-10 20:22:30,517 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-10 20:22:30,517 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-10 20:22:30,517 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-10 20:22:30,518 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-10 20:22:30,518 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-10 20:22:30,518 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-10 20:22:30,518 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-10 20:22:30,518 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-10 20:22:30,518 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-10 20:22:30,518 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-10 20:22:30,518 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-10 20:22:30,519 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-10 20:22:30,519 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-10 20:22:30,519 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-10 20:22:30,519 INFO L264 CegarLoopResult]: At program point L91-6(lines 91 102) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-10 20:22:30,519 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 83 107) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-10 20:22:30,519 INFO L264 CegarLoopResult]: At program point L104(line 104) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-10 20:22:30,519 INFO L264 CegarLoopResult]: At program point L104-1(line 104) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-10 20:22:30,520 INFO L264 CegarLoopResult]: At program point L104-2(line 104) the Hoare annotation is: (<= 5 main_~n~0) [2020-07-10 20:22:30,520 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-10 20:22:30,520 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-10 20:22:30,520 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-10 20:22:30,520 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-10 20:22:30,520 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-10 20:22:30,520 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-10 20:22:30,521 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-10 20:22:30,521 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:30,521 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-10 20:22:30,521 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:30,521 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-10 20:22:30,564 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-10 20:22:30,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:22:30 BoogieIcfgContainer [2020-07-10 20:22:30,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:22:30,585 INFO L168 Benchmark]: Toolchain (without parser) took 37162.63 ms. Allocated memory was 138.4 MB in the beginning and 524.3 MB in the end (delta: 385.9 MB). Free memory was 102.4 MB in the beginning and 204.6 MB in the end (delta: -102.2 MB). Peak memory consumption was 283.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:30,591 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:30,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.48 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 102.2 MB in the beginning and 181.7 MB in the end (delta: -79.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:30,592 INFO L168 Benchmark]: Boogie Preprocessor took 69.79 ms. Allocated memory is still 203.4 MB. Free memory was 181.7 MB in the beginning and 178.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:30,592 INFO L168 Benchmark]: RCFGBuilder took 938.81 ms. Allocated memory is still 203.4 MB. Free memory was 178.7 MB in the beginning and 112.8 MB in the end (delta: 65.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:30,593 INFO L168 Benchmark]: TraceAbstraction took 35698.55 ms. Allocated memory was 203.4 MB in the beginning and 524.3 MB in the end (delta: 320.9 MB). Free memory was 112.8 MB in the beginning and 204.6 MB in the end (delta: -91.9 MB). Peak memory consumption was 229.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:30,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 0.28 ms. Allocated memory is still 138.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 448.48 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 102.2 MB in the beginning and 181.7 MB in the end (delta: -79.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.79 ms. Allocated memory is still 203.4 MB. Free memory was 181.7 MB in the beginning and 178.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 938.81 ms. Allocated memory is still 203.4 MB. Free memory was 178.7 MB in the beginning and 112.8 MB in the end (delta: 65.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35698.55 ms. Allocated memory was 203.4 MB in the beginning and 524.3 MB in the end (delta: 320.9 MB). Free memory was 112.8 MB in the beginning and 204.6 MB in the end (delta: -91.9 MB). Peak memory consumption was 229.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: 33.3s, OverallIterations: 11, TraceHistogramMax: 18, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 588 SDtfs, 939 SDslu, 1295 SDs, 0 SdLazy, 2119 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.1s 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 210 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 186 LocationsWithAnnotation, 544 PreInvPairs, 1012 NumberOfFragments, 654 HoareAnnotationTreeSize, 544 FomulaSimplifications, 126636 FormulaSimplificationTreeSizeReduction, 0.8s 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...