java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_maxInArray_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:56:16,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:56:16,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:56:16,106 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:56:16,106 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:56:16,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:56:16,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:56:16,111 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:56:16,113 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:56:16,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:56:16,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:56:16,115 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:56:16,116 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:56:16,117 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:56:16,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:56:16,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:56:16,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:56:16,124 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:56:16,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:56:16,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:56:16,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:56:16,141 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:56:16,147 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:56:16,147 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:56:16,147 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:56:16,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:56:16,151 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:56:16,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:56:16,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:56:16,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:56:16,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:56:16,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:56:16,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:56:16,159 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:56:16,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:56:16,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:56:16,161 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 22:56:16,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:56:16,190 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:56:16,194 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:56:16,195 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:56:16,196 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:56:16,196 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:56:16,196 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:56:16,196 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:56:16,196 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:56:16,198 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:56:16,198 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:56:16,198 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:56:16,198 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:56:16,199 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:56:16,199 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:56:16,199 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:56:16,199 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:56:16,199 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:56:16,200 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:56:16,200 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:56:16,200 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:56:16,200 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:56:16,200 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:56:16,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:56:16,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:56:16,202 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:56:16,203 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:56:16,203 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:56:16,203 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:56:16,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:56:16,203 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:56:16,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:56:16,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:56:16,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:56:16,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:56:16,289 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:56:16,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_maxInArray_true-unreach-call_ground.i [2018-11-18 22:56:16,345 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1099ee3d9/ce12981420494830997b41c26c2f4c93/FLAG324966bc4 [2018-11-18 22:56:16,777 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:56:16,778 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_maxInArray_true-unreach-call_ground.i [2018-11-18 22:56:16,784 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1099ee3d9/ce12981420494830997b41c26c2f4c93/FLAG324966bc4 [2018-11-18 22:56:17,151 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1099ee3d9/ce12981420494830997b41c26c2f4c93 [2018-11-18 22:56:17,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:56:17,163 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:56:17,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:56:17,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:56:17,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:56:17,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:56:17" (1/1) ... [2018-11-18 22:56:17,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f951978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17, skipping insertion in model container [2018-11-18 22:56:17,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:56:17" (1/1) ... [2018-11-18 22:56:17,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:56:17,210 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:56:17,461 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:56:17,466 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:56:17,489 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:56:17,513 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:56:17,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17 WrapperNode [2018-11-18 22:56:17,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:56:17,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:56:17,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:56:17,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:56:17,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17" (1/1) ... [2018-11-18 22:56:17,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17" (1/1) ... [2018-11-18 22:56:17,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17" (1/1) ... [2018-11-18 22:56:17,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17" (1/1) ... [2018-11-18 22:56:17,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17" (1/1) ... [2018-11-18 22:56:17,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17" (1/1) ... [2018-11-18 22:56:17,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17" (1/1) ... [2018-11-18 22:56:17,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:56:17,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:56:17,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:56:17,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:56:17,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17" (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 [2018-11-18 22:56:17,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:56:17,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:56:17,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:56:17,697 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:56:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:56:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:56:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:56:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:56:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:56:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:56:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:56:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:56:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:56:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:56:18,224 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:56:18,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:18 BoogieIcfgContainer [2018-11-18 22:56:18,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:56:18,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:56:18,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:56:18,230 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:56:18,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:56:17" (1/3) ... [2018-11-18 22:56:18,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2a6241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:56:18, skipping insertion in model container [2018-11-18 22:56:18,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:17" (2/3) ... [2018-11-18 22:56:18,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2a6241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:56:18, skipping insertion in model container [2018-11-18 22:56:18,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:18" (3/3) ... [2018-11-18 22:56:18,234 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_maxInArray_true-unreach-call_ground.i [2018-11-18 22:56:18,243 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:56:18,251 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:56:18,267 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:56:18,301 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:56:18,302 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:56:18,302 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:56:18,302 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:56:18,302 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:56:18,303 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:56:18,303 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:56:18,303 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:56:18,304 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:56:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-18 22:56:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:56:18,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:18,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:18,337 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:18,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2135979162, now seen corresponding path program 1 times [2018-11-18 22:56:18,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:18,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:18,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:18,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:18,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:18,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-18 22:56:18,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-18 22:56:18,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-18 22:56:18,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID [2018-11-18 22:56:18,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret4 := main(); {30#true} is VALID [2018-11-18 22:56:18,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {30#true} is VALID [2018-11-18 22:56:18,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-18 22:56:18,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} havoc ~x~0;~x~0 := 0; {31#false} is VALID [2018-11-18 22:56:18,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-18 22:56:18,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {31#false} is VALID [2018-11-18 22:56:18,500 INFO L256 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {31#false} is VALID [2018-11-18 22:56:18,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-18 22:56:18,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2018-11-18 22:56:18,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-18 22:56:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:18,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:56:18,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:56:18,513 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 22:56:18,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:18,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:56:18,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:18,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:56:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:56:18,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:56:18,634 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-18 22:56:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:18,771 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-18 22:56:18,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:56:18,772 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 22:56:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:56:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-18 22:56:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:56:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-18 22:56:18,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-18 22:56:19,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:19,231 INFO L225 Difference]: With dead ends: 44 [2018-11-18 22:56:19,231 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 22:56:19,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:56:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 22:56:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 22:56:19,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:19,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-18 22:56:19,380 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 22:56:19,380 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 22:56:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:19,384 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 22:56:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 22:56:19,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:19,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:19,385 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 22:56:19,386 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 22:56:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:19,390 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 22:56:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 22:56:19,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:19,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:19,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:19,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:56:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-18 22:56:19,396 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2018-11-18 22:56:19,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:19,397 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 22:56:19,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:56:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 22:56:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 22:56:19,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:19,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:19,398 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:19,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1051366526, now seen corresponding path program 1 times [2018-11-18 22:56:19,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:19,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:19,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:19,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {163#true} is VALID [2018-11-18 22:56:19,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {163#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {163#true} is VALID [2018-11-18 22:56:19,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2018-11-18 22:56:19,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #57#return; {163#true} is VALID [2018-11-18 22:56:19,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret4 := main(); {163#true} is VALID [2018-11-18 22:56:19,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {163#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {165#(= main_~i~0 0)} is VALID [2018-11-18 22:56:19,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {165#(= main_~i~0 0)} assume true; {165#(= main_~i~0 0)} is VALID [2018-11-18 22:56:19,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {165#(= main_~i~0 0)} assume !(~i~0 < 100000); {164#false} is VALID [2018-11-18 22:56:19,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {164#false} havoc ~x~0;~x~0 := 0; {164#false} is VALID [2018-11-18 22:56:19,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {164#false} assume true; {164#false} is VALID [2018-11-18 22:56:19,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {164#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {164#false} is VALID [2018-11-18 22:56:19,588 INFO L256 TraceCheckUtils]: 11: Hoare triple {164#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {164#false} is VALID [2018-11-18 22:56:19,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {164#false} ~cond := #in~cond; {164#false} is VALID [2018-11-18 22:56:19,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {164#false} assume 0 == ~cond; {164#false} is VALID [2018-11-18 22:56:19,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {164#false} assume !false; {164#false} is VALID [2018-11-18 22:56:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:19,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:56:19,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:56:19,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 22:56:19,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:19,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:56:19,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:19,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:56:19,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:56:19,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:56:19,672 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-18 22:56:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:19,834 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-18 22:56:19,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:56:19,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 22:56:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:56:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-18 22:56:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:56:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-18 22:56:19,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-18 22:56:20,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:20,051 INFO L225 Difference]: With dead ends: 38 [2018-11-18 22:56:20,051 INFO L226 Difference]: Without dead ends: 26 [2018-11-18 22:56:20,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:56:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-18 22:56:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-18 22:56:20,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:20,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-18 22:56:20,073 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-18 22:56:20,073 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-18 22:56:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:20,075 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-18 22:56:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-18 22:56:20,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:20,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:20,076 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-18 22:56:20,077 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-18 22:56:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:20,079 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-18 22:56:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-18 22:56:20,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:20,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:20,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:20,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:56:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-18 22:56:20,083 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2018-11-18 22:56:20,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:20,084 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-18 22:56:20,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:56:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-18 22:56:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:56:20,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:20,085 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:20,085 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:20,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1846380840, now seen corresponding path program 1 times [2018-11-18 22:56:20,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:20,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:20,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:20,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:20,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2018-11-18 22:56:20,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {303#true} is VALID [2018-11-18 22:56:20,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {303#true} assume true; {303#true} is VALID [2018-11-18 22:56:20,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {303#true} {303#true} #57#return; {303#true} is VALID [2018-11-18 22:56:20,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {303#true} call #t~ret4 := main(); {303#true} is VALID [2018-11-18 22:56:20,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {305#(= main_~i~0 0)} is VALID [2018-11-18 22:56:20,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {305#(= main_~i~0 0)} assume true; {305#(= main_~i~0 0)} is VALID [2018-11-18 22:56:20,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {305#(= main_~i~0 0)} is VALID [2018-11-18 22:56:20,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {305#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {305#(= main_~i~0 0)} is VALID [2018-11-18 22:56:20,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {305#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {306#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:20,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {306#(<= main_~i~0 1)} assume true; {306#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:20,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {306#(<= main_~i~0 1)} assume !(~i~0 < 100000); {304#false} is VALID [2018-11-18 22:56:20,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {304#false} havoc ~x~0;~x~0 := 0; {304#false} is VALID [2018-11-18 22:56:20,487 INFO L273 TraceCheckUtils]: 13: Hoare triple {304#false} assume true; {304#false} is VALID [2018-11-18 22:56:20,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {304#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {304#false} is VALID [2018-11-18 22:56:20,487 INFO L256 TraceCheckUtils]: 15: Hoare triple {304#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {304#false} is VALID [2018-11-18 22:56:20,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2018-11-18 22:56:20,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {304#false} assume 0 == ~cond; {304#false} is VALID [2018-11-18 22:56:20,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {304#false} assume !false; {304#false} is VALID [2018-11-18 22:56:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:20,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:20,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:20,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:20,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:20,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2018-11-18 22:56:20,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {303#true} is VALID [2018-11-18 22:56:20,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {303#true} assume true; {303#true} is VALID [2018-11-18 22:56:20,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {303#true} {303#true} #57#return; {303#true} is VALID [2018-11-18 22:56:20,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {303#true} call #t~ret4 := main(); {303#true} is VALID [2018-11-18 22:56:20,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {325#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:20,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {325#(<= main_~i~0 0)} assume true; {325#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:20,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {325#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:20,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {325#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {325#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:20,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {325#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {306#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:20,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {306#(<= main_~i~0 1)} assume true; {306#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:20,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {306#(<= main_~i~0 1)} assume !(~i~0 < 100000); {304#false} is VALID [2018-11-18 22:56:20,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {304#false} havoc ~x~0;~x~0 := 0; {304#false} is VALID [2018-11-18 22:56:20,687 INFO L273 TraceCheckUtils]: 13: Hoare triple {304#false} assume true; {304#false} is VALID [2018-11-18 22:56:20,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {304#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {304#false} is VALID [2018-11-18 22:56:20,688 INFO L256 TraceCheckUtils]: 15: Hoare triple {304#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {304#false} is VALID [2018-11-18 22:56:20,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2018-11-18 22:56:20,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {304#false} assume 0 == ~cond; {304#false} is VALID [2018-11-18 22:56:20,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {304#false} assume !false; {304#false} is VALID [2018-11-18 22:56:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:20,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:20,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:56:20,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-18 22:56:20,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:20,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:56:20,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:20,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:56:20,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:56:20,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:56:20,757 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2018-11-18 22:56:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:21,438 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-18 22:56:21,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:56:21,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-18 22:56:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:56:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-18 22:56:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:56:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-18 22:56:21,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2018-11-18 22:56:21,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:21,544 INFO L225 Difference]: With dead ends: 42 [2018-11-18 22:56:21,545 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 22:56:21,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:56:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 22:56:21,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-18 22:56:21,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:21,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-18 22:56:21,573 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-18 22:56:21,573 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-18 22:56:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:21,576 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-18 22:56:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 22:56:21,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:21,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:21,577 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-18 22:56:21,577 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-18 22:56:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:21,580 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-18 22:56:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 22:56:21,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:21,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:21,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:21,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:56:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-18 22:56:21,583 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 19 [2018-11-18 22:56:21,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:21,584 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-18 22:56:21,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:56:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-18 22:56:21,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:56:21,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:21,585 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:21,586 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:21,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:21,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1808656174, now seen corresponding path program 2 times [2018-11-18 22:56:21,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:21,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:21,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:21,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:21,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:21,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {517#true} call ULTIMATE.init(); {517#true} is VALID [2018-11-18 22:56:21,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {517#true} is VALID [2018-11-18 22:56:21,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2018-11-18 22:56:21,753 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #57#return; {517#true} is VALID [2018-11-18 22:56:21,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {517#true} call #t~ret4 := main(); {517#true} is VALID [2018-11-18 22:56:21,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {517#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {519#(= main_~i~0 0)} is VALID [2018-11-18 22:56:21,755 INFO L273 TraceCheckUtils]: 6: Hoare triple {519#(= main_~i~0 0)} assume true; {519#(= main_~i~0 0)} is VALID [2018-11-18 22:56:21,757 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {519#(= main_~i~0 0)} is VALID [2018-11-18 22:56:21,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {519#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {519#(= main_~i~0 0)} is VALID [2018-11-18 22:56:21,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {519#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {520#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:21,759 INFO L273 TraceCheckUtils]: 10: Hoare triple {520#(<= main_~i~0 1)} assume true; {520#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:21,760 INFO L273 TraceCheckUtils]: 11: Hoare triple {520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {520#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:21,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {520#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:21,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {520#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {521#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:21,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {521#(<= main_~i~0 2)} assume true; {521#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:21,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {521#(<= main_~i~0 2)} assume !(~i~0 < 100000); {518#false} is VALID [2018-11-18 22:56:21,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {518#false} havoc ~x~0;~x~0 := 0; {518#false} is VALID [2018-11-18 22:56:21,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {518#false} assume true; {518#false} is VALID [2018-11-18 22:56:21,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {518#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {518#false} is VALID [2018-11-18 22:56:21,767 INFO L256 TraceCheckUtils]: 19: Hoare triple {518#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {518#false} is VALID [2018-11-18 22:56:21,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {518#false} ~cond := #in~cond; {518#false} is VALID [2018-11-18 22:56:21,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {518#false} assume 0 == ~cond; {518#false} is VALID [2018-11-18 22:56:21,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {518#false} assume !false; {518#false} is VALID [2018-11-18 22:56:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:21,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:21,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:21,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:56:21,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:56:21,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:21,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:22,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {517#true} call ULTIMATE.init(); {517#true} is VALID [2018-11-18 22:56:22,001 INFO L273 TraceCheckUtils]: 1: Hoare triple {517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {517#true} is VALID [2018-11-18 22:56:22,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2018-11-18 22:56:22,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #57#return; {517#true} is VALID [2018-11-18 22:56:22,002 INFO L256 TraceCheckUtils]: 4: Hoare triple {517#true} call #t~ret4 := main(); {517#true} is VALID [2018-11-18 22:56:22,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {517#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {540#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:22,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#(<= main_~i~0 0)} assume true; {540#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:22,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {540#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:22,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {540#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:22,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {520#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {520#(<= main_~i~0 1)} assume true; {520#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {520#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,010 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {520#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {520#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {521#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:22,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {521#(<= main_~i~0 2)} assume true; {521#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:22,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {521#(<= main_~i~0 2)} assume !(~i~0 < 100000); {518#false} is VALID [2018-11-18 22:56:22,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {518#false} havoc ~x~0;~x~0 := 0; {518#false} is VALID [2018-11-18 22:56:22,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {518#false} assume true; {518#false} is VALID [2018-11-18 22:56:22,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {518#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {518#false} is VALID [2018-11-18 22:56:22,014 INFO L256 TraceCheckUtils]: 19: Hoare triple {518#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {518#false} is VALID [2018-11-18 22:56:22,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {518#false} ~cond := #in~cond; {518#false} is VALID [2018-11-18 22:56:22,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {518#false} assume 0 == ~cond; {518#false} is VALID [2018-11-18 22:56:22,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {518#false} assume !false; {518#false} is VALID [2018-11-18 22:56:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:22,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:22,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:56:22,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-18 22:56:22,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:22,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:56:22,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:22,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:56:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:56:22,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:56:22,092 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 6 states. [2018-11-18 22:56:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:22,275 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-18 22:56:22,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:56:22,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-18 22:56:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:56:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-18 22:56:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:56:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-18 22:56:22,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 52 transitions. [2018-11-18 22:56:22,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:22,371 INFO L225 Difference]: With dead ends: 46 [2018-11-18 22:56:22,372 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 22:56:22,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:56:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 22:56:22,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-18 22:56:22,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:22,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-18 22:56:22,402 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-18 22:56:22,403 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-18 22:56:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:22,405 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-18 22:56:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-18 22:56:22,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:22,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:22,406 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-18 22:56:22,406 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-18 22:56:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:22,409 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-18 22:56:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-18 22:56:22,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:22,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:22,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:22,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:56:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-18 22:56:22,412 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2018-11-18 22:56:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:22,413 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-18 22:56:22,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:56:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-18 22:56:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 22:56:22,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:22,414 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:22,414 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:22,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash 254622852, now seen corresponding path program 3 times [2018-11-18 22:56:22,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:22,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:22,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:22,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:22,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:22,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {762#true} is VALID [2018-11-18 22:56:22,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {762#true} is VALID [2018-11-18 22:56:22,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2018-11-18 22:56:22,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #57#return; {762#true} is VALID [2018-11-18 22:56:22,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret4 := main(); {762#true} is VALID [2018-11-18 22:56:22,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {764#(= main_~i~0 0)} is VALID [2018-11-18 22:56:22,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {764#(= main_~i~0 0)} assume true; {764#(= main_~i~0 0)} is VALID [2018-11-18 22:56:22,551 INFO L273 TraceCheckUtils]: 7: Hoare triple {764#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {764#(= main_~i~0 0)} is VALID [2018-11-18 22:56:22,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {764#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {764#(= main_~i~0 0)} is VALID [2018-11-18 22:56:22,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {764#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {765#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {765#(<= main_~i~0 1)} assume true; {765#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {765#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {765#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {765#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {765#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {765#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {766#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:22,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#(<= main_~i~0 2)} assume true; {766#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:22,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {766#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:22,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {766#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:22,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {766#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {767#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:22,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {767#(<= main_~i~0 3)} assume true; {767#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:22,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {767#(<= main_~i~0 3)} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-18 22:56:22,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {763#false} havoc ~x~0;~x~0 := 0; {763#false} is VALID [2018-11-18 22:56:22,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {763#false} assume true; {763#false} is VALID [2018-11-18 22:56:22,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {763#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {763#false} is VALID [2018-11-18 22:56:22,587 INFO L256 TraceCheckUtils]: 23: Hoare triple {763#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {763#false} is VALID [2018-11-18 22:56:22,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2018-11-18 22:56:22,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {763#false} assume 0 == ~cond; {763#false} is VALID [2018-11-18 22:56:22,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {763#false} assume !false; {763#false} is VALID [2018-11-18 22:56:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:22,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:22,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:22,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:56:22,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:56:22,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:22,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:22,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {762#true} is VALID [2018-11-18 22:56:22,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {762#true} is VALID [2018-11-18 22:56:22,752 INFO L273 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2018-11-18 22:56:22,752 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #57#return; {762#true} is VALID [2018-11-18 22:56:22,752 INFO L256 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret4 := main(); {762#true} is VALID [2018-11-18 22:56:22,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {786#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:22,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {786#(<= main_~i~0 0)} assume true; {786#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:22,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {786#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {786#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:22,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {786#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {786#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:22,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {786#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {765#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {765#(<= main_~i~0 1)} assume true; {765#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {765#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {765#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {765#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {765#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:22,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {765#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {766#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:22,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#(<= main_~i~0 2)} assume true; {766#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:22,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {766#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:22,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {766#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:22,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {766#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {767#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:22,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {767#(<= main_~i~0 3)} assume true; {767#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:22,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {767#(<= main_~i~0 3)} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-18 22:56:22,770 INFO L273 TraceCheckUtils]: 20: Hoare triple {763#false} havoc ~x~0;~x~0 := 0; {763#false} is VALID [2018-11-18 22:56:22,770 INFO L273 TraceCheckUtils]: 21: Hoare triple {763#false} assume true; {763#false} is VALID [2018-11-18 22:56:22,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {763#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {763#false} is VALID [2018-11-18 22:56:22,771 INFO L256 TraceCheckUtils]: 23: Hoare triple {763#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {763#false} is VALID [2018-11-18 22:56:22,772 INFO L273 TraceCheckUtils]: 24: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2018-11-18 22:56:22,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {763#false} assume 0 == ~cond; {763#false} is VALID [2018-11-18 22:56:22,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {763#false} assume !false; {763#false} is VALID [2018-11-18 22:56:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:22,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:22,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:56:22,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 22:56:22,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:22,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:56:22,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:22,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:56:22,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:56:22,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:56:22,845 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2018-11-18 22:56:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:23,012 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-18 22:56:23,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:56:23,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 22:56:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:56:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-18 22:56:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:56:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-18 22:56:23,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2018-11-18 22:56:23,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:23,148 INFO L225 Difference]: With dead ends: 50 [2018-11-18 22:56:23,148 INFO L226 Difference]: Without dead ends: 38 [2018-11-18 22:56:23,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:56:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-18 22:56:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-18 22:56:23,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:23,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2018-11-18 22:56:23,165 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2018-11-18 22:56:23,165 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2018-11-18 22:56:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:23,168 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-18 22:56:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-18 22:56:23,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:23,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:23,170 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2018-11-18 22:56:23,170 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2018-11-18 22:56:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:23,172 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-18 22:56:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-18 22:56:23,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:23,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:23,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:23,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:56:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-18 22:56:23,176 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 27 [2018-11-18 22:56:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:23,176 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-18 22:56:23,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:56:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-18 22:56:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 22:56:23,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:23,178 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:23,178 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:23,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:23,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1651116326, now seen corresponding path program 4 times [2018-11-18 22:56:23,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:23,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:23,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:23,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:23,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:23,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {1038#true} call ULTIMATE.init(); {1038#true} is VALID [2018-11-18 22:56:23,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {1038#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1038#true} is VALID [2018-11-18 22:56:23,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {1038#true} assume true; {1038#true} is VALID [2018-11-18 22:56:23,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1038#true} {1038#true} #57#return; {1038#true} is VALID [2018-11-18 22:56:23,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {1038#true} call #t~ret4 := main(); {1038#true} is VALID [2018-11-18 22:56:23,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {1038#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1040#(= main_~i~0 0)} is VALID [2018-11-18 22:56:23,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {1040#(= main_~i~0 0)} assume true; {1040#(= main_~i~0 0)} is VALID [2018-11-18 22:56:23,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {1040#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1040#(= main_~i~0 0)} is VALID [2018-11-18 22:56:23,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {1040#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1040#(= main_~i~0 0)} is VALID [2018-11-18 22:56:23,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {1040#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1041#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:23,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {1041#(<= main_~i~0 1)} assume true; {1041#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:23,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {1041#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1041#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:23,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {1041#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1041#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:23,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {1041#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1042#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:23,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {1042#(<= main_~i~0 2)} assume true; {1042#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:23,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {1042#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1042#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:23,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {1042#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1042#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:23,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {1042#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1043#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:23,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {1043#(<= main_~i~0 3)} assume true; {1043#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:23,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {1043#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1043#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:23,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {1043#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1043#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:23,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {1043#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1044#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:23,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {1044#(<= main_~i~0 4)} assume true; {1044#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:23,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {1044#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1039#false} is VALID [2018-11-18 22:56:23,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {1039#false} havoc ~x~0;~x~0 := 0; {1039#false} is VALID [2018-11-18 22:56:23,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {1039#false} assume true; {1039#false} is VALID [2018-11-18 22:56:23,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {1039#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1039#false} is VALID [2018-11-18 22:56:23,403 INFO L256 TraceCheckUtils]: 27: Hoare triple {1039#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1039#false} is VALID [2018-11-18 22:56:23,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {1039#false} ~cond := #in~cond; {1039#false} is VALID [2018-11-18 22:56:23,404 INFO L273 TraceCheckUtils]: 29: Hoare triple {1039#false} assume 0 == ~cond; {1039#false} is VALID [2018-11-18 22:56:23,404 INFO L273 TraceCheckUtils]: 30: Hoare triple {1039#false} assume !false; {1039#false} is VALID [2018-11-18 22:56:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:23,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:23,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:23,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:56:23,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:56:23,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:23,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:23,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {1038#true} call ULTIMATE.init(); {1038#true} is VALID [2018-11-18 22:56:23,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {1038#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1038#true} is VALID [2018-11-18 22:56:23,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {1038#true} assume true; {1038#true} is VALID [2018-11-18 22:56:23,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1038#true} {1038#true} #57#return; {1038#true} is VALID [2018-11-18 22:56:23,679 INFO L256 TraceCheckUtils]: 4: Hoare triple {1038#true} call #t~ret4 := main(); {1038#true} is VALID [2018-11-18 22:56:23,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {1038#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1063#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:23,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {1063#(<= main_~i~0 0)} assume true; {1063#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:23,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {1063#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1063#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:23,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {1063#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1063#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:23,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {1063#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1041#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:23,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {1041#(<= main_~i~0 1)} assume true; {1041#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:23,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {1041#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1041#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:23,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {1041#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1041#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:23,692 INFO L273 TraceCheckUtils]: 13: Hoare triple {1041#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1042#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:23,693 INFO L273 TraceCheckUtils]: 14: Hoare triple {1042#(<= main_~i~0 2)} assume true; {1042#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:23,693 INFO L273 TraceCheckUtils]: 15: Hoare triple {1042#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1042#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:23,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {1042#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1042#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:23,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {1042#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1043#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:23,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {1043#(<= main_~i~0 3)} assume true; {1043#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:23,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {1043#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1043#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:23,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {1043#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1043#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:23,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {1043#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1044#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:23,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {1044#(<= main_~i~0 4)} assume true; {1044#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:23,701 INFO L273 TraceCheckUtils]: 23: Hoare triple {1044#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1039#false} is VALID [2018-11-18 22:56:23,702 INFO L273 TraceCheckUtils]: 24: Hoare triple {1039#false} havoc ~x~0;~x~0 := 0; {1039#false} is VALID [2018-11-18 22:56:23,702 INFO L273 TraceCheckUtils]: 25: Hoare triple {1039#false} assume true; {1039#false} is VALID [2018-11-18 22:56:23,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {1039#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1039#false} is VALID [2018-11-18 22:56:23,703 INFO L256 TraceCheckUtils]: 27: Hoare triple {1039#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1039#false} is VALID [2018-11-18 22:56:23,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {1039#false} ~cond := #in~cond; {1039#false} is VALID [2018-11-18 22:56:23,703 INFO L273 TraceCheckUtils]: 29: Hoare triple {1039#false} assume 0 == ~cond; {1039#false} is VALID [2018-11-18 22:56:23,704 INFO L273 TraceCheckUtils]: 30: Hoare triple {1039#false} assume !false; {1039#false} is VALID [2018-11-18 22:56:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:23,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:23,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:56:23,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-18 22:56:23,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:23,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:56:23,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:23,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:56:23,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:56:23,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:56:23,780 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2018-11-18 22:56:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:23,977 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-18 22:56:23,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:56:23,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-18 22:56:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:56:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-18 22:56:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:56:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-18 22:56:23,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-18 22:56:24,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:24,149 INFO L225 Difference]: With dead ends: 54 [2018-11-18 22:56:24,149 INFO L226 Difference]: Without dead ends: 42 [2018-11-18 22:56:24,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:56:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-18 22:56:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-18 22:56:24,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:24,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-18 22:56:24,165 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-18 22:56:24,165 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-18 22:56:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:24,167 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-18 22:56:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-18 22:56:24,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:24,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:24,169 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-18 22:56:24,169 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-18 22:56:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:24,171 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-18 22:56:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-18 22:56:24,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:24,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:24,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:24,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:56:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-18 22:56:24,175 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 31 [2018-11-18 22:56:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:24,175 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-18 22:56:24,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:56:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-18 22:56:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:56:24,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:24,177 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:24,177 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:24,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:24,178 INFO L82 PathProgramCache]: Analyzing trace with hash -103967184, now seen corresponding path program 5 times [2018-11-18 22:56:24,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:24,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:24,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:24,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {1345#true} call ULTIMATE.init(); {1345#true} is VALID [2018-11-18 22:56:24,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {1345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1345#true} is VALID [2018-11-18 22:56:24,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {1345#true} assume true; {1345#true} is VALID [2018-11-18 22:56:24,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1345#true} {1345#true} #57#return; {1345#true} is VALID [2018-11-18 22:56:24,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {1345#true} call #t~ret4 := main(); {1345#true} is VALID [2018-11-18 22:56:24,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {1345#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1347#(= main_~i~0 0)} is VALID [2018-11-18 22:56:24,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {1347#(= main_~i~0 0)} assume true; {1347#(= main_~i~0 0)} is VALID [2018-11-18 22:56:24,391 INFO L273 TraceCheckUtils]: 7: Hoare triple {1347#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1347#(= main_~i~0 0)} is VALID [2018-11-18 22:56:24,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {1347#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1347#(= main_~i~0 0)} is VALID [2018-11-18 22:56:24,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {1347#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:24,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {1348#(<= main_~i~0 1)} assume true; {1348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:24,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {1348#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:24,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:24,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {1348#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:24,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {1349#(<= main_~i~0 2)} assume true; {1349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:24,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {1349#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:24,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {1349#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:24,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {1349#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:24,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {1350#(<= main_~i~0 3)} assume true; {1350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:24,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {1350#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:24,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {1350#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:24,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {1350#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:24,403 INFO L273 TraceCheckUtils]: 22: Hoare triple {1351#(<= main_~i~0 4)} assume true; {1351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:24,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {1351#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:24,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {1351#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:24,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {1351#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:24,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {1352#(<= main_~i~0 5)} assume true; {1352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:24,412 INFO L273 TraceCheckUtils]: 27: Hoare triple {1352#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1346#false} is VALID [2018-11-18 22:56:24,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {1346#false} havoc ~x~0;~x~0 := 0; {1346#false} is VALID [2018-11-18 22:56:24,413 INFO L273 TraceCheckUtils]: 29: Hoare triple {1346#false} assume true; {1346#false} is VALID [2018-11-18 22:56:24,413 INFO L273 TraceCheckUtils]: 30: Hoare triple {1346#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1346#false} is VALID [2018-11-18 22:56:24,413 INFO L256 TraceCheckUtils]: 31: Hoare triple {1346#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1346#false} is VALID [2018-11-18 22:56:24,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {1346#false} ~cond := #in~cond; {1346#false} is VALID [2018-11-18 22:56:24,414 INFO L273 TraceCheckUtils]: 33: Hoare triple {1346#false} assume 0 == ~cond; {1346#false} is VALID [2018-11-18 22:56:24,414 INFO L273 TraceCheckUtils]: 34: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2018-11-18 22:56:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:24,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:24,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:24,435 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:56:24,474 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:56:24,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:24,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:24,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {1345#true} call ULTIMATE.init(); {1345#true} is VALID [2018-11-18 22:56:24,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {1345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1345#true} is VALID [2018-11-18 22:56:24,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {1345#true} assume true; {1345#true} is VALID [2018-11-18 22:56:24,604 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1345#true} {1345#true} #57#return; {1345#true} is VALID [2018-11-18 22:56:24,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {1345#true} call #t~ret4 := main(); {1345#true} is VALID [2018-11-18 22:56:24,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {1345#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1371#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:24,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {1371#(<= main_~i~0 0)} assume true; {1371#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:24,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {1371#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1371#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:24,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {1371#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1371#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:24,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {1371#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:24,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {1348#(<= main_~i~0 1)} assume true; {1348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:24,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {1348#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:24,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:24,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {1348#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:24,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {1349#(<= main_~i~0 2)} assume true; {1349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:24,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {1349#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:24,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {1349#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:24,613 INFO L273 TraceCheckUtils]: 17: Hoare triple {1349#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:24,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {1350#(<= main_~i~0 3)} assume true; {1350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:24,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {1350#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:24,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {1350#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:24,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {1350#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:24,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {1351#(<= main_~i~0 4)} assume true; {1351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:24,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {1351#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:24,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {1351#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:24,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {1351#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:24,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {1352#(<= main_~i~0 5)} assume true; {1352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:24,621 INFO L273 TraceCheckUtils]: 27: Hoare triple {1352#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1346#false} is VALID [2018-11-18 22:56:24,622 INFO L273 TraceCheckUtils]: 28: Hoare triple {1346#false} havoc ~x~0;~x~0 := 0; {1346#false} is VALID [2018-11-18 22:56:24,622 INFO L273 TraceCheckUtils]: 29: Hoare triple {1346#false} assume true; {1346#false} is VALID [2018-11-18 22:56:24,622 INFO L273 TraceCheckUtils]: 30: Hoare triple {1346#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1346#false} is VALID [2018-11-18 22:56:24,623 INFO L256 TraceCheckUtils]: 31: Hoare triple {1346#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1346#false} is VALID [2018-11-18 22:56:24,623 INFO L273 TraceCheckUtils]: 32: Hoare triple {1346#false} ~cond := #in~cond; {1346#false} is VALID [2018-11-18 22:56:24,624 INFO L273 TraceCheckUtils]: 33: Hoare triple {1346#false} assume 0 == ~cond; {1346#false} is VALID [2018-11-18 22:56:24,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2018-11-18 22:56:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:24,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:24,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:56:24,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-18 22:56:24,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:24,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:56:24,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:24,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:56:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:56:24,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:56:24,703 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 9 states. [2018-11-18 22:56:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:25,014 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-18 22:56:25,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:56:25,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-18 22:56:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:56:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-18 22:56:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:56:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-18 22:56:25,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 67 transitions. [2018-11-18 22:56:25,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:25,125 INFO L225 Difference]: With dead ends: 58 [2018-11-18 22:56:25,125 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 22:56:25,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:56:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 22:56:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-18 22:56:25,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:25,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-18 22:56:25,155 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-18 22:56:25,155 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-18 22:56:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:25,158 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-18 22:56:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 22:56:25,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:25,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:25,159 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-18 22:56:25,159 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-18 22:56:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:25,161 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-18 22:56:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 22:56:25,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:25,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:25,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:25,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:56:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-18 22:56:25,164 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2018-11-18 22:56:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:25,164 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-18 22:56:25,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:56:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-18 22:56:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 22:56:25,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:25,165 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:25,166 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:25,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:25,166 INFO L82 PathProgramCache]: Analyzing trace with hash 668572294, now seen corresponding path program 6 times [2018-11-18 22:56:25,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:25,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:25,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:25,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {1683#true} call ULTIMATE.init(); {1683#true} is VALID [2018-11-18 22:56:25,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {1683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1683#true} is VALID [2018-11-18 22:56:25,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {1683#true} assume true; {1683#true} is VALID [2018-11-18 22:56:25,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1683#true} {1683#true} #57#return; {1683#true} is VALID [2018-11-18 22:56:25,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {1683#true} call #t~ret4 := main(); {1683#true} is VALID [2018-11-18 22:56:25,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {1683#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1685#(= main_~i~0 0)} is VALID [2018-11-18 22:56:25,347 INFO L273 TraceCheckUtils]: 6: Hoare triple {1685#(= main_~i~0 0)} assume true; {1685#(= main_~i~0 0)} is VALID [2018-11-18 22:56:25,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {1685#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1685#(= main_~i~0 0)} is VALID [2018-11-18 22:56:25,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {1685#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1685#(= main_~i~0 0)} is VALID [2018-11-18 22:56:25,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {1685#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1686#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:25,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {1686#(<= main_~i~0 1)} assume true; {1686#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:25,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {1686#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1686#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:25,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {1686#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1686#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:25,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {1686#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1687#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:25,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#(<= main_~i~0 2)} assume true; {1687#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:25,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1687#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:25,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1687#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:25,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1688#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:25,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {1688#(<= main_~i~0 3)} assume true; {1688#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:25,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {1688#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1688#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:25,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {1688#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1688#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:25,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {1688#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1689#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:25,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {1689#(<= main_~i~0 4)} assume true; {1689#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:25,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {1689#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1689#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:25,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {1689#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1689#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:25,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {1689#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1690#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:25,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {1690#(<= main_~i~0 5)} assume true; {1690#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:25,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {1690#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1690#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:25,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {1690#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1690#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:25,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {1690#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1691#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:25,369 INFO L273 TraceCheckUtils]: 30: Hoare triple {1691#(<= main_~i~0 6)} assume true; {1691#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:25,369 INFO L273 TraceCheckUtils]: 31: Hoare triple {1691#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1684#false} is VALID [2018-11-18 22:56:25,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {1684#false} havoc ~x~0;~x~0 := 0; {1684#false} is VALID [2018-11-18 22:56:25,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {1684#false} assume true; {1684#false} is VALID [2018-11-18 22:56:25,370 INFO L273 TraceCheckUtils]: 34: Hoare triple {1684#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1684#false} is VALID [2018-11-18 22:56:25,371 INFO L256 TraceCheckUtils]: 35: Hoare triple {1684#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1684#false} is VALID [2018-11-18 22:56:25,371 INFO L273 TraceCheckUtils]: 36: Hoare triple {1684#false} ~cond := #in~cond; {1684#false} is VALID [2018-11-18 22:56:25,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {1684#false} assume 0 == ~cond; {1684#false} is VALID [2018-11-18 22:56:25,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {1684#false} assume !false; {1684#false} is VALID [2018-11-18 22:56:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:25,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:25,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:25,386 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:56:25,501 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:56:25,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:25,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:25,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {1683#true} call ULTIMATE.init(); {1683#true} is VALID [2018-11-18 22:56:25,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {1683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1683#true} is VALID [2018-11-18 22:56:25,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {1683#true} assume true; {1683#true} is VALID [2018-11-18 22:56:25,699 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1683#true} {1683#true} #57#return; {1683#true} is VALID [2018-11-18 22:56:25,699 INFO L256 TraceCheckUtils]: 4: Hoare triple {1683#true} call #t~ret4 := main(); {1683#true} is VALID [2018-11-18 22:56:25,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {1683#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1710#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:25,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {1710#(<= main_~i~0 0)} assume true; {1710#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:25,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {1710#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1710#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:25,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {1710#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1710#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:25,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {1710#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1686#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:25,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {1686#(<= main_~i~0 1)} assume true; {1686#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:25,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {1686#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1686#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:25,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {1686#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1686#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:25,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {1686#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1687#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:25,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#(<= main_~i~0 2)} assume true; {1687#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:25,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1687#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:25,714 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1687#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:25,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1688#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:25,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {1688#(<= main_~i~0 3)} assume true; {1688#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:25,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {1688#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1688#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:25,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {1688#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1688#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:25,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {1688#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1689#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:25,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {1689#(<= main_~i~0 4)} assume true; {1689#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:25,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {1689#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1689#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:25,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {1689#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1689#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:25,720 INFO L273 TraceCheckUtils]: 25: Hoare triple {1689#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1690#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:25,721 INFO L273 TraceCheckUtils]: 26: Hoare triple {1690#(<= main_~i~0 5)} assume true; {1690#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:25,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {1690#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1690#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:25,722 INFO L273 TraceCheckUtils]: 28: Hoare triple {1690#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1690#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:25,723 INFO L273 TraceCheckUtils]: 29: Hoare triple {1690#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1691#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:25,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {1691#(<= main_~i~0 6)} assume true; {1691#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:25,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {1691#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1684#false} is VALID [2018-11-18 22:56:25,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {1684#false} havoc ~x~0;~x~0 := 0; {1684#false} is VALID [2018-11-18 22:56:25,725 INFO L273 TraceCheckUtils]: 33: Hoare triple {1684#false} assume true; {1684#false} is VALID [2018-11-18 22:56:25,726 INFO L273 TraceCheckUtils]: 34: Hoare triple {1684#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1684#false} is VALID [2018-11-18 22:56:25,726 INFO L256 TraceCheckUtils]: 35: Hoare triple {1684#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1684#false} is VALID [2018-11-18 22:56:25,726 INFO L273 TraceCheckUtils]: 36: Hoare triple {1684#false} ~cond := #in~cond; {1684#false} is VALID [2018-11-18 22:56:25,727 INFO L273 TraceCheckUtils]: 37: Hoare triple {1684#false} assume 0 == ~cond; {1684#false} is VALID [2018-11-18 22:56:25,727 INFO L273 TraceCheckUtils]: 38: Hoare triple {1684#false} assume !false; {1684#false} is VALID [2018-11-18 22:56:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:25,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:25,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 22:56:25,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-18 22:56:25,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:25,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:56:25,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:25,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:56:25,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:56:25,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:56:25,827 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 10 states. [2018-11-18 22:56:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:26,354 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-18 22:56:26,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:56:26,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-18 22:56:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:56:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2018-11-18 22:56:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:56:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2018-11-18 22:56:26,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2018-11-18 22:56:26,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:26,452 INFO L225 Difference]: With dead ends: 62 [2018-11-18 22:56:26,453 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 22:56:26,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:56:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 22:56:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-18 22:56:26,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:26,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2018-11-18 22:56:26,489 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2018-11-18 22:56:26,489 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2018-11-18 22:56:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:26,492 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-11-18 22:56:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-18 22:56:26,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:26,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:26,493 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2018-11-18 22:56:26,493 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2018-11-18 22:56:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:26,495 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-11-18 22:56:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-18 22:56:26,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:26,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:26,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:26,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:56:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-18 22:56:26,498 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 39 [2018-11-18 22:56:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:26,499 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-18 22:56:26,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:56:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-18 22:56:26,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 22:56:26,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:26,500 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:26,500 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:26,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:26,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1392540708, now seen corresponding path program 7 times [2018-11-18 22:56:26,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:26,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:26,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:26,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:26,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:26,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {2052#true} call ULTIMATE.init(); {2052#true} is VALID [2018-11-18 22:56:26,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {2052#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2052#true} is VALID [2018-11-18 22:56:26,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {2052#true} assume true; {2052#true} is VALID [2018-11-18 22:56:26,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2052#true} {2052#true} #57#return; {2052#true} is VALID [2018-11-18 22:56:26,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {2052#true} call #t~ret4 := main(); {2052#true} is VALID [2018-11-18 22:56:26,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {2052#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2054#(= main_~i~0 0)} is VALID [2018-11-18 22:56:26,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {2054#(= main_~i~0 0)} assume true; {2054#(= main_~i~0 0)} is VALID [2018-11-18 22:56:26,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {2054#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2054#(= main_~i~0 0)} is VALID [2018-11-18 22:56:26,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {2054#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2054#(= main_~i~0 0)} is VALID [2018-11-18 22:56:26,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {2054#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2055#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:26,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {2055#(<= main_~i~0 1)} assume true; {2055#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:26,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {2055#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2055#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:26,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {2055#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2055#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:26,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {2055#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2056#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:26,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {2056#(<= main_~i~0 2)} assume true; {2056#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:26,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {2056#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2056#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:26,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {2056#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2056#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:26,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {2056#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2057#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:26,928 INFO L273 TraceCheckUtils]: 18: Hoare triple {2057#(<= main_~i~0 3)} assume true; {2057#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:26,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {2057#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2057#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:26,939 INFO L273 TraceCheckUtils]: 20: Hoare triple {2057#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2057#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:26,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {2057#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2058#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:26,941 INFO L273 TraceCheckUtils]: 22: Hoare triple {2058#(<= main_~i~0 4)} assume true; {2058#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:26,941 INFO L273 TraceCheckUtils]: 23: Hoare triple {2058#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2058#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:26,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {2058#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2058#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:26,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {2058#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2059#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:26,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {2059#(<= main_~i~0 5)} assume true; {2059#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:26,943 INFO L273 TraceCheckUtils]: 27: Hoare triple {2059#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2059#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:26,955 INFO L273 TraceCheckUtils]: 28: Hoare triple {2059#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2059#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:26,956 INFO L273 TraceCheckUtils]: 29: Hoare triple {2059#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2060#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:26,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {2060#(<= main_~i~0 6)} assume true; {2060#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:26,957 INFO L273 TraceCheckUtils]: 31: Hoare triple {2060#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2060#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:26,957 INFO L273 TraceCheckUtils]: 32: Hoare triple {2060#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2060#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:26,958 INFO L273 TraceCheckUtils]: 33: Hoare triple {2060#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2061#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:26,958 INFO L273 TraceCheckUtils]: 34: Hoare triple {2061#(<= main_~i~0 7)} assume true; {2061#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:26,958 INFO L273 TraceCheckUtils]: 35: Hoare triple {2061#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2053#false} is VALID [2018-11-18 22:56:26,959 INFO L273 TraceCheckUtils]: 36: Hoare triple {2053#false} havoc ~x~0;~x~0 := 0; {2053#false} is VALID [2018-11-18 22:56:26,959 INFO L273 TraceCheckUtils]: 37: Hoare triple {2053#false} assume true; {2053#false} is VALID [2018-11-18 22:56:26,959 INFO L273 TraceCheckUtils]: 38: Hoare triple {2053#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2053#false} is VALID [2018-11-18 22:56:26,959 INFO L256 TraceCheckUtils]: 39: Hoare triple {2053#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2053#false} is VALID [2018-11-18 22:56:26,960 INFO L273 TraceCheckUtils]: 40: Hoare triple {2053#false} ~cond := #in~cond; {2053#false} is VALID [2018-11-18 22:56:26,960 INFO L273 TraceCheckUtils]: 41: Hoare triple {2053#false} assume 0 == ~cond; {2053#false} is VALID [2018-11-18 22:56:26,960 INFO L273 TraceCheckUtils]: 42: Hoare triple {2053#false} assume !false; {2053#false} is VALID [2018-11-18 22:56:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:26,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:26,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:26,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:27,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:27,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {2052#true} call ULTIMATE.init(); {2052#true} is VALID [2018-11-18 22:56:27,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {2052#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2052#true} is VALID [2018-11-18 22:56:27,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {2052#true} assume true; {2052#true} is VALID [2018-11-18 22:56:27,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2052#true} {2052#true} #57#return; {2052#true} is VALID [2018-11-18 22:56:27,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {2052#true} call #t~ret4 := main(); {2052#true} is VALID [2018-11-18 22:56:27,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {2052#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2080#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:27,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {2080#(<= main_~i~0 0)} assume true; {2080#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:27,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {2080#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2080#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:27,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {2080#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2080#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:27,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {2080#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2055#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:27,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {2055#(<= main_~i~0 1)} assume true; {2055#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:27,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {2055#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2055#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:27,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {2055#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2055#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:27,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {2055#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2056#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:27,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {2056#(<= main_~i~0 2)} assume true; {2056#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:27,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {2056#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2056#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:27,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {2056#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2056#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:27,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {2056#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2057#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:27,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {2057#(<= main_~i~0 3)} assume true; {2057#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:27,151 INFO L273 TraceCheckUtils]: 19: Hoare triple {2057#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2057#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:27,151 INFO L273 TraceCheckUtils]: 20: Hoare triple {2057#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2057#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:27,152 INFO L273 TraceCheckUtils]: 21: Hoare triple {2057#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2058#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:27,153 INFO L273 TraceCheckUtils]: 22: Hoare triple {2058#(<= main_~i~0 4)} assume true; {2058#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:27,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {2058#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2058#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:27,154 INFO L273 TraceCheckUtils]: 24: Hoare triple {2058#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2058#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:27,155 INFO L273 TraceCheckUtils]: 25: Hoare triple {2058#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2059#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:27,155 INFO L273 TraceCheckUtils]: 26: Hoare triple {2059#(<= main_~i~0 5)} assume true; {2059#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:27,156 INFO L273 TraceCheckUtils]: 27: Hoare triple {2059#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2059#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:27,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {2059#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2059#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:27,157 INFO L273 TraceCheckUtils]: 29: Hoare triple {2059#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2060#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:27,158 INFO L273 TraceCheckUtils]: 30: Hoare triple {2060#(<= main_~i~0 6)} assume true; {2060#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:27,158 INFO L273 TraceCheckUtils]: 31: Hoare triple {2060#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2060#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:27,159 INFO L273 TraceCheckUtils]: 32: Hoare triple {2060#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2060#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:27,160 INFO L273 TraceCheckUtils]: 33: Hoare triple {2060#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2061#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:27,160 INFO L273 TraceCheckUtils]: 34: Hoare triple {2061#(<= main_~i~0 7)} assume true; {2061#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:27,161 INFO L273 TraceCheckUtils]: 35: Hoare triple {2061#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2053#false} is VALID [2018-11-18 22:56:27,161 INFO L273 TraceCheckUtils]: 36: Hoare triple {2053#false} havoc ~x~0;~x~0 := 0; {2053#false} is VALID [2018-11-18 22:56:27,162 INFO L273 TraceCheckUtils]: 37: Hoare triple {2053#false} assume true; {2053#false} is VALID [2018-11-18 22:56:27,162 INFO L273 TraceCheckUtils]: 38: Hoare triple {2053#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2053#false} is VALID [2018-11-18 22:56:27,162 INFO L256 TraceCheckUtils]: 39: Hoare triple {2053#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2053#false} is VALID [2018-11-18 22:56:27,162 INFO L273 TraceCheckUtils]: 40: Hoare triple {2053#false} ~cond := #in~cond; {2053#false} is VALID [2018-11-18 22:56:27,162 INFO L273 TraceCheckUtils]: 41: Hoare triple {2053#false} assume 0 == ~cond; {2053#false} is VALID [2018-11-18 22:56:27,163 INFO L273 TraceCheckUtils]: 42: Hoare triple {2053#false} assume !false; {2053#false} is VALID [2018-11-18 22:56:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:27,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:27,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:56:27,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-18 22:56:27,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:27,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:56:27,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:27,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:56:27,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:56:27,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:56:27,378 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 11 states. [2018-11-18 22:56:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:27,773 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-18 22:56:27,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:56:27,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-18 22:56:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:56:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2018-11-18 22:56:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:56:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2018-11-18 22:56:27,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 77 transitions. [2018-11-18 22:56:27,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:27,858 INFO L225 Difference]: With dead ends: 66 [2018-11-18 22:56:27,858 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 22:56:27,859 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:56:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 22:56:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-18 22:56:27,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:27,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-18 22:56:27,877 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-18 22:56:27,877 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-18 22:56:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:27,879 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-11-18 22:56:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-18 22:56:27,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:27,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:27,880 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-18 22:56:27,880 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-18 22:56:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:27,882 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-11-18 22:56:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-18 22:56:27,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:27,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:27,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:27,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 22:56:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-11-18 22:56:27,885 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 43 [2018-11-18 22:56:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:27,885 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-11-18 22:56:27,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:56:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-18 22:56:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 22:56:27,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:27,886 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:27,887 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:27,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash -272313806, now seen corresponding path program 8 times [2018-11-18 22:56:27,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:27,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:27,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:27,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:27,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:28,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2018-11-18 22:56:28,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {2452#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2452#true} is VALID [2018-11-18 22:56:28,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2018-11-18 22:56:28,152 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #57#return; {2452#true} is VALID [2018-11-18 22:56:28,152 INFO L256 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret4 := main(); {2452#true} is VALID [2018-11-18 22:56:28,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {2452#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2454#(= main_~i~0 0)} is VALID [2018-11-18 22:56:28,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {2454#(= main_~i~0 0)} assume true; {2454#(= main_~i~0 0)} is VALID [2018-11-18 22:56:28,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {2454#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2454#(= main_~i~0 0)} is VALID [2018-11-18 22:56:28,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {2454#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2454#(= main_~i~0 0)} is VALID [2018-11-18 22:56:28,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {2454#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2455#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:28,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {2455#(<= main_~i~0 1)} assume true; {2455#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:28,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {2455#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2455#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:28,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {2455#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2455#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:28,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {2455#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2456#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:28,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {2456#(<= main_~i~0 2)} assume true; {2456#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:28,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {2456#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2456#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:28,161 INFO L273 TraceCheckUtils]: 16: Hoare triple {2456#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2456#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:28,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {2456#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2457#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:28,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {2457#(<= main_~i~0 3)} assume true; {2457#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:28,163 INFO L273 TraceCheckUtils]: 19: Hoare triple {2457#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2457#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:28,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {2457#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2457#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:28,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {2457#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2458#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:28,165 INFO L273 TraceCheckUtils]: 22: Hoare triple {2458#(<= main_~i~0 4)} assume true; {2458#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:28,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {2458#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2458#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:28,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {2458#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2458#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:28,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {2458#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2459#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:28,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {2459#(<= main_~i~0 5)} assume true; {2459#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:28,168 INFO L273 TraceCheckUtils]: 27: Hoare triple {2459#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2459#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:28,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {2459#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2459#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:28,169 INFO L273 TraceCheckUtils]: 29: Hoare triple {2459#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2460#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:28,170 INFO L273 TraceCheckUtils]: 30: Hoare triple {2460#(<= main_~i~0 6)} assume true; {2460#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:28,190 INFO L273 TraceCheckUtils]: 31: Hoare triple {2460#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2460#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:28,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {2460#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2460#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:28,212 INFO L273 TraceCheckUtils]: 33: Hoare triple {2460#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2461#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:28,213 INFO L273 TraceCheckUtils]: 34: Hoare triple {2461#(<= main_~i~0 7)} assume true; {2461#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:28,213 INFO L273 TraceCheckUtils]: 35: Hoare triple {2461#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2461#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:28,214 INFO L273 TraceCheckUtils]: 36: Hoare triple {2461#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2461#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:28,214 INFO L273 TraceCheckUtils]: 37: Hoare triple {2461#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2462#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:28,214 INFO L273 TraceCheckUtils]: 38: Hoare triple {2462#(<= main_~i~0 8)} assume true; {2462#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:28,215 INFO L273 TraceCheckUtils]: 39: Hoare triple {2462#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2453#false} is VALID [2018-11-18 22:56:28,215 INFO L273 TraceCheckUtils]: 40: Hoare triple {2453#false} havoc ~x~0;~x~0 := 0; {2453#false} is VALID [2018-11-18 22:56:28,215 INFO L273 TraceCheckUtils]: 41: Hoare triple {2453#false} assume true; {2453#false} is VALID [2018-11-18 22:56:28,215 INFO L273 TraceCheckUtils]: 42: Hoare triple {2453#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2453#false} is VALID [2018-11-18 22:56:28,215 INFO L256 TraceCheckUtils]: 43: Hoare triple {2453#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2453#false} is VALID [2018-11-18 22:56:28,216 INFO L273 TraceCheckUtils]: 44: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2018-11-18 22:56:28,216 INFO L273 TraceCheckUtils]: 45: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2018-11-18 22:56:28,216 INFO L273 TraceCheckUtils]: 46: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2018-11-18 22:56:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:28,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:28,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:28,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:56:28,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:56:28,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:28,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:28,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2018-11-18 22:56:28,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {2452#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2452#true} is VALID [2018-11-18 22:56:28,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2018-11-18 22:56:28,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #57#return; {2452#true} is VALID [2018-11-18 22:56:28,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret4 := main(); {2452#true} is VALID [2018-11-18 22:56:28,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {2452#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2481#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:28,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {2481#(<= main_~i~0 0)} assume true; {2481#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:28,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {2481#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2481#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:28,708 INFO L273 TraceCheckUtils]: 8: Hoare triple {2481#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2481#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:28,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {2481#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2455#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:28,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {2455#(<= main_~i~0 1)} assume true; {2455#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:28,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {2455#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2455#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:28,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {2455#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2455#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:28,710 INFO L273 TraceCheckUtils]: 13: Hoare triple {2455#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2456#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:28,711 INFO L273 TraceCheckUtils]: 14: Hoare triple {2456#(<= main_~i~0 2)} assume true; {2456#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:28,711 INFO L273 TraceCheckUtils]: 15: Hoare triple {2456#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2456#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:28,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {2456#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2456#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:28,713 INFO L273 TraceCheckUtils]: 17: Hoare triple {2456#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2457#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:28,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {2457#(<= main_~i~0 3)} assume true; {2457#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:28,714 INFO L273 TraceCheckUtils]: 19: Hoare triple {2457#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2457#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:28,715 INFO L273 TraceCheckUtils]: 20: Hoare triple {2457#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2457#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:28,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {2457#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2458#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:28,720 INFO L273 TraceCheckUtils]: 22: Hoare triple {2458#(<= main_~i~0 4)} assume true; {2458#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:28,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {2458#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2458#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:28,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {2458#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2458#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:28,721 INFO L273 TraceCheckUtils]: 25: Hoare triple {2458#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2459#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:28,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {2459#(<= main_~i~0 5)} assume true; {2459#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:28,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {2459#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2459#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:28,723 INFO L273 TraceCheckUtils]: 28: Hoare triple {2459#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2459#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:28,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {2459#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2460#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:28,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {2460#(<= main_~i~0 6)} assume true; {2460#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:28,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {2460#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2460#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:28,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {2460#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2460#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:28,727 INFO L273 TraceCheckUtils]: 33: Hoare triple {2460#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2461#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:28,727 INFO L273 TraceCheckUtils]: 34: Hoare triple {2461#(<= main_~i~0 7)} assume true; {2461#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:28,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {2461#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2461#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:28,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {2461#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2461#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:28,729 INFO L273 TraceCheckUtils]: 37: Hoare triple {2461#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2462#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:28,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {2462#(<= main_~i~0 8)} assume true; {2462#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:28,731 INFO L273 TraceCheckUtils]: 39: Hoare triple {2462#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2453#false} is VALID [2018-11-18 22:56:28,731 INFO L273 TraceCheckUtils]: 40: Hoare triple {2453#false} havoc ~x~0;~x~0 := 0; {2453#false} is VALID [2018-11-18 22:56:28,732 INFO L273 TraceCheckUtils]: 41: Hoare triple {2453#false} assume true; {2453#false} is VALID [2018-11-18 22:56:28,732 INFO L273 TraceCheckUtils]: 42: Hoare triple {2453#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2453#false} is VALID [2018-11-18 22:56:28,732 INFO L256 TraceCheckUtils]: 43: Hoare triple {2453#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2453#false} is VALID [2018-11-18 22:56:28,732 INFO L273 TraceCheckUtils]: 44: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2018-11-18 22:56:28,732 INFO L273 TraceCheckUtils]: 45: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2018-11-18 22:56:28,733 INFO L273 TraceCheckUtils]: 46: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2018-11-18 22:56:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:28,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:28,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:56:28,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-18 22:56:28,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:28,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:56:28,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:28,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:56:28,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:56:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:56:28,806 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 12 states. [2018-11-18 22:56:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:29,053 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-18 22:56:29,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:56:29,053 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-18 22:56:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:56:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-18 22:56:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:56:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-18 22:56:29,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2018-11-18 22:56:29,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:29,130 INFO L225 Difference]: With dead ends: 70 [2018-11-18 22:56:29,131 INFO L226 Difference]: Without dead ends: 58 [2018-11-18 22:56:29,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:56:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-18 22:56:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-18 22:56:29,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:29,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-18 22:56:29,151 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-18 22:56:29,151 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-18 22:56:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:29,153 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-18 22:56:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-18 22:56:29,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:29,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:29,154 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-18 22:56:29,154 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-18 22:56:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:29,156 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-18 22:56:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-18 22:56:29,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:29,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:29,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:29,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 22:56:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-11-18 22:56:29,159 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 47 [2018-11-18 22:56:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:29,159 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-18 22:56:29,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:56:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-11-18 22:56:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 22:56:29,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:29,160 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:29,160 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:29,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:29,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1745943160, now seen corresponding path program 9 times [2018-11-18 22:56:29,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:29,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:29,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:29,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:29,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:29,334 INFO L256 TraceCheckUtils]: 0: Hoare triple {2883#true} call ULTIMATE.init(); {2883#true} is VALID [2018-11-18 22:56:29,334 INFO L273 TraceCheckUtils]: 1: Hoare triple {2883#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2883#true} is VALID [2018-11-18 22:56:29,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {2883#true} assume true; {2883#true} is VALID [2018-11-18 22:56:29,335 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2883#true} {2883#true} #57#return; {2883#true} is VALID [2018-11-18 22:56:29,335 INFO L256 TraceCheckUtils]: 4: Hoare triple {2883#true} call #t~ret4 := main(); {2883#true} is VALID [2018-11-18 22:56:29,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {2883#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2885#(= main_~i~0 0)} is VALID [2018-11-18 22:56:29,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {2885#(= main_~i~0 0)} assume true; {2885#(= main_~i~0 0)} is VALID [2018-11-18 22:56:29,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {2885#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2885#(= main_~i~0 0)} is VALID [2018-11-18 22:56:29,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {2885#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2885#(= main_~i~0 0)} is VALID [2018-11-18 22:56:29,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {2885#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2886#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:29,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {2886#(<= main_~i~0 1)} assume true; {2886#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:29,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {2886#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2886#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:29,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {2886#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2886#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:29,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {2886#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2887#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:29,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {2887#(<= main_~i~0 2)} assume true; {2887#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:29,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {2887#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2887#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:29,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {2887#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2887#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:29,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {2887#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2888#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:29,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {2888#(<= main_~i~0 3)} assume true; {2888#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:29,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {2888#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2888#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:29,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {2888#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2888#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:29,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {2888#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2889#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:29,346 INFO L273 TraceCheckUtils]: 22: Hoare triple {2889#(<= main_~i~0 4)} assume true; {2889#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:29,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {2889#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2889#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:29,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {2889#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2889#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:29,348 INFO L273 TraceCheckUtils]: 25: Hoare triple {2889#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2890#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:29,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {2890#(<= main_~i~0 5)} assume true; {2890#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:29,349 INFO L273 TraceCheckUtils]: 27: Hoare triple {2890#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2890#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:29,349 INFO L273 TraceCheckUtils]: 28: Hoare triple {2890#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2890#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:29,350 INFO L273 TraceCheckUtils]: 29: Hoare triple {2890#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2891#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:29,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {2891#(<= main_~i~0 6)} assume true; {2891#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:29,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {2891#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2891#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:29,352 INFO L273 TraceCheckUtils]: 32: Hoare triple {2891#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2891#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:29,353 INFO L273 TraceCheckUtils]: 33: Hoare triple {2891#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2892#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:29,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {2892#(<= main_~i~0 7)} assume true; {2892#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:29,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {2892#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2892#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:29,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {2892#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2892#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:29,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {2892#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2893#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:29,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {2893#(<= main_~i~0 8)} assume true; {2893#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:29,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {2893#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2893#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:29,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {2893#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2893#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:29,357 INFO L273 TraceCheckUtils]: 41: Hoare triple {2893#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2894#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:29,358 INFO L273 TraceCheckUtils]: 42: Hoare triple {2894#(<= main_~i~0 9)} assume true; {2894#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:29,359 INFO L273 TraceCheckUtils]: 43: Hoare triple {2894#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2884#false} is VALID [2018-11-18 22:56:29,359 INFO L273 TraceCheckUtils]: 44: Hoare triple {2884#false} havoc ~x~0;~x~0 := 0; {2884#false} is VALID [2018-11-18 22:56:29,359 INFO L273 TraceCheckUtils]: 45: Hoare triple {2884#false} assume true; {2884#false} is VALID [2018-11-18 22:56:29,359 INFO L273 TraceCheckUtils]: 46: Hoare triple {2884#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2884#false} is VALID [2018-11-18 22:56:29,360 INFO L256 TraceCheckUtils]: 47: Hoare triple {2884#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2884#false} is VALID [2018-11-18 22:56:29,360 INFO L273 TraceCheckUtils]: 48: Hoare triple {2884#false} ~cond := #in~cond; {2884#false} is VALID [2018-11-18 22:56:29,360 INFO L273 TraceCheckUtils]: 49: Hoare triple {2884#false} assume 0 == ~cond; {2884#false} is VALID [2018-11-18 22:56:29,360 INFO L273 TraceCheckUtils]: 50: Hoare triple {2884#false} assume !false; {2884#false} is VALID [2018-11-18 22:56:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:29,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:29,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:29,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:56:29,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 22:56:29,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:29,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:29,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {2883#true} call ULTIMATE.init(); {2883#true} is VALID [2018-11-18 22:56:29,549 INFO L273 TraceCheckUtils]: 1: Hoare triple {2883#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2883#true} is VALID [2018-11-18 22:56:29,550 INFO L273 TraceCheckUtils]: 2: Hoare triple {2883#true} assume true; {2883#true} is VALID [2018-11-18 22:56:29,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2883#true} {2883#true} #57#return; {2883#true} is VALID [2018-11-18 22:56:29,550 INFO L256 TraceCheckUtils]: 4: Hoare triple {2883#true} call #t~ret4 := main(); {2883#true} is VALID [2018-11-18 22:56:29,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {2883#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2913#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:29,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {2913#(<= main_~i~0 0)} assume true; {2913#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:29,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {2913#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2913#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:29,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {2913#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2913#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:29,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {2913#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2886#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:29,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {2886#(<= main_~i~0 1)} assume true; {2886#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:29,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {2886#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2886#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:29,554 INFO L273 TraceCheckUtils]: 12: Hoare triple {2886#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2886#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:29,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {2886#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2887#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:29,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {2887#(<= main_~i~0 2)} assume true; {2887#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:29,556 INFO L273 TraceCheckUtils]: 15: Hoare triple {2887#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2887#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:29,556 INFO L273 TraceCheckUtils]: 16: Hoare triple {2887#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2887#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:29,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {2887#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2888#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:29,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {2888#(<= main_~i~0 3)} assume true; {2888#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:29,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {2888#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2888#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:29,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {2888#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2888#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:29,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {2888#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2889#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:29,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {2889#(<= main_~i~0 4)} assume true; {2889#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:29,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {2889#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2889#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:29,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {2889#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2889#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:29,568 INFO L273 TraceCheckUtils]: 25: Hoare triple {2889#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2890#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:29,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {2890#(<= main_~i~0 5)} assume true; {2890#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:29,569 INFO L273 TraceCheckUtils]: 27: Hoare triple {2890#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2890#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:29,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {2890#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2890#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:29,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {2890#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2891#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:29,570 INFO L273 TraceCheckUtils]: 30: Hoare triple {2891#(<= main_~i~0 6)} assume true; {2891#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:29,570 INFO L273 TraceCheckUtils]: 31: Hoare triple {2891#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2891#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:29,571 INFO L273 TraceCheckUtils]: 32: Hoare triple {2891#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2891#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:29,571 INFO L273 TraceCheckUtils]: 33: Hoare triple {2891#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2892#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:29,572 INFO L273 TraceCheckUtils]: 34: Hoare triple {2892#(<= main_~i~0 7)} assume true; {2892#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:29,572 INFO L273 TraceCheckUtils]: 35: Hoare triple {2892#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2892#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:29,573 INFO L273 TraceCheckUtils]: 36: Hoare triple {2892#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2892#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:29,573 INFO L273 TraceCheckUtils]: 37: Hoare triple {2892#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2893#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:29,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {2893#(<= main_~i~0 8)} assume true; {2893#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:29,575 INFO L273 TraceCheckUtils]: 39: Hoare triple {2893#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2893#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:29,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {2893#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2893#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:29,576 INFO L273 TraceCheckUtils]: 41: Hoare triple {2893#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2894#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:29,576 INFO L273 TraceCheckUtils]: 42: Hoare triple {2894#(<= main_~i~0 9)} assume true; {2894#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:29,577 INFO L273 TraceCheckUtils]: 43: Hoare triple {2894#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2884#false} is VALID [2018-11-18 22:56:29,577 INFO L273 TraceCheckUtils]: 44: Hoare triple {2884#false} havoc ~x~0;~x~0 := 0; {2884#false} is VALID [2018-11-18 22:56:29,578 INFO L273 TraceCheckUtils]: 45: Hoare triple {2884#false} assume true; {2884#false} is VALID [2018-11-18 22:56:29,578 INFO L273 TraceCheckUtils]: 46: Hoare triple {2884#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2884#false} is VALID [2018-11-18 22:56:29,578 INFO L256 TraceCheckUtils]: 47: Hoare triple {2884#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2884#false} is VALID [2018-11-18 22:56:29,578 INFO L273 TraceCheckUtils]: 48: Hoare triple {2884#false} ~cond := #in~cond; {2884#false} is VALID [2018-11-18 22:56:29,579 INFO L273 TraceCheckUtils]: 49: Hoare triple {2884#false} assume 0 == ~cond; {2884#false} is VALID [2018-11-18 22:56:29,579 INFO L273 TraceCheckUtils]: 50: Hoare triple {2884#false} assume !false; {2884#false} is VALID [2018-11-18 22:56:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:29,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:29,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 22:56:29,603 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-11-18 22:56:29,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:29,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:56:29,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:29,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:56:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:56:29,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:56:29,763 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 13 states. [2018-11-18 22:56:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:30,076 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2018-11-18 22:56:30,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:56:30,077 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-11-18 22:56:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:56:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2018-11-18 22:56:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:56:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2018-11-18 22:56:30,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 87 transitions. [2018-11-18 22:56:30,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:30,208 INFO L225 Difference]: With dead ends: 74 [2018-11-18 22:56:30,208 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 22:56:30,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:56:30,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 22:56:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-18 22:56:30,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:30,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-18 22:56:30,245 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-18 22:56:30,245 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-18 22:56:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:30,247 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-18 22:56:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-18 22:56:30,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:30,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:30,248 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-18 22:56:30,248 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-18 22:56:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:30,250 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-18 22:56:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-18 22:56:30,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:30,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:30,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:30,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 22:56:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-11-18 22:56:30,252 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 51 [2018-11-18 22:56:30,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:30,252 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-18 22:56:30,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:56:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-18 22:56:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 22:56:30,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:30,253 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:30,253 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:30,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:30,254 INFO L82 PathProgramCache]: Analyzing trace with hash -293364258, now seen corresponding path program 10 times [2018-11-18 22:56:30,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:30,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:30,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:30,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:30,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:30,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {3345#true} call ULTIMATE.init(); {3345#true} is VALID [2018-11-18 22:56:30,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {3345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3345#true} is VALID [2018-11-18 22:56:30,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {3345#true} assume true; {3345#true} is VALID [2018-11-18 22:56:30,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3345#true} {3345#true} #57#return; {3345#true} is VALID [2018-11-18 22:56:30,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {3345#true} call #t~ret4 := main(); {3345#true} is VALID [2018-11-18 22:56:30,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {3345#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {3347#(= main_~i~0 0)} is VALID [2018-11-18 22:56:30,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {3347#(= main_~i~0 0)} assume true; {3347#(= main_~i~0 0)} is VALID [2018-11-18 22:56:30,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {3347#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3347#(= main_~i~0 0)} is VALID [2018-11-18 22:56:30,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {3347#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3347#(= main_~i~0 0)} is VALID [2018-11-18 22:56:30,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {3347#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:30,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {3348#(<= main_~i~0 1)} assume true; {3348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:30,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {3348#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:30,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {3348#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:30,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {3348#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:30,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {3349#(<= main_~i~0 2)} assume true; {3349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:30,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {3349#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:30,498 INFO L273 TraceCheckUtils]: 16: Hoare triple {3349#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:30,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {3349#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:30,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {3350#(<= main_~i~0 3)} assume true; {3350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:30,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {3350#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:30,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {3350#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:30,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {3350#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:30,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {3351#(<= main_~i~0 4)} assume true; {3351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:30,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {3351#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:30,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {3351#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:30,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {3351#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:30,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {3352#(<= main_~i~0 5)} assume true; {3352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:30,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {3352#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:30,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {3352#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:30,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {3352#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3353#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:30,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {3353#(<= main_~i~0 6)} assume true; {3353#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:30,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {3353#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3353#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:30,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {3353#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3353#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:30,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {3353#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3354#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:30,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {3354#(<= main_~i~0 7)} assume true; {3354#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:30,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {3354#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3354#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:30,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {3354#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3354#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:30,511 INFO L273 TraceCheckUtils]: 37: Hoare triple {3354#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3355#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:30,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {3355#(<= main_~i~0 8)} assume true; {3355#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:30,512 INFO L273 TraceCheckUtils]: 39: Hoare triple {3355#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3355#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:30,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {3355#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3355#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:30,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {3355#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3356#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:30,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {3356#(<= main_~i~0 9)} assume true; {3356#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:30,515 INFO L273 TraceCheckUtils]: 43: Hoare triple {3356#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3356#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:30,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {3356#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3356#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:30,516 INFO L273 TraceCheckUtils]: 45: Hoare triple {3356#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3357#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:30,517 INFO L273 TraceCheckUtils]: 46: Hoare triple {3357#(<= main_~i~0 10)} assume true; {3357#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:30,518 INFO L273 TraceCheckUtils]: 47: Hoare triple {3357#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3346#false} is VALID [2018-11-18 22:56:30,518 INFO L273 TraceCheckUtils]: 48: Hoare triple {3346#false} havoc ~x~0;~x~0 := 0; {3346#false} is VALID [2018-11-18 22:56:30,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {3346#false} assume true; {3346#false} is VALID [2018-11-18 22:56:30,519 INFO L273 TraceCheckUtils]: 50: Hoare triple {3346#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3346#false} is VALID [2018-11-18 22:56:30,519 INFO L256 TraceCheckUtils]: 51: Hoare triple {3346#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {3346#false} is VALID [2018-11-18 22:56:30,519 INFO L273 TraceCheckUtils]: 52: Hoare triple {3346#false} ~cond := #in~cond; {3346#false} is VALID [2018-11-18 22:56:30,519 INFO L273 TraceCheckUtils]: 53: Hoare triple {3346#false} assume 0 == ~cond; {3346#false} is VALID [2018-11-18 22:56:30,520 INFO L273 TraceCheckUtils]: 54: Hoare triple {3346#false} assume !false; {3346#false} is VALID [2018-11-18 22:56:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:30,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:30,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:30,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:56:30,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:56:30,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:30,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:30,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {3345#true} call ULTIMATE.init(); {3345#true} is VALID [2018-11-18 22:56:30,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {3345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3345#true} is VALID [2018-11-18 22:56:30,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {3345#true} assume true; {3345#true} is VALID [2018-11-18 22:56:30,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3345#true} {3345#true} #57#return; {3345#true} is VALID [2018-11-18 22:56:30,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {3345#true} call #t~ret4 := main(); {3345#true} is VALID [2018-11-18 22:56:30,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {3345#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {3376#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:30,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {3376#(<= main_~i~0 0)} assume true; {3376#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:30,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {3376#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3376#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:30,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {3376#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3376#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:30,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {3376#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:30,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {3348#(<= main_~i~0 1)} assume true; {3348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:30,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {3348#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:30,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {3348#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3348#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:30,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {3348#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:30,832 INFO L273 TraceCheckUtils]: 14: Hoare triple {3349#(<= main_~i~0 2)} assume true; {3349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:30,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {3349#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:30,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {3349#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3349#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:30,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {3349#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:30,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {3350#(<= main_~i~0 3)} assume true; {3350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:30,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {3350#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:30,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {3350#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3350#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:30,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {3350#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:30,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {3351#(<= main_~i~0 4)} assume true; {3351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:30,836 INFO L273 TraceCheckUtils]: 23: Hoare triple {3351#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:30,837 INFO L273 TraceCheckUtils]: 24: Hoare triple {3351#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3351#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:30,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {3351#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:30,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {3352#(<= main_~i~0 5)} assume true; {3352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:30,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {3352#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:30,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {3352#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3352#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:30,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {3352#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3353#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:30,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {3353#(<= main_~i~0 6)} assume true; {3353#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:30,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {3353#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3353#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:30,841 INFO L273 TraceCheckUtils]: 32: Hoare triple {3353#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3353#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:30,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {3353#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3354#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:30,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {3354#(<= main_~i~0 7)} assume true; {3354#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:30,843 INFO L273 TraceCheckUtils]: 35: Hoare triple {3354#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3354#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:30,844 INFO L273 TraceCheckUtils]: 36: Hoare triple {3354#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3354#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:30,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {3354#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3355#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:30,845 INFO L273 TraceCheckUtils]: 38: Hoare triple {3355#(<= main_~i~0 8)} assume true; {3355#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:30,846 INFO L273 TraceCheckUtils]: 39: Hoare triple {3355#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3355#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:30,846 INFO L273 TraceCheckUtils]: 40: Hoare triple {3355#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3355#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:30,847 INFO L273 TraceCheckUtils]: 41: Hoare triple {3355#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3356#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:30,848 INFO L273 TraceCheckUtils]: 42: Hoare triple {3356#(<= main_~i~0 9)} assume true; {3356#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:30,848 INFO L273 TraceCheckUtils]: 43: Hoare triple {3356#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3356#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:30,849 INFO L273 TraceCheckUtils]: 44: Hoare triple {3356#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3356#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:30,849 INFO L273 TraceCheckUtils]: 45: Hoare triple {3356#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3357#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:30,850 INFO L273 TraceCheckUtils]: 46: Hoare triple {3357#(<= main_~i~0 10)} assume true; {3357#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:30,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {3357#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3346#false} is VALID [2018-11-18 22:56:30,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {3346#false} havoc ~x~0;~x~0 := 0; {3346#false} is VALID [2018-11-18 22:56:30,851 INFO L273 TraceCheckUtils]: 49: Hoare triple {3346#false} assume true; {3346#false} is VALID [2018-11-18 22:56:30,851 INFO L273 TraceCheckUtils]: 50: Hoare triple {3346#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3346#false} is VALID [2018-11-18 22:56:30,852 INFO L256 TraceCheckUtils]: 51: Hoare triple {3346#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {3346#false} is VALID [2018-11-18 22:56:30,852 INFO L273 TraceCheckUtils]: 52: Hoare triple {3346#false} ~cond := #in~cond; {3346#false} is VALID [2018-11-18 22:56:30,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {3346#false} assume 0 == ~cond; {3346#false} is VALID [2018-11-18 22:56:30,852 INFO L273 TraceCheckUtils]: 54: Hoare triple {3346#false} assume !false; {3346#false} is VALID [2018-11-18 22:56:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:30,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:30,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:56:30,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-18 22:56:30,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:30,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:56:30,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:30,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:56:30,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:56:30,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:56:30,932 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 14 states. [2018-11-18 22:56:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:31,284 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-11-18 22:56:31,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:56:31,285 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-18 22:56:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:56:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2018-11-18 22:56:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:56:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2018-11-18 22:56:31,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 92 transitions. [2018-11-18 22:56:31,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:31,400 INFO L225 Difference]: With dead ends: 78 [2018-11-18 22:56:31,401 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 22:56:31,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:56:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 22:56:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-18 22:56:31,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:31,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2018-11-18 22:56:31,430 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2018-11-18 22:56:31,430 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2018-11-18 22:56:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:31,431 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2018-11-18 22:56:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-18 22:56:31,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:31,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:31,432 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2018-11-18 22:56:31,432 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2018-11-18 22:56:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:31,433 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2018-11-18 22:56:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-18 22:56:31,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:31,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:31,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:31,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 22:56:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-11-18 22:56:31,435 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 55 [2018-11-18 22:56:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:31,435 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-18 22:56:31,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:56:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-11-18 22:56:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 22:56:31,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:31,436 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:31,436 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:31,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1036524340, now seen corresponding path program 11 times [2018-11-18 22:56:31,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:31,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:31,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:31,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:31,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:32,200 INFO L256 TraceCheckUtils]: 0: Hoare triple {3838#true} call ULTIMATE.init(); {3838#true} is VALID [2018-11-18 22:56:32,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {3838#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3838#true} is VALID [2018-11-18 22:56:32,201 INFO L273 TraceCheckUtils]: 2: Hoare triple {3838#true} assume true; {3838#true} is VALID [2018-11-18 22:56:32,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3838#true} {3838#true} #57#return; {3838#true} is VALID [2018-11-18 22:56:32,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {3838#true} call #t~ret4 := main(); {3838#true} is VALID [2018-11-18 22:56:32,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {3838#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {3840#(= main_~i~0 0)} is VALID [2018-11-18 22:56:32,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {3840#(= main_~i~0 0)} assume true; {3840#(= main_~i~0 0)} is VALID [2018-11-18 22:56:32,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {3840#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3840#(= main_~i~0 0)} is VALID [2018-11-18 22:56:32,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {3840#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3840#(= main_~i~0 0)} is VALID [2018-11-18 22:56:32,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {3840#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3841#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:32,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {3841#(<= main_~i~0 1)} assume true; {3841#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:32,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {3841#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3841#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:32,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {3841#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3841#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:32,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {3841#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3842#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:32,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {3842#(<= main_~i~0 2)} assume true; {3842#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:32,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {3842#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3842#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:32,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {3842#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3842#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:32,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {3842#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3843#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:32,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {3843#(<= main_~i~0 3)} assume true; {3843#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:32,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {3843#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3843#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:32,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {3843#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3843#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:32,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {3843#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3844#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:32,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {3844#(<= main_~i~0 4)} assume true; {3844#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:32,322 INFO L273 TraceCheckUtils]: 23: Hoare triple {3844#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3844#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:32,322 INFO L273 TraceCheckUtils]: 24: Hoare triple {3844#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3844#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:32,323 INFO L273 TraceCheckUtils]: 25: Hoare triple {3844#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3845#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:32,323 INFO L273 TraceCheckUtils]: 26: Hoare triple {3845#(<= main_~i~0 5)} assume true; {3845#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:32,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {3845#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3845#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:32,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {3845#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3845#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:32,325 INFO L273 TraceCheckUtils]: 29: Hoare triple {3845#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3846#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:32,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {3846#(<= main_~i~0 6)} assume true; {3846#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:32,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {3846#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3846#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:32,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {3846#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3846#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:32,327 INFO L273 TraceCheckUtils]: 33: Hoare triple {3846#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3847#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:32,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {3847#(<= main_~i~0 7)} assume true; {3847#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:32,328 INFO L273 TraceCheckUtils]: 35: Hoare triple {3847#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3847#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:32,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {3847#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3847#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:32,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {3847#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3848#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:32,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {3848#(<= main_~i~0 8)} assume true; {3848#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:32,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {3848#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3848#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:32,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {3848#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3848#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:32,332 INFO L273 TraceCheckUtils]: 41: Hoare triple {3848#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3849#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:32,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {3849#(<= main_~i~0 9)} assume true; {3849#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:32,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {3849#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3849#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:32,334 INFO L273 TraceCheckUtils]: 44: Hoare triple {3849#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3849#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:32,334 INFO L273 TraceCheckUtils]: 45: Hoare triple {3849#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3850#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:32,335 INFO L273 TraceCheckUtils]: 46: Hoare triple {3850#(<= main_~i~0 10)} assume true; {3850#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:32,336 INFO L273 TraceCheckUtils]: 47: Hoare triple {3850#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3850#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:32,336 INFO L273 TraceCheckUtils]: 48: Hoare triple {3850#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3850#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:32,337 INFO L273 TraceCheckUtils]: 49: Hoare triple {3850#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3851#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:32,337 INFO L273 TraceCheckUtils]: 50: Hoare triple {3851#(<= main_~i~0 11)} assume true; {3851#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:32,338 INFO L273 TraceCheckUtils]: 51: Hoare triple {3851#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3839#false} is VALID [2018-11-18 22:56:32,338 INFO L273 TraceCheckUtils]: 52: Hoare triple {3839#false} havoc ~x~0;~x~0 := 0; {3839#false} is VALID [2018-11-18 22:56:32,339 INFO L273 TraceCheckUtils]: 53: Hoare triple {3839#false} assume true; {3839#false} is VALID [2018-11-18 22:56:32,339 INFO L273 TraceCheckUtils]: 54: Hoare triple {3839#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3839#false} is VALID [2018-11-18 22:56:32,339 INFO L256 TraceCheckUtils]: 55: Hoare triple {3839#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {3839#false} is VALID [2018-11-18 22:56:32,339 INFO L273 TraceCheckUtils]: 56: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2018-11-18 22:56:32,339 INFO L273 TraceCheckUtils]: 57: Hoare triple {3839#false} assume 0 == ~cond; {3839#false} is VALID [2018-11-18 22:56:32,340 INFO L273 TraceCheckUtils]: 58: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2018-11-18 22:56:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:32,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:32,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:32,351 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:56:32,384 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 22:56:32,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:32,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:32,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {3838#true} call ULTIMATE.init(); {3838#true} is VALID [2018-11-18 22:56:32,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {3838#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3838#true} is VALID [2018-11-18 22:56:32,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {3838#true} assume true; {3838#true} is VALID [2018-11-18 22:56:32,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3838#true} {3838#true} #57#return; {3838#true} is VALID [2018-11-18 22:56:32,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {3838#true} call #t~ret4 := main(); {3838#true} is VALID [2018-11-18 22:56:32,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {3838#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {3870#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:32,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {3870#(<= main_~i~0 0)} assume true; {3870#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:32,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {3870#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3870#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:32,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {3870#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3870#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:32,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {3870#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3841#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:32,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {3841#(<= main_~i~0 1)} assume true; {3841#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:32,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {3841#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3841#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:32,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {3841#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3841#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:32,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {3841#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3842#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:32,653 INFO L273 TraceCheckUtils]: 14: Hoare triple {3842#(<= main_~i~0 2)} assume true; {3842#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:32,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {3842#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3842#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:32,654 INFO L273 TraceCheckUtils]: 16: Hoare triple {3842#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3842#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:32,655 INFO L273 TraceCheckUtils]: 17: Hoare triple {3842#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3843#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:32,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {3843#(<= main_~i~0 3)} assume true; {3843#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:32,656 INFO L273 TraceCheckUtils]: 19: Hoare triple {3843#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3843#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:32,657 INFO L273 TraceCheckUtils]: 20: Hoare triple {3843#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3843#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:32,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {3843#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3844#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:32,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {3844#(<= main_~i~0 4)} assume true; {3844#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:32,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {3844#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3844#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:32,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {3844#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3844#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:32,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {3844#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3845#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:32,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {3845#(<= main_~i~0 5)} assume true; {3845#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:32,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {3845#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3845#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:32,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {3845#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3845#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:32,664 INFO L273 TraceCheckUtils]: 29: Hoare triple {3845#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3846#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:32,664 INFO L273 TraceCheckUtils]: 30: Hoare triple {3846#(<= main_~i~0 6)} assume true; {3846#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:32,665 INFO L273 TraceCheckUtils]: 31: Hoare triple {3846#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3846#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:32,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {3846#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3846#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:32,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {3846#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3847#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:32,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {3847#(<= main_~i~0 7)} assume true; {3847#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:32,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {3847#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3847#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:32,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {3847#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3847#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:32,669 INFO L273 TraceCheckUtils]: 37: Hoare triple {3847#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3848#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:32,670 INFO L273 TraceCheckUtils]: 38: Hoare triple {3848#(<= main_~i~0 8)} assume true; {3848#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:32,670 INFO L273 TraceCheckUtils]: 39: Hoare triple {3848#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3848#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:32,671 INFO L273 TraceCheckUtils]: 40: Hoare triple {3848#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3848#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:32,672 INFO L273 TraceCheckUtils]: 41: Hoare triple {3848#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3849#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:32,673 INFO L273 TraceCheckUtils]: 42: Hoare triple {3849#(<= main_~i~0 9)} assume true; {3849#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:32,673 INFO L273 TraceCheckUtils]: 43: Hoare triple {3849#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3849#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:32,674 INFO L273 TraceCheckUtils]: 44: Hoare triple {3849#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3849#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:32,675 INFO L273 TraceCheckUtils]: 45: Hoare triple {3849#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3850#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:32,675 INFO L273 TraceCheckUtils]: 46: Hoare triple {3850#(<= main_~i~0 10)} assume true; {3850#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:32,676 INFO L273 TraceCheckUtils]: 47: Hoare triple {3850#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3850#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:32,677 INFO L273 TraceCheckUtils]: 48: Hoare triple {3850#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3850#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:32,677 INFO L273 TraceCheckUtils]: 49: Hoare triple {3850#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3851#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:32,678 INFO L273 TraceCheckUtils]: 50: Hoare triple {3851#(<= main_~i~0 11)} assume true; {3851#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:32,679 INFO L273 TraceCheckUtils]: 51: Hoare triple {3851#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3839#false} is VALID [2018-11-18 22:56:32,679 INFO L273 TraceCheckUtils]: 52: Hoare triple {3839#false} havoc ~x~0;~x~0 := 0; {3839#false} is VALID [2018-11-18 22:56:32,679 INFO L273 TraceCheckUtils]: 53: Hoare triple {3839#false} assume true; {3839#false} is VALID [2018-11-18 22:56:32,680 INFO L273 TraceCheckUtils]: 54: Hoare triple {3839#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3839#false} is VALID [2018-11-18 22:56:32,680 INFO L256 TraceCheckUtils]: 55: Hoare triple {3839#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {3839#false} is VALID [2018-11-18 22:56:32,680 INFO L273 TraceCheckUtils]: 56: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2018-11-18 22:56:32,681 INFO L273 TraceCheckUtils]: 57: Hoare triple {3839#false} assume 0 == ~cond; {3839#false} is VALID [2018-11-18 22:56:32,681 INFO L273 TraceCheckUtils]: 58: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2018-11-18 22:56:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:32,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:32,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:56:32,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-18 22:56:32,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:32,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:56:32,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:32,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:56:32,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:56:32,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:56:32,785 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 15 states. [2018-11-18 22:56:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:33,131 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2018-11-18 22:56:33,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:56:33,131 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-18 22:56:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:56:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2018-11-18 22:56:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:56:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2018-11-18 22:56:33,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 97 transitions. [2018-11-18 22:56:33,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:33,282 INFO L225 Difference]: With dead ends: 82 [2018-11-18 22:56:33,282 INFO L226 Difference]: Without dead ends: 70 [2018-11-18 22:56:33,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:56:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-18 22:56:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-18 22:56:33,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:33,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 68 states. [2018-11-18 22:56:33,304 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 68 states. [2018-11-18 22:56:33,304 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 68 states. [2018-11-18 22:56:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:33,306 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2018-11-18 22:56:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-11-18 22:56:33,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:33,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:33,307 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 70 states. [2018-11-18 22:56:33,307 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 70 states. [2018-11-18 22:56:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:33,309 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2018-11-18 22:56:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-11-18 22:56:33,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:33,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:33,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:33,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 22:56:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-11-18 22:56:33,312 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 59 [2018-11-18 22:56:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:33,312 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-11-18 22:56:33,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:56:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-11-18 22:56:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 22:56:33,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:33,313 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:33,314 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:33,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:33,314 INFO L82 PathProgramCache]: Analyzing trace with hash 826408330, now seen corresponding path program 12 times [2018-11-18 22:56:33,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:33,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:33,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:33,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:33,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:33,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {4362#true} call ULTIMATE.init(); {4362#true} is VALID [2018-11-18 22:56:33,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {4362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4362#true} is VALID [2018-11-18 22:56:33,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {4362#true} assume true; {4362#true} is VALID [2018-11-18 22:56:33,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4362#true} {4362#true} #57#return; {4362#true} is VALID [2018-11-18 22:56:33,986 INFO L256 TraceCheckUtils]: 4: Hoare triple {4362#true} call #t~ret4 := main(); {4362#true} is VALID [2018-11-18 22:56:33,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {4362#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {4364#(= main_~i~0 0)} is VALID [2018-11-18 22:56:33,987 INFO L273 TraceCheckUtils]: 6: Hoare triple {4364#(= main_~i~0 0)} assume true; {4364#(= main_~i~0 0)} is VALID [2018-11-18 22:56:33,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {4364#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4364#(= main_~i~0 0)} is VALID [2018-11-18 22:56:33,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {4364#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4364#(= main_~i~0 0)} is VALID [2018-11-18 22:56:33,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {4364#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4365#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:33,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {4365#(<= main_~i~0 1)} assume true; {4365#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:33,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {4365#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4365#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:33,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {4365#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4365#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:33,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {4365#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4366#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:33,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {4366#(<= main_~i~0 2)} assume true; {4366#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:33,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {4366#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4366#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:33,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {4366#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4366#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:33,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {4366#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4367#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:33,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {4367#(<= main_~i~0 3)} assume true; {4367#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:33,995 INFO L273 TraceCheckUtils]: 19: Hoare triple {4367#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4367#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:33,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {4367#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4367#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:33,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {4367#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4368#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:33,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {4368#(<= main_~i~0 4)} assume true; {4368#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:33,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {4368#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4368#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:33,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {4368#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4368#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:33,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {4368#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4369#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:33,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {4369#(<= main_~i~0 5)} assume true; {4369#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:34,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {4369#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4369#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:34,002 INFO L273 TraceCheckUtils]: 28: Hoare triple {4369#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4369#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:34,003 INFO L273 TraceCheckUtils]: 29: Hoare triple {4369#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4370#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:34,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {4370#(<= main_~i~0 6)} assume true; {4370#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:34,004 INFO L273 TraceCheckUtils]: 31: Hoare triple {4370#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4370#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:34,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {4370#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4370#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:34,005 INFO L273 TraceCheckUtils]: 33: Hoare triple {4370#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4371#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:34,005 INFO L273 TraceCheckUtils]: 34: Hoare triple {4371#(<= main_~i~0 7)} assume true; {4371#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:34,006 INFO L273 TraceCheckUtils]: 35: Hoare triple {4371#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4371#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:34,006 INFO L273 TraceCheckUtils]: 36: Hoare triple {4371#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4371#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:34,006 INFO L273 TraceCheckUtils]: 37: Hoare triple {4371#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4372#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:34,007 INFO L273 TraceCheckUtils]: 38: Hoare triple {4372#(<= main_~i~0 8)} assume true; {4372#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:34,007 INFO L273 TraceCheckUtils]: 39: Hoare triple {4372#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4372#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:34,008 INFO L273 TraceCheckUtils]: 40: Hoare triple {4372#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4372#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:34,009 INFO L273 TraceCheckUtils]: 41: Hoare triple {4372#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4373#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:34,009 INFO L273 TraceCheckUtils]: 42: Hoare triple {4373#(<= main_~i~0 9)} assume true; {4373#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:34,010 INFO L273 TraceCheckUtils]: 43: Hoare triple {4373#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4373#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:34,010 INFO L273 TraceCheckUtils]: 44: Hoare triple {4373#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4373#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:34,011 INFO L273 TraceCheckUtils]: 45: Hoare triple {4373#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4374#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:34,012 INFO L273 TraceCheckUtils]: 46: Hoare triple {4374#(<= main_~i~0 10)} assume true; {4374#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:34,012 INFO L273 TraceCheckUtils]: 47: Hoare triple {4374#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4374#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:34,013 INFO L273 TraceCheckUtils]: 48: Hoare triple {4374#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4374#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:34,013 INFO L273 TraceCheckUtils]: 49: Hoare triple {4374#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4375#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:34,014 INFO L273 TraceCheckUtils]: 50: Hoare triple {4375#(<= main_~i~0 11)} assume true; {4375#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:34,015 INFO L273 TraceCheckUtils]: 51: Hoare triple {4375#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4375#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:34,015 INFO L273 TraceCheckUtils]: 52: Hoare triple {4375#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4375#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:34,016 INFO L273 TraceCheckUtils]: 53: Hoare triple {4375#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4376#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:34,016 INFO L273 TraceCheckUtils]: 54: Hoare triple {4376#(<= main_~i~0 12)} assume true; {4376#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:34,017 INFO L273 TraceCheckUtils]: 55: Hoare triple {4376#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4363#false} is VALID [2018-11-18 22:56:34,017 INFO L273 TraceCheckUtils]: 56: Hoare triple {4363#false} havoc ~x~0;~x~0 := 0; {4363#false} is VALID [2018-11-18 22:56:34,018 INFO L273 TraceCheckUtils]: 57: Hoare triple {4363#false} assume true; {4363#false} is VALID [2018-11-18 22:56:34,018 INFO L273 TraceCheckUtils]: 58: Hoare triple {4363#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4363#false} is VALID [2018-11-18 22:56:34,018 INFO L256 TraceCheckUtils]: 59: Hoare triple {4363#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {4363#false} is VALID [2018-11-18 22:56:34,018 INFO L273 TraceCheckUtils]: 60: Hoare triple {4363#false} ~cond := #in~cond; {4363#false} is VALID [2018-11-18 22:56:34,019 INFO L273 TraceCheckUtils]: 61: Hoare triple {4363#false} assume 0 == ~cond; {4363#false} is VALID [2018-11-18 22:56:34,019 INFO L273 TraceCheckUtils]: 62: Hoare triple {4363#false} assume !false; {4363#false} is VALID [2018-11-18 22:56:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:34,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:34,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:34,032 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:56:34,070 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-18 22:56:34,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:34,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:34,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {4362#true} call ULTIMATE.init(); {4362#true} is VALID [2018-11-18 22:56:34,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {4362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4362#true} is VALID [2018-11-18 22:56:34,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {4362#true} assume true; {4362#true} is VALID [2018-11-18 22:56:34,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4362#true} {4362#true} #57#return; {4362#true} is VALID [2018-11-18 22:56:34,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {4362#true} call #t~ret4 := main(); {4362#true} is VALID [2018-11-18 22:56:34,300 INFO L273 TraceCheckUtils]: 5: Hoare triple {4362#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {4395#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:34,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {4395#(<= main_~i~0 0)} assume true; {4395#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:34,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {4395#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4395#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:34,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {4395#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4395#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:34,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {4395#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4365#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:34,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {4365#(<= main_~i~0 1)} assume true; {4365#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:34,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {4365#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4365#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:34,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {4365#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4365#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:34,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {4365#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4366#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:34,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {4366#(<= main_~i~0 2)} assume true; {4366#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:34,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {4366#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4366#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:34,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {4366#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4366#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:34,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {4366#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4367#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:34,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {4367#(<= main_~i~0 3)} assume true; {4367#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:34,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {4367#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4367#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:34,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {4367#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4367#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:34,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {4367#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4368#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:34,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {4368#(<= main_~i~0 4)} assume true; {4368#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:34,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {4368#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4368#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:34,310 INFO L273 TraceCheckUtils]: 24: Hoare triple {4368#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4368#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:34,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {4368#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4369#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:34,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {4369#(<= main_~i~0 5)} assume true; {4369#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:34,312 INFO L273 TraceCheckUtils]: 27: Hoare triple {4369#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4369#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:34,312 INFO L273 TraceCheckUtils]: 28: Hoare triple {4369#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4369#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:34,313 INFO L273 TraceCheckUtils]: 29: Hoare triple {4369#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4370#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:34,313 INFO L273 TraceCheckUtils]: 30: Hoare triple {4370#(<= main_~i~0 6)} assume true; {4370#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:34,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {4370#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4370#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:34,315 INFO L273 TraceCheckUtils]: 32: Hoare triple {4370#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4370#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:34,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {4370#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4371#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:34,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {4371#(<= main_~i~0 7)} assume true; {4371#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:34,316 INFO L273 TraceCheckUtils]: 35: Hoare triple {4371#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4371#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:34,317 INFO L273 TraceCheckUtils]: 36: Hoare triple {4371#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4371#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:34,318 INFO L273 TraceCheckUtils]: 37: Hoare triple {4371#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4372#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:34,318 INFO L273 TraceCheckUtils]: 38: Hoare triple {4372#(<= main_~i~0 8)} assume true; {4372#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:34,319 INFO L273 TraceCheckUtils]: 39: Hoare triple {4372#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4372#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:34,319 INFO L273 TraceCheckUtils]: 40: Hoare triple {4372#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4372#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:34,320 INFO L273 TraceCheckUtils]: 41: Hoare triple {4372#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4373#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:34,321 INFO L273 TraceCheckUtils]: 42: Hoare triple {4373#(<= main_~i~0 9)} assume true; {4373#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:34,321 INFO L273 TraceCheckUtils]: 43: Hoare triple {4373#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4373#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:34,322 INFO L273 TraceCheckUtils]: 44: Hoare triple {4373#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4373#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:34,322 INFO L273 TraceCheckUtils]: 45: Hoare triple {4373#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4374#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:34,323 INFO L273 TraceCheckUtils]: 46: Hoare triple {4374#(<= main_~i~0 10)} assume true; {4374#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:34,324 INFO L273 TraceCheckUtils]: 47: Hoare triple {4374#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4374#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:34,324 INFO L273 TraceCheckUtils]: 48: Hoare triple {4374#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4374#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:34,325 INFO L273 TraceCheckUtils]: 49: Hoare triple {4374#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4375#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:34,325 INFO L273 TraceCheckUtils]: 50: Hoare triple {4375#(<= main_~i~0 11)} assume true; {4375#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:34,326 INFO L273 TraceCheckUtils]: 51: Hoare triple {4375#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4375#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:34,326 INFO L273 TraceCheckUtils]: 52: Hoare triple {4375#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4375#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:34,327 INFO L273 TraceCheckUtils]: 53: Hoare triple {4375#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4376#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:34,328 INFO L273 TraceCheckUtils]: 54: Hoare triple {4376#(<= main_~i~0 12)} assume true; {4376#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:34,328 INFO L273 TraceCheckUtils]: 55: Hoare triple {4376#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4363#false} is VALID [2018-11-18 22:56:34,329 INFO L273 TraceCheckUtils]: 56: Hoare triple {4363#false} havoc ~x~0;~x~0 := 0; {4363#false} is VALID [2018-11-18 22:56:34,329 INFO L273 TraceCheckUtils]: 57: Hoare triple {4363#false} assume true; {4363#false} is VALID [2018-11-18 22:56:34,329 INFO L273 TraceCheckUtils]: 58: Hoare triple {4363#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4363#false} is VALID [2018-11-18 22:56:34,329 INFO L256 TraceCheckUtils]: 59: Hoare triple {4363#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {4363#false} is VALID [2018-11-18 22:56:34,329 INFO L273 TraceCheckUtils]: 60: Hoare triple {4363#false} ~cond := #in~cond; {4363#false} is VALID [2018-11-18 22:56:34,330 INFO L273 TraceCheckUtils]: 61: Hoare triple {4363#false} assume 0 == ~cond; {4363#false} is VALID [2018-11-18 22:56:34,330 INFO L273 TraceCheckUtils]: 62: Hoare triple {4363#false} assume !false; {4363#false} is VALID [2018-11-18 22:56:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:34,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:34,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-18 22:56:34,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-11-18 22:56:34,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:34,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:56:34,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:34,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:56:34,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:56:34,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:56:34,436 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 16 states. [2018-11-18 22:56:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:35,062 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2018-11-18 22:56:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 22:56:35,062 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-11-18 22:56:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:56:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2018-11-18 22:56:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:56:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2018-11-18 22:56:35,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 102 transitions. [2018-11-18 22:56:35,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:35,689 INFO L225 Difference]: With dead ends: 86 [2018-11-18 22:56:35,689 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 22:56:35,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:56:35,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 22:56:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-18 22:56:36,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:36,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-18 22:56:36,104 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-18 22:56:36,104 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-18 22:56:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:36,106 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2018-11-18 22:56:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-18 22:56:36,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:36,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:36,106 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-18 22:56:36,107 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-18 22:56:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:36,108 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2018-11-18 22:56:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-18 22:56:36,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:36,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:36,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:36,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:36,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 22:56:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-11-18 22:56:36,111 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 63 [2018-11-18 22:56:36,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:36,111 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2018-11-18 22:56:36,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:56:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2018-11-18 22:56:36,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 22:56:36,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:36,112 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:36,112 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:36,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:36,113 INFO L82 PathProgramCache]: Analyzing trace with hash 901170400, now seen corresponding path program 13 times [2018-11-18 22:56:36,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:36,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:36,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:36,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:36,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:36,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {4917#true} call ULTIMATE.init(); {4917#true} is VALID [2018-11-18 22:56:36,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {4917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4917#true} is VALID [2018-11-18 22:56:36,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {4917#true} assume true; {4917#true} is VALID [2018-11-18 22:56:36,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4917#true} {4917#true} #57#return; {4917#true} is VALID [2018-11-18 22:56:36,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {4917#true} call #t~ret4 := main(); {4917#true} is VALID [2018-11-18 22:56:36,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {4917#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {4919#(= main_~i~0 0)} is VALID [2018-11-18 22:56:36,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {4919#(= main_~i~0 0)} assume true; {4919#(= main_~i~0 0)} is VALID [2018-11-18 22:56:36,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {4919#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4919#(= main_~i~0 0)} is VALID [2018-11-18 22:56:36,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {4919#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4919#(= main_~i~0 0)} is VALID [2018-11-18 22:56:36,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {4919#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4920#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:36,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {4920#(<= main_~i~0 1)} assume true; {4920#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:36,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {4920#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4920#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:36,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {4920#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4920#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:36,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {4920#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4921#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:36,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {4921#(<= main_~i~0 2)} assume true; {4921#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:36,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {4921#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4921#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:36,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {4921#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4921#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:36,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {4921#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4922#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:36,829 INFO L273 TraceCheckUtils]: 18: Hoare triple {4922#(<= main_~i~0 3)} assume true; {4922#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:36,830 INFO L273 TraceCheckUtils]: 19: Hoare triple {4922#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4922#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:36,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {4922#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4922#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:36,831 INFO L273 TraceCheckUtils]: 21: Hoare triple {4922#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4923#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:36,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {4923#(<= main_~i~0 4)} assume true; {4923#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:36,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {4923#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4923#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:36,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {4923#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4923#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:36,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {4923#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4924#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:36,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {4924#(<= main_~i~0 5)} assume true; {4924#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:36,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {4924#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4924#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:36,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {4924#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4924#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:36,835 INFO L273 TraceCheckUtils]: 29: Hoare triple {4924#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4925#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:36,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {4925#(<= main_~i~0 6)} assume true; {4925#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:36,836 INFO L273 TraceCheckUtils]: 31: Hoare triple {4925#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4925#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:36,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {4925#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4925#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:36,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {4925#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4926#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:36,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {4926#(<= main_~i~0 7)} assume true; {4926#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:36,838 INFO L273 TraceCheckUtils]: 35: Hoare triple {4926#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4926#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:36,839 INFO L273 TraceCheckUtils]: 36: Hoare triple {4926#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4926#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:36,840 INFO L273 TraceCheckUtils]: 37: Hoare triple {4926#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4927#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:36,840 INFO L273 TraceCheckUtils]: 38: Hoare triple {4927#(<= main_~i~0 8)} assume true; {4927#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:36,841 INFO L273 TraceCheckUtils]: 39: Hoare triple {4927#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4927#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:36,841 INFO L273 TraceCheckUtils]: 40: Hoare triple {4927#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4927#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:36,842 INFO L273 TraceCheckUtils]: 41: Hoare triple {4927#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4928#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:36,842 INFO L273 TraceCheckUtils]: 42: Hoare triple {4928#(<= main_~i~0 9)} assume true; {4928#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:36,843 INFO L273 TraceCheckUtils]: 43: Hoare triple {4928#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4928#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:36,843 INFO L273 TraceCheckUtils]: 44: Hoare triple {4928#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4928#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:36,844 INFO L273 TraceCheckUtils]: 45: Hoare triple {4928#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4929#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:36,844 INFO L273 TraceCheckUtils]: 46: Hoare triple {4929#(<= main_~i~0 10)} assume true; {4929#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:36,845 INFO L273 TraceCheckUtils]: 47: Hoare triple {4929#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4929#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:36,845 INFO L273 TraceCheckUtils]: 48: Hoare triple {4929#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4929#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:36,846 INFO L273 TraceCheckUtils]: 49: Hoare triple {4929#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4930#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:36,847 INFO L273 TraceCheckUtils]: 50: Hoare triple {4930#(<= main_~i~0 11)} assume true; {4930#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:36,847 INFO L273 TraceCheckUtils]: 51: Hoare triple {4930#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4930#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:36,848 INFO L273 TraceCheckUtils]: 52: Hoare triple {4930#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4930#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:36,848 INFO L273 TraceCheckUtils]: 53: Hoare triple {4930#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4931#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:36,849 INFO L273 TraceCheckUtils]: 54: Hoare triple {4931#(<= main_~i~0 12)} assume true; {4931#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:36,849 INFO L273 TraceCheckUtils]: 55: Hoare triple {4931#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4931#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:36,850 INFO L273 TraceCheckUtils]: 56: Hoare triple {4931#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4931#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:36,851 INFO L273 TraceCheckUtils]: 57: Hoare triple {4931#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4932#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:36,851 INFO L273 TraceCheckUtils]: 58: Hoare triple {4932#(<= main_~i~0 13)} assume true; {4932#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:36,852 INFO L273 TraceCheckUtils]: 59: Hoare triple {4932#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4918#false} is VALID [2018-11-18 22:56:36,852 INFO L273 TraceCheckUtils]: 60: Hoare triple {4918#false} havoc ~x~0;~x~0 := 0; {4918#false} is VALID [2018-11-18 22:56:36,852 INFO L273 TraceCheckUtils]: 61: Hoare triple {4918#false} assume true; {4918#false} is VALID [2018-11-18 22:56:36,852 INFO L273 TraceCheckUtils]: 62: Hoare triple {4918#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4918#false} is VALID [2018-11-18 22:56:36,852 INFO L256 TraceCheckUtils]: 63: Hoare triple {4918#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {4918#false} is VALID [2018-11-18 22:56:36,853 INFO L273 TraceCheckUtils]: 64: Hoare triple {4918#false} ~cond := #in~cond; {4918#false} is VALID [2018-11-18 22:56:36,853 INFO L273 TraceCheckUtils]: 65: Hoare triple {4918#false} assume 0 == ~cond; {4918#false} is VALID [2018-11-18 22:56:36,853 INFO L273 TraceCheckUtils]: 66: Hoare triple {4918#false} assume !false; {4918#false} is VALID [2018-11-18 22:56:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:36,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:36,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:36,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:36,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:37,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {4917#true} call ULTIMATE.init(); {4917#true} is VALID [2018-11-18 22:56:37,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {4917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4917#true} is VALID [2018-11-18 22:56:37,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {4917#true} assume true; {4917#true} is VALID [2018-11-18 22:56:37,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4917#true} {4917#true} #57#return; {4917#true} is VALID [2018-11-18 22:56:37,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {4917#true} call #t~ret4 := main(); {4917#true} is VALID [2018-11-18 22:56:37,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {4917#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {4951#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:37,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {4951#(<= main_~i~0 0)} assume true; {4951#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:37,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {4951#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4951#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:37,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {4951#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4951#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:37,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {4951#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4920#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:37,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {4920#(<= main_~i~0 1)} assume true; {4920#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:37,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {4920#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4920#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:37,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {4920#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4920#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:37,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {4920#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4921#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:37,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {4921#(<= main_~i~0 2)} assume true; {4921#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:37,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {4921#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4921#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:37,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {4921#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4921#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:37,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {4921#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4922#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:37,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {4922#(<= main_~i~0 3)} assume true; {4922#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:37,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {4922#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4922#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:37,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {4922#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4922#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:37,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {4922#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4923#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:37,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {4923#(<= main_~i~0 4)} assume true; {4923#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:37,044 INFO L273 TraceCheckUtils]: 23: Hoare triple {4923#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4923#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:37,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {4923#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4923#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:37,045 INFO L273 TraceCheckUtils]: 25: Hoare triple {4923#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4924#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:37,046 INFO L273 TraceCheckUtils]: 26: Hoare triple {4924#(<= main_~i~0 5)} assume true; {4924#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:37,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {4924#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4924#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:37,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {4924#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4924#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:37,047 INFO L273 TraceCheckUtils]: 29: Hoare triple {4924#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4925#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:37,048 INFO L273 TraceCheckUtils]: 30: Hoare triple {4925#(<= main_~i~0 6)} assume true; {4925#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:37,048 INFO L273 TraceCheckUtils]: 31: Hoare triple {4925#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4925#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:37,049 INFO L273 TraceCheckUtils]: 32: Hoare triple {4925#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4925#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:37,050 INFO L273 TraceCheckUtils]: 33: Hoare triple {4925#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4926#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:37,050 INFO L273 TraceCheckUtils]: 34: Hoare triple {4926#(<= main_~i~0 7)} assume true; {4926#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:37,051 INFO L273 TraceCheckUtils]: 35: Hoare triple {4926#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4926#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:37,051 INFO L273 TraceCheckUtils]: 36: Hoare triple {4926#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4926#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:37,052 INFO L273 TraceCheckUtils]: 37: Hoare triple {4926#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4927#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:37,053 INFO L273 TraceCheckUtils]: 38: Hoare triple {4927#(<= main_~i~0 8)} assume true; {4927#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:37,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {4927#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4927#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:37,054 INFO L273 TraceCheckUtils]: 40: Hoare triple {4927#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4927#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:37,055 INFO L273 TraceCheckUtils]: 41: Hoare triple {4927#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4928#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:37,055 INFO L273 TraceCheckUtils]: 42: Hoare triple {4928#(<= main_~i~0 9)} assume true; {4928#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:37,056 INFO L273 TraceCheckUtils]: 43: Hoare triple {4928#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4928#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:37,056 INFO L273 TraceCheckUtils]: 44: Hoare triple {4928#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4928#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:37,057 INFO L273 TraceCheckUtils]: 45: Hoare triple {4928#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4929#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:37,058 INFO L273 TraceCheckUtils]: 46: Hoare triple {4929#(<= main_~i~0 10)} assume true; {4929#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:37,058 INFO L273 TraceCheckUtils]: 47: Hoare triple {4929#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4929#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:37,059 INFO L273 TraceCheckUtils]: 48: Hoare triple {4929#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4929#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:37,059 INFO L273 TraceCheckUtils]: 49: Hoare triple {4929#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4930#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:37,060 INFO L273 TraceCheckUtils]: 50: Hoare triple {4930#(<= main_~i~0 11)} assume true; {4930#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:37,061 INFO L273 TraceCheckUtils]: 51: Hoare triple {4930#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4930#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:37,061 INFO L273 TraceCheckUtils]: 52: Hoare triple {4930#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4930#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:37,062 INFO L273 TraceCheckUtils]: 53: Hoare triple {4930#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4931#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:37,062 INFO L273 TraceCheckUtils]: 54: Hoare triple {4931#(<= main_~i~0 12)} assume true; {4931#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:37,063 INFO L273 TraceCheckUtils]: 55: Hoare triple {4931#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4931#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:37,064 INFO L273 TraceCheckUtils]: 56: Hoare triple {4931#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4931#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:37,064 INFO L273 TraceCheckUtils]: 57: Hoare triple {4931#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4932#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:37,065 INFO L273 TraceCheckUtils]: 58: Hoare triple {4932#(<= main_~i~0 13)} assume true; {4932#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:37,066 INFO L273 TraceCheckUtils]: 59: Hoare triple {4932#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4918#false} is VALID [2018-11-18 22:56:37,066 INFO L273 TraceCheckUtils]: 60: Hoare triple {4918#false} havoc ~x~0;~x~0 := 0; {4918#false} is VALID [2018-11-18 22:56:37,066 INFO L273 TraceCheckUtils]: 61: Hoare triple {4918#false} assume true; {4918#false} is VALID [2018-11-18 22:56:37,066 INFO L273 TraceCheckUtils]: 62: Hoare triple {4918#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4918#false} is VALID [2018-11-18 22:56:37,066 INFO L256 TraceCheckUtils]: 63: Hoare triple {4918#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {4918#false} is VALID [2018-11-18 22:56:37,067 INFO L273 TraceCheckUtils]: 64: Hoare triple {4918#false} ~cond := #in~cond; {4918#false} is VALID [2018-11-18 22:56:37,067 INFO L273 TraceCheckUtils]: 65: Hoare triple {4918#false} assume 0 == ~cond; {4918#false} is VALID [2018-11-18 22:56:37,067 INFO L273 TraceCheckUtils]: 66: Hoare triple {4918#false} assume !false; {4918#false} is VALID [2018-11-18 22:56:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:37,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:37,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:56:37,092 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-18 22:56:37,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:37,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:56:37,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:37,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:56:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:56:37,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:56:37,159 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 17 states. [2018-11-18 22:56:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:37,400 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2018-11-18 22:56:37,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:56:37,400 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-18 22:56:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:56:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 107 transitions. [2018-11-18 22:56:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:56:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 107 transitions. [2018-11-18 22:56:37,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 107 transitions. [2018-11-18 22:56:37,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:37,964 INFO L225 Difference]: With dead ends: 90 [2018-11-18 22:56:37,964 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 22:56:37,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:56:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 22:56:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-18 22:56:37,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:37,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-18 22:56:37,984 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-18 22:56:37,984 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-18 22:56:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:37,986 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-11-18 22:56:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-11-18 22:56:37,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:37,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:37,987 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-18 22:56:37,987 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-18 22:56:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:37,989 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-11-18 22:56:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-11-18 22:56:37,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:37,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:37,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:37,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 22:56:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-11-18 22:56:37,992 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 67 [2018-11-18 22:56:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:37,992 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-11-18 22:56:37,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:56:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-11-18 22:56:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 22:56:37,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:37,993 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:37,993 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:37,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash -651431626, now seen corresponding path program 14 times [2018-11-18 22:56:37,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:37,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:37,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:37,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:37,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:39,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {5503#true} call ULTIMATE.init(); {5503#true} is VALID [2018-11-18 22:56:39,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {5503#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5503#true} is VALID [2018-11-18 22:56:39,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {5503#true} assume true; {5503#true} is VALID [2018-11-18 22:56:39,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5503#true} {5503#true} #57#return; {5503#true} is VALID [2018-11-18 22:56:39,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {5503#true} call #t~ret4 := main(); {5503#true} is VALID [2018-11-18 22:56:39,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {5503#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {5505#(= main_~i~0 0)} is VALID [2018-11-18 22:56:39,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {5505#(= main_~i~0 0)} assume true; {5505#(= main_~i~0 0)} is VALID [2018-11-18 22:56:39,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {5505#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5505#(= main_~i~0 0)} is VALID [2018-11-18 22:56:39,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {5505#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5505#(= main_~i~0 0)} is VALID [2018-11-18 22:56:39,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {5505#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5506#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:39,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {5506#(<= main_~i~0 1)} assume true; {5506#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:39,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {5506#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5506#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:39,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {5506#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5506#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:39,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {5506#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5507#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:39,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {5507#(<= main_~i~0 2)} assume true; {5507#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:39,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {5507#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5507#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:39,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {5507#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5507#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:39,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {5507#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5508#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:39,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {5508#(<= main_~i~0 3)} assume true; {5508#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:39,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {5508#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5508#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:39,120 INFO L273 TraceCheckUtils]: 20: Hoare triple {5508#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5508#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:39,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {5508#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5509#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:39,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {5509#(<= main_~i~0 4)} assume true; {5509#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:39,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {5509#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5509#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:39,122 INFO L273 TraceCheckUtils]: 24: Hoare triple {5509#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5509#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:39,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {5509#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5510#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:39,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {5510#(<= main_~i~0 5)} assume true; {5510#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:39,124 INFO L273 TraceCheckUtils]: 27: Hoare triple {5510#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5510#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:39,125 INFO L273 TraceCheckUtils]: 28: Hoare triple {5510#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5510#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:39,125 INFO L273 TraceCheckUtils]: 29: Hoare triple {5510#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5511#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:39,126 INFO L273 TraceCheckUtils]: 30: Hoare triple {5511#(<= main_~i~0 6)} assume true; {5511#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:39,127 INFO L273 TraceCheckUtils]: 31: Hoare triple {5511#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5511#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:39,127 INFO L273 TraceCheckUtils]: 32: Hoare triple {5511#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5511#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:39,128 INFO L273 TraceCheckUtils]: 33: Hoare triple {5511#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5512#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:39,128 INFO L273 TraceCheckUtils]: 34: Hoare triple {5512#(<= main_~i~0 7)} assume true; {5512#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:39,129 INFO L273 TraceCheckUtils]: 35: Hoare triple {5512#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5512#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:39,129 INFO L273 TraceCheckUtils]: 36: Hoare triple {5512#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5512#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:39,130 INFO L273 TraceCheckUtils]: 37: Hoare triple {5512#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5513#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:39,131 INFO L273 TraceCheckUtils]: 38: Hoare triple {5513#(<= main_~i~0 8)} assume true; {5513#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:39,131 INFO L273 TraceCheckUtils]: 39: Hoare triple {5513#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5513#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:39,132 INFO L273 TraceCheckUtils]: 40: Hoare triple {5513#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5513#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:39,132 INFO L273 TraceCheckUtils]: 41: Hoare triple {5513#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5514#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:39,133 INFO L273 TraceCheckUtils]: 42: Hoare triple {5514#(<= main_~i~0 9)} assume true; {5514#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:39,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {5514#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5514#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:39,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {5514#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5514#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:39,135 INFO L273 TraceCheckUtils]: 45: Hoare triple {5514#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5515#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:39,135 INFO L273 TraceCheckUtils]: 46: Hoare triple {5515#(<= main_~i~0 10)} assume true; {5515#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:39,136 INFO L273 TraceCheckUtils]: 47: Hoare triple {5515#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5515#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:39,136 INFO L273 TraceCheckUtils]: 48: Hoare triple {5515#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5515#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:39,137 INFO L273 TraceCheckUtils]: 49: Hoare triple {5515#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5516#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:39,138 INFO L273 TraceCheckUtils]: 50: Hoare triple {5516#(<= main_~i~0 11)} assume true; {5516#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:39,138 INFO L273 TraceCheckUtils]: 51: Hoare triple {5516#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5516#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:39,139 INFO L273 TraceCheckUtils]: 52: Hoare triple {5516#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5516#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:39,140 INFO L273 TraceCheckUtils]: 53: Hoare triple {5516#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5517#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:39,140 INFO L273 TraceCheckUtils]: 54: Hoare triple {5517#(<= main_~i~0 12)} assume true; {5517#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:39,141 INFO L273 TraceCheckUtils]: 55: Hoare triple {5517#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5517#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:39,141 INFO L273 TraceCheckUtils]: 56: Hoare triple {5517#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5517#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:39,142 INFO L273 TraceCheckUtils]: 57: Hoare triple {5517#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5518#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:39,142 INFO L273 TraceCheckUtils]: 58: Hoare triple {5518#(<= main_~i~0 13)} assume true; {5518#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:39,143 INFO L273 TraceCheckUtils]: 59: Hoare triple {5518#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5518#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:39,143 INFO L273 TraceCheckUtils]: 60: Hoare triple {5518#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5518#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:39,144 INFO L273 TraceCheckUtils]: 61: Hoare triple {5518#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5519#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:39,145 INFO L273 TraceCheckUtils]: 62: Hoare triple {5519#(<= main_~i~0 14)} assume true; {5519#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:39,145 INFO L273 TraceCheckUtils]: 63: Hoare triple {5519#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5504#false} is VALID [2018-11-18 22:56:39,146 INFO L273 TraceCheckUtils]: 64: Hoare triple {5504#false} havoc ~x~0;~x~0 := 0; {5504#false} is VALID [2018-11-18 22:56:39,146 INFO L273 TraceCheckUtils]: 65: Hoare triple {5504#false} assume true; {5504#false} is VALID [2018-11-18 22:56:39,146 INFO L273 TraceCheckUtils]: 66: Hoare triple {5504#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5504#false} is VALID [2018-11-18 22:56:39,146 INFO L256 TraceCheckUtils]: 67: Hoare triple {5504#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {5504#false} is VALID [2018-11-18 22:56:39,147 INFO L273 TraceCheckUtils]: 68: Hoare triple {5504#false} ~cond := #in~cond; {5504#false} is VALID [2018-11-18 22:56:39,147 INFO L273 TraceCheckUtils]: 69: Hoare triple {5504#false} assume 0 == ~cond; {5504#false} is VALID [2018-11-18 22:56:39,147 INFO L273 TraceCheckUtils]: 70: Hoare triple {5504#false} assume !false; {5504#false} is VALID [2018-11-18 22:56:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:39,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:39,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:39,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:56:39,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:56:39,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:39,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:39,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {5503#true} call ULTIMATE.init(); {5503#true} is VALID [2018-11-18 22:56:39,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {5503#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5503#true} is VALID [2018-11-18 22:56:39,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {5503#true} assume true; {5503#true} is VALID [2018-11-18 22:56:39,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5503#true} {5503#true} #57#return; {5503#true} is VALID [2018-11-18 22:56:39,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {5503#true} call #t~ret4 := main(); {5503#true} is VALID [2018-11-18 22:56:39,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {5503#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {5538#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:39,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {5538#(<= main_~i~0 0)} assume true; {5538#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:39,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {5538#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5538#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:39,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {5538#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5538#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:39,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {5538#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5506#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:39,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {5506#(<= main_~i~0 1)} assume true; {5506#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:39,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {5506#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5506#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:39,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {5506#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5506#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:39,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {5506#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5507#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:39,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {5507#(<= main_~i~0 2)} assume true; {5507#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:39,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {5507#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5507#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:39,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {5507#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5507#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:39,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {5507#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5508#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:39,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {5508#(<= main_~i~0 3)} assume true; {5508#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:39,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {5508#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5508#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:39,337 INFO L273 TraceCheckUtils]: 20: Hoare triple {5508#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5508#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:39,338 INFO L273 TraceCheckUtils]: 21: Hoare triple {5508#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5509#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:39,338 INFO L273 TraceCheckUtils]: 22: Hoare triple {5509#(<= main_~i~0 4)} assume true; {5509#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:39,339 INFO L273 TraceCheckUtils]: 23: Hoare triple {5509#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5509#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:39,339 INFO L273 TraceCheckUtils]: 24: Hoare triple {5509#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5509#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:39,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {5509#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5510#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:39,341 INFO L273 TraceCheckUtils]: 26: Hoare triple {5510#(<= main_~i~0 5)} assume true; {5510#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:39,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {5510#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5510#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:39,342 INFO L273 TraceCheckUtils]: 28: Hoare triple {5510#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5510#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:39,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {5510#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5511#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:39,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {5511#(<= main_~i~0 6)} assume true; {5511#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:39,344 INFO L273 TraceCheckUtils]: 31: Hoare triple {5511#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5511#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:39,344 INFO L273 TraceCheckUtils]: 32: Hoare triple {5511#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5511#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:39,345 INFO L273 TraceCheckUtils]: 33: Hoare triple {5511#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5512#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:39,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {5512#(<= main_~i~0 7)} assume true; {5512#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:39,346 INFO L273 TraceCheckUtils]: 35: Hoare triple {5512#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5512#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:39,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {5512#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5512#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:39,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {5512#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5513#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:39,348 INFO L273 TraceCheckUtils]: 38: Hoare triple {5513#(<= main_~i~0 8)} assume true; {5513#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:39,351 INFO L273 TraceCheckUtils]: 39: Hoare triple {5513#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5513#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:39,352 INFO L273 TraceCheckUtils]: 40: Hoare triple {5513#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5513#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:39,352 INFO L273 TraceCheckUtils]: 41: Hoare triple {5513#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5514#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:39,353 INFO L273 TraceCheckUtils]: 42: Hoare triple {5514#(<= main_~i~0 9)} assume true; {5514#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:39,353 INFO L273 TraceCheckUtils]: 43: Hoare triple {5514#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5514#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:39,353 INFO L273 TraceCheckUtils]: 44: Hoare triple {5514#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5514#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:39,354 INFO L273 TraceCheckUtils]: 45: Hoare triple {5514#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5515#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:39,354 INFO L273 TraceCheckUtils]: 46: Hoare triple {5515#(<= main_~i~0 10)} assume true; {5515#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:39,354 INFO L273 TraceCheckUtils]: 47: Hoare triple {5515#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5515#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:39,355 INFO L273 TraceCheckUtils]: 48: Hoare triple {5515#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5515#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:39,355 INFO L273 TraceCheckUtils]: 49: Hoare triple {5515#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5516#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:39,355 INFO L273 TraceCheckUtils]: 50: Hoare triple {5516#(<= main_~i~0 11)} assume true; {5516#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:39,356 INFO L273 TraceCheckUtils]: 51: Hoare triple {5516#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5516#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:39,356 INFO L273 TraceCheckUtils]: 52: Hoare triple {5516#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5516#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:39,360 INFO L273 TraceCheckUtils]: 53: Hoare triple {5516#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5517#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:39,360 INFO L273 TraceCheckUtils]: 54: Hoare triple {5517#(<= main_~i~0 12)} assume true; {5517#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:39,360 INFO L273 TraceCheckUtils]: 55: Hoare triple {5517#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5517#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:39,361 INFO L273 TraceCheckUtils]: 56: Hoare triple {5517#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5517#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:39,361 INFO L273 TraceCheckUtils]: 57: Hoare triple {5517#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5518#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:39,362 INFO L273 TraceCheckUtils]: 58: Hoare triple {5518#(<= main_~i~0 13)} assume true; {5518#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:39,362 INFO L273 TraceCheckUtils]: 59: Hoare triple {5518#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5518#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:39,362 INFO L273 TraceCheckUtils]: 60: Hoare triple {5518#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5518#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:39,363 INFO L273 TraceCheckUtils]: 61: Hoare triple {5518#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5519#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:39,363 INFO L273 TraceCheckUtils]: 62: Hoare triple {5519#(<= main_~i~0 14)} assume true; {5519#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:39,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {5519#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5504#false} is VALID [2018-11-18 22:56:39,364 INFO L273 TraceCheckUtils]: 64: Hoare triple {5504#false} havoc ~x~0;~x~0 := 0; {5504#false} is VALID [2018-11-18 22:56:39,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {5504#false} assume true; {5504#false} is VALID [2018-11-18 22:56:39,364 INFO L273 TraceCheckUtils]: 66: Hoare triple {5504#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5504#false} is VALID [2018-11-18 22:56:39,364 INFO L256 TraceCheckUtils]: 67: Hoare triple {5504#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {5504#false} is VALID [2018-11-18 22:56:39,364 INFO L273 TraceCheckUtils]: 68: Hoare triple {5504#false} ~cond := #in~cond; {5504#false} is VALID [2018-11-18 22:56:39,364 INFO L273 TraceCheckUtils]: 69: Hoare triple {5504#false} assume 0 == ~cond; {5504#false} is VALID [2018-11-18 22:56:39,365 INFO L273 TraceCheckUtils]: 70: Hoare triple {5504#false} assume !false; {5504#false} is VALID [2018-11-18 22:56:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:39,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:39,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:56:39,389 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-18 22:56:39,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:39,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:56:39,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:39,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:56:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:56:39,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:56:39,458 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 18 states. [2018-11-18 22:56:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:39,839 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-11-18 22:56:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:56:39,839 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-18 22:56:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:56:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-18 22:56:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:56:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-18 22:56:39,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 112 transitions. [2018-11-18 22:56:39,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:39,959 INFO L225 Difference]: With dead ends: 94 [2018-11-18 22:56:39,959 INFO L226 Difference]: Without dead ends: 82 [2018-11-18 22:56:39,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:56:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-18 22:56:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-11-18 22:56:39,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:39,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 80 states. [2018-11-18 22:56:39,981 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 80 states. [2018-11-18 22:56:39,981 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 80 states. [2018-11-18 22:56:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:39,982 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2018-11-18 22:56:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-18 22:56:39,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:39,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:39,983 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 82 states. [2018-11-18 22:56:39,983 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 82 states. [2018-11-18 22:56:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:39,984 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2018-11-18 22:56:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-18 22:56:39,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:39,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:39,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:39,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 22:56:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2018-11-18 22:56:39,987 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 71 [2018-11-18 22:56:39,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:39,987 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2018-11-18 22:56:39,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:56:39,987 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2018-11-18 22:56:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 22:56:39,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:39,988 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:39,988 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:39,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash 719782540, now seen corresponding path program 15 times [2018-11-18 22:56:39,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:39,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:39,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:39,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:39,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:40,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {6120#true} call ULTIMATE.init(); {6120#true} is VALID [2018-11-18 22:56:40,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {6120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6120#true} is VALID [2018-11-18 22:56:40,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {6120#true} assume true; {6120#true} is VALID [2018-11-18 22:56:40,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6120#true} {6120#true} #57#return; {6120#true} is VALID [2018-11-18 22:56:40,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {6120#true} call #t~ret4 := main(); {6120#true} is VALID [2018-11-18 22:56:40,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {6120#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {6122#(= main_~i~0 0)} is VALID [2018-11-18 22:56:40,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {6122#(= main_~i~0 0)} assume true; {6122#(= main_~i~0 0)} is VALID [2018-11-18 22:56:40,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {6122#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6122#(= main_~i~0 0)} is VALID [2018-11-18 22:56:40,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {6122#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6122#(= main_~i~0 0)} is VALID [2018-11-18 22:56:40,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {6122#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6123#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {6123#(<= main_~i~0 1)} assume true; {6123#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {6123#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6123#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {6123#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6123#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {6123#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6124#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:40,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {6124#(<= main_~i~0 2)} assume true; {6124#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:40,514 INFO L273 TraceCheckUtils]: 15: Hoare triple {6124#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6124#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:40,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {6124#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6124#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:40,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {6124#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6125#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:40,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {6125#(<= main_~i~0 3)} assume true; {6125#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:40,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {6125#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6125#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:40,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {6125#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6125#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:40,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {6125#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6126#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:40,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {6126#(<= main_~i~0 4)} assume true; {6126#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:40,519 INFO L273 TraceCheckUtils]: 23: Hoare triple {6126#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6126#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:40,519 INFO L273 TraceCheckUtils]: 24: Hoare triple {6126#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6126#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:40,520 INFO L273 TraceCheckUtils]: 25: Hoare triple {6126#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6127#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:40,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {6127#(<= main_~i~0 5)} assume true; {6127#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:40,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {6127#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6127#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:40,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {6127#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6127#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:40,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {6127#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6128#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:40,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {6128#(<= main_~i~0 6)} assume true; {6128#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:40,524 INFO L273 TraceCheckUtils]: 31: Hoare triple {6128#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6128#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:40,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {6128#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6128#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:40,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {6128#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6129#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:40,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {6129#(<= main_~i~0 7)} assume true; {6129#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:40,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {6129#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6129#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:40,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {6129#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6129#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:40,527 INFO L273 TraceCheckUtils]: 37: Hoare triple {6129#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6130#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:40,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {6130#(<= main_~i~0 8)} assume true; {6130#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:40,528 INFO L273 TraceCheckUtils]: 39: Hoare triple {6130#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6130#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:40,529 INFO L273 TraceCheckUtils]: 40: Hoare triple {6130#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6130#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:40,529 INFO L273 TraceCheckUtils]: 41: Hoare triple {6130#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6131#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:40,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {6131#(<= main_~i~0 9)} assume true; {6131#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:40,531 INFO L273 TraceCheckUtils]: 43: Hoare triple {6131#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6131#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:40,531 INFO L273 TraceCheckUtils]: 44: Hoare triple {6131#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6131#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:40,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {6131#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6132#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:40,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {6132#(<= main_~i~0 10)} assume true; {6132#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:40,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {6132#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6132#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:40,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {6132#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6132#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:40,534 INFO L273 TraceCheckUtils]: 49: Hoare triple {6132#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6133#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:40,535 INFO L273 TraceCheckUtils]: 50: Hoare triple {6133#(<= main_~i~0 11)} assume true; {6133#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:40,535 INFO L273 TraceCheckUtils]: 51: Hoare triple {6133#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6133#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:40,536 INFO L273 TraceCheckUtils]: 52: Hoare triple {6133#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6133#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:40,556 INFO L273 TraceCheckUtils]: 53: Hoare triple {6133#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6134#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:40,556 INFO L273 TraceCheckUtils]: 54: Hoare triple {6134#(<= main_~i~0 12)} assume true; {6134#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:40,557 INFO L273 TraceCheckUtils]: 55: Hoare triple {6134#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6134#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:40,557 INFO L273 TraceCheckUtils]: 56: Hoare triple {6134#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6134#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:40,557 INFO L273 TraceCheckUtils]: 57: Hoare triple {6134#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6135#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:40,558 INFO L273 TraceCheckUtils]: 58: Hoare triple {6135#(<= main_~i~0 13)} assume true; {6135#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:40,558 INFO L273 TraceCheckUtils]: 59: Hoare triple {6135#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6135#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:40,558 INFO L273 TraceCheckUtils]: 60: Hoare triple {6135#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6135#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:40,559 INFO L273 TraceCheckUtils]: 61: Hoare triple {6135#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6136#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:40,559 INFO L273 TraceCheckUtils]: 62: Hoare triple {6136#(<= main_~i~0 14)} assume true; {6136#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:40,560 INFO L273 TraceCheckUtils]: 63: Hoare triple {6136#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6136#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:40,560 INFO L273 TraceCheckUtils]: 64: Hoare triple {6136#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6136#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:40,561 INFO L273 TraceCheckUtils]: 65: Hoare triple {6136#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6137#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:40,561 INFO L273 TraceCheckUtils]: 66: Hoare triple {6137#(<= main_~i~0 15)} assume true; {6137#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:40,562 INFO L273 TraceCheckUtils]: 67: Hoare triple {6137#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6121#false} is VALID [2018-11-18 22:56:40,562 INFO L273 TraceCheckUtils]: 68: Hoare triple {6121#false} havoc ~x~0;~x~0 := 0; {6121#false} is VALID [2018-11-18 22:56:40,562 INFO L273 TraceCheckUtils]: 69: Hoare triple {6121#false} assume true; {6121#false} is VALID [2018-11-18 22:56:40,563 INFO L273 TraceCheckUtils]: 70: Hoare triple {6121#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6121#false} is VALID [2018-11-18 22:56:40,563 INFO L256 TraceCheckUtils]: 71: Hoare triple {6121#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {6121#false} is VALID [2018-11-18 22:56:40,563 INFO L273 TraceCheckUtils]: 72: Hoare triple {6121#false} ~cond := #in~cond; {6121#false} is VALID [2018-11-18 22:56:40,563 INFO L273 TraceCheckUtils]: 73: Hoare triple {6121#false} assume 0 == ~cond; {6121#false} is VALID [2018-11-18 22:56:40,563 INFO L273 TraceCheckUtils]: 74: Hoare triple {6121#false} assume !false; {6121#false} is VALID [2018-11-18 22:56:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:40,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:40,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:40,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:56:40,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-18 22:56:40,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:40,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:40,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {6120#true} call ULTIMATE.init(); {6120#true} is VALID [2018-11-18 22:56:40,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {6120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6120#true} is VALID [2018-11-18 22:56:40,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {6120#true} assume true; {6120#true} is VALID [2018-11-18 22:56:40,823 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6120#true} {6120#true} #57#return; {6120#true} is VALID [2018-11-18 22:56:40,823 INFO L256 TraceCheckUtils]: 4: Hoare triple {6120#true} call #t~ret4 := main(); {6120#true} is VALID [2018-11-18 22:56:40,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {6120#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {6156#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:40,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {6156#(<= main_~i~0 0)} assume true; {6156#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:40,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {6156#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6156#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:40,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {6156#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6156#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:40,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {6156#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6123#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,827 INFO L273 TraceCheckUtils]: 10: Hoare triple {6123#(<= main_~i~0 1)} assume true; {6123#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {6123#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6123#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {6123#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6123#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {6123#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6124#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:40,829 INFO L273 TraceCheckUtils]: 14: Hoare triple {6124#(<= main_~i~0 2)} assume true; {6124#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:40,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {6124#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6124#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:40,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {6124#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6124#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:40,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {6124#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6125#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:40,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {6125#(<= main_~i~0 3)} assume true; {6125#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:40,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {6125#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6125#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:40,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {6125#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6125#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:40,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {6125#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6126#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:40,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {6126#(<= main_~i~0 4)} assume true; {6126#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:40,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {6126#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6126#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:40,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {6126#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6126#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:40,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {6126#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6127#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:40,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {6127#(<= main_~i~0 5)} assume true; {6127#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:40,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {6127#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6127#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:40,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {6127#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6127#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:40,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {6127#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6128#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:40,839 INFO L273 TraceCheckUtils]: 30: Hoare triple {6128#(<= main_~i~0 6)} assume true; {6128#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:40,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {6128#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6128#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:40,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {6128#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6128#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:40,841 INFO L273 TraceCheckUtils]: 33: Hoare triple {6128#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6129#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:40,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {6129#(<= main_~i~0 7)} assume true; {6129#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:40,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {6129#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6129#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:40,842 INFO L273 TraceCheckUtils]: 36: Hoare triple {6129#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6129#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:40,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {6129#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6130#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:40,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {6130#(<= main_~i~0 8)} assume true; {6130#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:40,844 INFO L273 TraceCheckUtils]: 39: Hoare triple {6130#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6130#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:40,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {6130#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6130#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:40,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {6130#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6131#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:40,846 INFO L273 TraceCheckUtils]: 42: Hoare triple {6131#(<= main_~i~0 9)} assume true; {6131#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:40,846 INFO L273 TraceCheckUtils]: 43: Hoare triple {6131#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6131#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:40,847 INFO L273 TraceCheckUtils]: 44: Hoare triple {6131#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6131#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:40,848 INFO L273 TraceCheckUtils]: 45: Hoare triple {6131#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6132#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:40,848 INFO L273 TraceCheckUtils]: 46: Hoare triple {6132#(<= main_~i~0 10)} assume true; {6132#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:40,849 INFO L273 TraceCheckUtils]: 47: Hoare triple {6132#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6132#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:40,849 INFO L273 TraceCheckUtils]: 48: Hoare triple {6132#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6132#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:40,850 INFO L273 TraceCheckUtils]: 49: Hoare triple {6132#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6133#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:40,851 INFO L273 TraceCheckUtils]: 50: Hoare triple {6133#(<= main_~i~0 11)} assume true; {6133#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:40,851 INFO L273 TraceCheckUtils]: 51: Hoare triple {6133#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6133#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:40,852 INFO L273 TraceCheckUtils]: 52: Hoare triple {6133#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6133#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:40,853 INFO L273 TraceCheckUtils]: 53: Hoare triple {6133#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6134#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:40,853 INFO L273 TraceCheckUtils]: 54: Hoare triple {6134#(<= main_~i~0 12)} assume true; {6134#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:40,854 INFO L273 TraceCheckUtils]: 55: Hoare triple {6134#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6134#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:40,854 INFO L273 TraceCheckUtils]: 56: Hoare triple {6134#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6134#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:40,855 INFO L273 TraceCheckUtils]: 57: Hoare triple {6134#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6135#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:40,855 INFO L273 TraceCheckUtils]: 58: Hoare triple {6135#(<= main_~i~0 13)} assume true; {6135#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:40,856 INFO L273 TraceCheckUtils]: 59: Hoare triple {6135#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6135#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:40,856 INFO L273 TraceCheckUtils]: 60: Hoare triple {6135#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6135#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:40,860 INFO L273 TraceCheckUtils]: 61: Hoare triple {6135#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6136#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:40,860 INFO L273 TraceCheckUtils]: 62: Hoare triple {6136#(<= main_~i~0 14)} assume true; {6136#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:40,861 INFO L273 TraceCheckUtils]: 63: Hoare triple {6136#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6136#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:40,879 INFO L273 TraceCheckUtils]: 64: Hoare triple {6136#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6136#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:40,893 INFO L273 TraceCheckUtils]: 65: Hoare triple {6136#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6137#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:40,902 INFO L273 TraceCheckUtils]: 66: Hoare triple {6137#(<= main_~i~0 15)} assume true; {6137#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:40,915 INFO L273 TraceCheckUtils]: 67: Hoare triple {6137#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6121#false} is VALID [2018-11-18 22:56:40,915 INFO L273 TraceCheckUtils]: 68: Hoare triple {6121#false} havoc ~x~0;~x~0 := 0; {6121#false} is VALID [2018-11-18 22:56:40,915 INFO L273 TraceCheckUtils]: 69: Hoare triple {6121#false} assume true; {6121#false} is VALID [2018-11-18 22:56:40,915 INFO L273 TraceCheckUtils]: 70: Hoare triple {6121#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6121#false} is VALID [2018-11-18 22:56:40,915 INFO L256 TraceCheckUtils]: 71: Hoare triple {6121#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {6121#false} is VALID [2018-11-18 22:56:40,915 INFO L273 TraceCheckUtils]: 72: Hoare triple {6121#false} ~cond := #in~cond; {6121#false} is VALID [2018-11-18 22:56:40,915 INFO L273 TraceCheckUtils]: 73: Hoare triple {6121#false} assume 0 == ~cond; {6121#false} is VALID [2018-11-18 22:56:40,916 INFO L273 TraceCheckUtils]: 74: Hoare triple {6121#false} assume !false; {6121#false} is VALID [2018-11-18 22:56:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:40,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:40,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:56:40,939 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-11-18 22:56:40,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:40,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:56:41,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:41,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:56:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:56:41,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:56:41,012 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 19 states. [2018-11-18 22:56:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:41,398 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2018-11-18 22:56:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:56:41,399 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-11-18 22:56:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:56:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2018-11-18 22:56:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:56:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2018-11-18 22:56:41,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2018-11-18 22:56:41,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:41,582 INFO L225 Difference]: With dead ends: 98 [2018-11-18 22:56:41,582 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 22:56:41,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:56:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 22:56:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-18 22:56:41,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:41,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 84 states. [2018-11-18 22:56:41,602 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 84 states. [2018-11-18 22:56:41,602 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 84 states. [2018-11-18 22:56:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:41,604 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-18 22:56:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-18 22:56:41,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:41,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:41,605 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 86 states. [2018-11-18 22:56:41,605 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 86 states. [2018-11-18 22:56:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:41,607 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-18 22:56:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-18 22:56:41,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:41,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:41,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:41,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 22:56:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2018-11-18 22:56:41,610 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 75 [2018-11-18 22:56:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:41,611 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2018-11-18 22:56:41,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:56:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-11-18 22:56:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 22:56:41,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:41,612 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:41,612 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:41,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash 460159202, now seen corresponding path program 16 times [2018-11-18 22:56:41,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:41,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:41,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:41,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:41,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:42,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {6768#true} call ULTIMATE.init(); {6768#true} is VALID [2018-11-18 22:56:42,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {6768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6768#true} is VALID [2018-11-18 22:56:42,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {6768#true} assume true; {6768#true} is VALID [2018-11-18 22:56:42,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6768#true} {6768#true} #57#return; {6768#true} is VALID [2018-11-18 22:56:42,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {6768#true} call #t~ret4 := main(); {6768#true} is VALID [2018-11-18 22:56:42,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {6768#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {6770#(= main_~i~0 0)} is VALID [2018-11-18 22:56:42,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {6770#(= main_~i~0 0)} assume true; {6770#(= main_~i~0 0)} is VALID [2018-11-18 22:56:42,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {6770#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6770#(= main_~i~0 0)} is VALID [2018-11-18 22:56:42,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {6770#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6770#(= main_~i~0 0)} is VALID [2018-11-18 22:56:42,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {6770#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6771#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {6771#(<= main_~i~0 1)} assume true; {6771#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {6771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6771#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {6771#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6771#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {6771#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6772#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {6772#(<= main_~i~0 2)} assume true; {6772#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {6772#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6772#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {6772#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6772#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {6772#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6773#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:42,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {6773#(<= main_~i~0 3)} assume true; {6773#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:42,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {6773#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6773#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:42,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {6773#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6773#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:42,740 INFO L273 TraceCheckUtils]: 21: Hoare triple {6773#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6774#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:42,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {6774#(<= main_~i~0 4)} assume true; {6774#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:42,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {6774#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6774#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:42,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {6774#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6774#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:42,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {6774#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6775#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:42,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {6775#(<= main_~i~0 5)} assume true; {6775#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:42,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {6775#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6775#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:42,744 INFO L273 TraceCheckUtils]: 28: Hoare triple {6775#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6775#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:42,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {6775#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6776#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:42,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {6776#(<= main_~i~0 6)} assume true; {6776#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:42,746 INFO L273 TraceCheckUtils]: 31: Hoare triple {6776#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6776#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:42,747 INFO L273 TraceCheckUtils]: 32: Hoare triple {6776#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6776#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:42,747 INFO L273 TraceCheckUtils]: 33: Hoare triple {6776#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6777#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:42,748 INFO L273 TraceCheckUtils]: 34: Hoare triple {6777#(<= main_~i~0 7)} assume true; {6777#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:42,749 INFO L273 TraceCheckUtils]: 35: Hoare triple {6777#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6777#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:42,749 INFO L273 TraceCheckUtils]: 36: Hoare triple {6777#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6777#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:42,750 INFO L273 TraceCheckUtils]: 37: Hoare triple {6777#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6778#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:42,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {6778#(<= main_~i~0 8)} assume true; {6778#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:42,751 INFO L273 TraceCheckUtils]: 39: Hoare triple {6778#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6778#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:42,752 INFO L273 TraceCheckUtils]: 40: Hoare triple {6778#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6778#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:42,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {6778#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6779#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:42,753 INFO L273 TraceCheckUtils]: 42: Hoare triple {6779#(<= main_~i~0 9)} assume true; {6779#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:42,754 INFO L273 TraceCheckUtils]: 43: Hoare triple {6779#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6779#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:42,754 INFO L273 TraceCheckUtils]: 44: Hoare triple {6779#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6779#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:42,755 INFO L273 TraceCheckUtils]: 45: Hoare triple {6779#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6780#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:42,756 INFO L273 TraceCheckUtils]: 46: Hoare triple {6780#(<= main_~i~0 10)} assume true; {6780#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:42,756 INFO L273 TraceCheckUtils]: 47: Hoare triple {6780#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6780#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:42,757 INFO L273 TraceCheckUtils]: 48: Hoare triple {6780#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6780#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:42,758 INFO L273 TraceCheckUtils]: 49: Hoare triple {6780#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6781#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:42,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {6781#(<= main_~i~0 11)} assume true; {6781#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:42,759 INFO L273 TraceCheckUtils]: 51: Hoare triple {6781#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6781#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:42,760 INFO L273 TraceCheckUtils]: 52: Hoare triple {6781#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6781#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:42,760 INFO L273 TraceCheckUtils]: 53: Hoare triple {6781#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6782#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:42,761 INFO L273 TraceCheckUtils]: 54: Hoare triple {6782#(<= main_~i~0 12)} assume true; {6782#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:42,762 INFO L273 TraceCheckUtils]: 55: Hoare triple {6782#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6782#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:42,762 INFO L273 TraceCheckUtils]: 56: Hoare triple {6782#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6782#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:42,763 INFO L273 TraceCheckUtils]: 57: Hoare triple {6782#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6783#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:42,764 INFO L273 TraceCheckUtils]: 58: Hoare triple {6783#(<= main_~i~0 13)} assume true; {6783#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:42,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {6783#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6783#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:42,765 INFO L273 TraceCheckUtils]: 60: Hoare triple {6783#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6783#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:42,766 INFO L273 TraceCheckUtils]: 61: Hoare triple {6783#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6784#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:42,766 INFO L273 TraceCheckUtils]: 62: Hoare triple {6784#(<= main_~i~0 14)} assume true; {6784#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:42,767 INFO L273 TraceCheckUtils]: 63: Hoare triple {6784#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6784#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:42,767 INFO L273 TraceCheckUtils]: 64: Hoare triple {6784#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6784#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:42,768 INFO L273 TraceCheckUtils]: 65: Hoare triple {6784#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6785#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:42,769 INFO L273 TraceCheckUtils]: 66: Hoare triple {6785#(<= main_~i~0 15)} assume true; {6785#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:42,769 INFO L273 TraceCheckUtils]: 67: Hoare triple {6785#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6785#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:42,770 INFO L273 TraceCheckUtils]: 68: Hoare triple {6785#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6785#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:42,771 INFO L273 TraceCheckUtils]: 69: Hoare triple {6785#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6786#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:42,771 INFO L273 TraceCheckUtils]: 70: Hoare triple {6786#(<= main_~i~0 16)} assume true; {6786#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:42,772 INFO L273 TraceCheckUtils]: 71: Hoare triple {6786#(<= main_~i~0 16)} assume !(~i~0 < 100000); {6769#false} is VALID [2018-11-18 22:56:42,772 INFO L273 TraceCheckUtils]: 72: Hoare triple {6769#false} havoc ~x~0;~x~0 := 0; {6769#false} is VALID [2018-11-18 22:56:42,772 INFO L273 TraceCheckUtils]: 73: Hoare triple {6769#false} assume true; {6769#false} is VALID [2018-11-18 22:56:42,773 INFO L273 TraceCheckUtils]: 74: Hoare triple {6769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6769#false} is VALID [2018-11-18 22:56:42,773 INFO L256 TraceCheckUtils]: 75: Hoare triple {6769#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {6769#false} is VALID [2018-11-18 22:56:42,773 INFO L273 TraceCheckUtils]: 76: Hoare triple {6769#false} ~cond := #in~cond; {6769#false} is VALID [2018-11-18 22:56:42,773 INFO L273 TraceCheckUtils]: 77: Hoare triple {6769#false} assume 0 == ~cond; {6769#false} is VALID [2018-11-18 22:56:42,774 INFO L273 TraceCheckUtils]: 78: Hoare triple {6769#false} assume !false; {6769#false} is VALID [2018-11-18 22:56:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:42,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:42,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:42,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:56:42,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:56:42,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:42,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:43,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {6768#true} call ULTIMATE.init(); {6768#true} is VALID [2018-11-18 22:56:43,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {6768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6768#true} is VALID [2018-11-18 22:56:43,096 INFO L273 TraceCheckUtils]: 2: Hoare triple {6768#true} assume true; {6768#true} is VALID [2018-11-18 22:56:43,096 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6768#true} {6768#true} #57#return; {6768#true} is VALID [2018-11-18 22:56:43,096 INFO L256 TraceCheckUtils]: 4: Hoare triple {6768#true} call #t~ret4 := main(); {6768#true} is VALID [2018-11-18 22:56:43,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {6768#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {6805#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,097 INFO L273 TraceCheckUtils]: 6: Hoare triple {6805#(<= main_~i~0 0)} assume true; {6805#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,097 INFO L273 TraceCheckUtils]: 7: Hoare triple {6805#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6805#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {6805#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6805#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {6805#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6771#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {6771#(<= main_~i~0 1)} assume true; {6771#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {6771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6771#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {6771#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6771#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {6771#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6772#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,100 INFO L273 TraceCheckUtils]: 14: Hoare triple {6772#(<= main_~i~0 2)} assume true; {6772#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {6772#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6772#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,100 INFO L273 TraceCheckUtils]: 16: Hoare triple {6772#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6772#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,101 INFO L273 TraceCheckUtils]: 17: Hoare triple {6772#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6773#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,102 INFO L273 TraceCheckUtils]: 18: Hoare triple {6773#(<= main_~i~0 3)} assume true; {6773#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,102 INFO L273 TraceCheckUtils]: 19: Hoare triple {6773#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6773#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,103 INFO L273 TraceCheckUtils]: 20: Hoare triple {6773#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6773#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,103 INFO L273 TraceCheckUtils]: 21: Hoare triple {6773#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6774#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,104 INFO L273 TraceCheckUtils]: 22: Hoare triple {6774#(<= main_~i~0 4)} assume true; {6774#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {6774#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6774#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,105 INFO L273 TraceCheckUtils]: 24: Hoare triple {6774#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6774#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {6774#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6775#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:43,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {6775#(<= main_~i~0 5)} assume true; {6775#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:43,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {6775#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6775#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:43,107 INFO L273 TraceCheckUtils]: 28: Hoare triple {6775#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6775#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:43,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {6775#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6776#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:43,109 INFO L273 TraceCheckUtils]: 30: Hoare triple {6776#(<= main_~i~0 6)} assume true; {6776#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:43,109 INFO L273 TraceCheckUtils]: 31: Hoare triple {6776#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6776#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:43,110 INFO L273 TraceCheckUtils]: 32: Hoare triple {6776#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6776#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:43,110 INFO L273 TraceCheckUtils]: 33: Hoare triple {6776#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6777#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:43,111 INFO L273 TraceCheckUtils]: 34: Hoare triple {6777#(<= main_~i~0 7)} assume true; {6777#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:43,111 INFO L273 TraceCheckUtils]: 35: Hoare triple {6777#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6777#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:43,112 INFO L273 TraceCheckUtils]: 36: Hoare triple {6777#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6777#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:43,113 INFO L273 TraceCheckUtils]: 37: Hoare triple {6777#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6778#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:43,113 INFO L273 TraceCheckUtils]: 38: Hoare triple {6778#(<= main_~i~0 8)} assume true; {6778#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:43,114 INFO L273 TraceCheckUtils]: 39: Hoare triple {6778#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6778#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:43,114 INFO L273 TraceCheckUtils]: 40: Hoare triple {6778#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6778#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:43,115 INFO L273 TraceCheckUtils]: 41: Hoare triple {6778#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6779#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:43,115 INFO L273 TraceCheckUtils]: 42: Hoare triple {6779#(<= main_~i~0 9)} assume true; {6779#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:43,116 INFO L273 TraceCheckUtils]: 43: Hoare triple {6779#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6779#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:43,135 INFO L273 TraceCheckUtils]: 44: Hoare triple {6779#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6779#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:43,144 INFO L273 TraceCheckUtils]: 45: Hoare triple {6779#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6780#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:43,157 INFO L273 TraceCheckUtils]: 46: Hoare triple {6780#(<= main_~i~0 10)} assume true; {6780#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:43,166 INFO L273 TraceCheckUtils]: 47: Hoare triple {6780#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6780#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:43,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {6780#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6780#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:43,190 INFO L273 TraceCheckUtils]: 49: Hoare triple {6780#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6781#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:43,203 INFO L273 TraceCheckUtils]: 50: Hoare triple {6781#(<= main_~i~0 11)} assume true; {6781#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:43,212 INFO L273 TraceCheckUtils]: 51: Hoare triple {6781#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6781#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:43,227 INFO L273 TraceCheckUtils]: 52: Hoare triple {6781#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6781#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:43,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {6781#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6782#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:43,253 INFO L273 TraceCheckUtils]: 54: Hoare triple {6782#(<= main_~i~0 12)} assume true; {6782#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:43,262 INFO L273 TraceCheckUtils]: 55: Hoare triple {6782#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6782#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:43,274 INFO L273 TraceCheckUtils]: 56: Hoare triple {6782#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6782#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:43,287 INFO L273 TraceCheckUtils]: 57: Hoare triple {6782#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6783#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:43,301 INFO L273 TraceCheckUtils]: 58: Hoare triple {6783#(<= main_~i~0 13)} assume true; {6783#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:43,312 INFO L273 TraceCheckUtils]: 59: Hoare triple {6783#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6783#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:43,322 INFO L273 TraceCheckUtils]: 60: Hoare triple {6783#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6783#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:43,335 INFO L273 TraceCheckUtils]: 61: Hoare triple {6783#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6784#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:43,348 INFO L273 TraceCheckUtils]: 62: Hoare triple {6784#(<= main_~i~0 14)} assume true; {6784#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:43,356 INFO L273 TraceCheckUtils]: 63: Hoare triple {6784#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6784#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:43,369 INFO L273 TraceCheckUtils]: 64: Hoare triple {6784#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6784#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:43,378 INFO L273 TraceCheckUtils]: 65: Hoare triple {6784#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6785#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:43,391 INFO L273 TraceCheckUtils]: 66: Hoare triple {6785#(<= main_~i~0 15)} assume true; {6785#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:43,403 INFO L273 TraceCheckUtils]: 67: Hoare triple {6785#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6785#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:43,416 INFO L273 TraceCheckUtils]: 68: Hoare triple {6785#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6785#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:43,429 INFO L273 TraceCheckUtils]: 69: Hoare triple {6785#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6786#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:43,438 INFO L273 TraceCheckUtils]: 70: Hoare triple {6786#(<= main_~i~0 16)} assume true; {6786#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:43,449 INFO L273 TraceCheckUtils]: 71: Hoare triple {6786#(<= main_~i~0 16)} assume !(~i~0 < 100000); {6769#false} is VALID [2018-11-18 22:56:43,449 INFO L273 TraceCheckUtils]: 72: Hoare triple {6769#false} havoc ~x~0;~x~0 := 0; {6769#false} is VALID [2018-11-18 22:56:43,449 INFO L273 TraceCheckUtils]: 73: Hoare triple {6769#false} assume true; {6769#false} is VALID [2018-11-18 22:56:43,449 INFO L273 TraceCheckUtils]: 74: Hoare triple {6769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6769#false} is VALID [2018-11-18 22:56:43,450 INFO L256 TraceCheckUtils]: 75: Hoare triple {6769#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {6769#false} is VALID [2018-11-18 22:56:43,450 INFO L273 TraceCheckUtils]: 76: Hoare triple {6769#false} ~cond := #in~cond; {6769#false} is VALID [2018-11-18 22:56:43,450 INFO L273 TraceCheckUtils]: 77: Hoare triple {6769#false} assume 0 == ~cond; {6769#false} is VALID [2018-11-18 22:56:43,450 INFO L273 TraceCheckUtils]: 78: Hoare triple {6769#false} assume !false; {6769#false} is VALID [2018-11-18 22:56:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:43,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:43,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:56:43,494 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-18 22:56:43,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:43,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:56:43,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:43,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:56:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:56:43,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:56:43,899 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 20 states. [2018-11-18 22:56:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:44,141 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2018-11-18 22:56:44,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:56:44,141 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-18 22:56:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:56:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 122 transitions. [2018-11-18 22:56:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:56:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 122 transitions. [2018-11-18 22:56:44,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 122 transitions. [2018-11-18 22:56:44,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:44,257 INFO L225 Difference]: With dead ends: 102 [2018-11-18 22:56:44,258 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 22:56:44,258 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:56:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 22:56:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-18 22:56:44,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:44,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2018-11-18 22:56:44,278 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2018-11-18 22:56:44,278 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2018-11-18 22:56:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:44,280 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-11-18 22:56:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-11-18 22:56:44,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:44,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:44,281 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2018-11-18 22:56:44,281 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2018-11-18 22:56:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:44,283 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-11-18 22:56:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-11-18 22:56:44,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:44,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:44,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:44,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 22:56:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2018-11-18 22:56:44,286 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 79 [2018-11-18 22:56:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:44,286 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2018-11-18 22:56:44,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:56:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2018-11-18 22:56:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 22:56:44,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:44,287 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:44,287 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:44,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:44,287 INFO L82 PathProgramCache]: Analyzing trace with hash -595274696, now seen corresponding path program 17 times [2018-11-18 22:56:44,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:44,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:44,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:44,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {7447#true} call ULTIMATE.init(); {7447#true} is VALID [2018-11-18 22:56:44,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {7447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7447#true} is VALID [2018-11-18 22:56:44,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-18 22:56:44,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7447#true} {7447#true} #57#return; {7447#true} is VALID [2018-11-18 22:56:44,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {7447#true} call #t~ret4 := main(); {7447#true} is VALID [2018-11-18 22:56:44,598 INFO L273 TraceCheckUtils]: 5: Hoare triple {7447#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {7449#(= main_~i~0 0)} is VALID [2018-11-18 22:56:44,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {7449#(= main_~i~0 0)} assume true; {7449#(= main_~i~0 0)} is VALID [2018-11-18 22:56:44,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {7449#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7449#(= main_~i~0 0)} is VALID [2018-11-18 22:56:44,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {7449#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7449#(= main_~i~0 0)} is VALID [2018-11-18 22:56:44,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {7449#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7450#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {7450#(<= main_~i~0 1)} assume true; {7450#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {7450#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7450#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {7450#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7450#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {7450#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7451#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {7451#(<= main_~i~0 2)} assume true; {7451#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {7451#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7451#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {7451#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7451#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {7451#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7452#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {7452#(<= main_~i~0 3)} assume true; {7452#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {7452#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7452#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {7452#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7452#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {7452#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7453#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {7453#(<= main_~i~0 4)} assume true; {7453#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {7453#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7453#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {7453#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7453#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {7453#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7454#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:44,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {7454#(<= main_~i~0 5)} assume true; {7454#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:44,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {7454#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7454#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:44,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {7454#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7454#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:44,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {7454#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7455#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:44,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {7455#(<= main_~i~0 6)} assume true; {7455#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:44,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {7455#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7455#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:44,612 INFO L273 TraceCheckUtils]: 32: Hoare triple {7455#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7455#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:44,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {7455#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7456#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:44,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {7456#(<= main_~i~0 7)} assume true; {7456#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:44,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {7456#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7456#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:44,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {7456#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7456#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:44,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {7456#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7457#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:44,615 INFO L273 TraceCheckUtils]: 38: Hoare triple {7457#(<= main_~i~0 8)} assume true; {7457#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:44,615 INFO L273 TraceCheckUtils]: 39: Hoare triple {7457#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7457#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:44,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {7457#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7457#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:44,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {7457#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7458#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:44,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {7458#(<= main_~i~0 9)} assume true; {7458#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:44,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {7458#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7458#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:44,618 INFO L273 TraceCheckUtils]: 44: Hoare triple {7458#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7458#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:44,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {7458#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7459#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:44,619 INFO L273 TraceCheckUtils]: 46: Hoare triple {7459#(<= main_~i~0 10)} assume true; {7459#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:44,620 INFO L273 TraceCheckUtils]: 47: Hoare triple {7459#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7459#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:44,620 INFO L273 TraceCheckUtils]: 48: Hoare triple {7459#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7459#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:44,621 INFO L273 TraceCheckUtils]: 49: Hoare triple {7459#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7460#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:44,621 INFO L273 TraceCheckUtils]: 50: Hoare triple {7460#(<= main_~i~0 11)} assume true; {7460#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:44,622 INFO L273 TraceCheckUtils]: 51: Hoare triple {7460#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7460#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:44,622 INFO L273 TraceCheckUtils]: 52: Hoare triple {7460#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7460#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:44,623 INFO L273 TraceCheckUtils]: 53: Hoare triple {7460#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7461#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:44,623 INFO L273 TraceCheckUtils]: 54: Hoare triple {7461#(<= main_~i~0 12)} assume true; {7461#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:44,624 INFO L273 TraceCheckUtils]: 55: Hoare triple {7461#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7461#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:44,624 INFO L273 TraceCheckUtils]: 56: Hoare triple {7461#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7461#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:44,625 INFO L273 TraceCheckUtils]: 57: Hoare triple {7461#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7462#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:44,626 INFO L273 TraceCheckUtils]: 58: Hoare triple {7462#(<= main_~i~0 13)} assume true; {7462#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:44,626 INFO L273 TraceCheckUtils]: 59: Hoare triple {7462#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7462#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:44,627 INFO L273 TraceCheckUtils]: 60: Hoare triple {7462#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7462#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:44,627 INFO L273 TraceCheckUtils]: 61: Hoare triple {7462#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7463#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:44,628 INFO L273 TraceCheckUtils]: 62: Hoare triple {7463#(<= main_~i~0 14)} assume true; {7463#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:44,628 INFO L273 TraceCheckUtils]: 63: Hoare triple {7463#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7463#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:44,629 INFO L273 TraceCheckUtils]: 64: Hoare triple {7463#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7463#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:44,629 INFO L273 TraceCheckUtils]: 65: Hoare triple {7463#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7464#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:44,630 INFO L273 TraceCheckUtils]: 66: Hoare triple {7464#(<= main_~i~0 15)} assume true; {7464#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:44,630 INFO L273 TraceCheckUtils]: 67: Hoare triple {7464#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7464#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:44,631 INFO L273 TraceCheckUtils]: 68: Hoare triple {7464#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7464#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:44,632 INFO L273 TraceCheckUtils]: 69: Hoare triple {7464#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7465#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:44,632 INFO L273 TraceCheckUtils]: 70: Hoare triple {7465#(<= main_~i~0 16)} assume true; {7465#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:44,633 INFO L273 TraceCheckUtils]: 71: Hoare triple {7465#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7465#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:44,633 INFO L273 TraceCheckUtils]: 72: Hoare triple {7465#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7465#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:44,634 INFO L273 TraceCheckUtils]: 73: Hoare triple {7465#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7466#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:44,634 INFO L273 TraceCheckUtils]: 74: Hoare triple {7466#(<= main_~i~0 17)} assume true; {7466#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:44,635 INFO L273 TraceCheckUtils]: 75: Hoare triple {7466#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7448#false} is VALID [2018-11-18 22:56:44,635 INFO L273 TraceCheckUtils]: 76: Hoare triple {7448#false} havoc ~x~0;~x~0 := 0; {7448#false} is VALID [2018-11-18 22:56:44,635 INFO L273 TraceCheckUtils]: 77: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-18 22:56:44,636 INFO L273 TraceCheckUtils]: 78: Hoare triple {7448#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7448#false} is VALID [2018-11-18 22:56:44,636 INFO L256 TraceCheckUtils]: 79: Hoare triple {7448#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {7448#false} is VALID [2018-11-18 22:56:44,636 INFO L273 TraceCheckUtils]: 80: Hoare triple {7448#false} ~cond := #in~cond; {7448#false} is VALID [2018-11-18 22:56:44,636 INFO L273 TraceCheckUtils]: 81: Hoare triple {7448#false} assume 0 == ~cond; {7448#false} is VALID [2018-11-18 22:56:44,636 INFO L273 TraceCheckUtils]: 82: Hoare triple {7448#false} assume !false; {7448#false} is VALID [2018-11-18 22:56:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:44,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:44,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:44,655 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:56:44,759 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-18 22:56:44,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:44,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:45,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {7447#true} call ULTIMATE.init(); {7447#true} is VALID [2018-11-18 22:56:45,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {7447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7447#true} is VALID [2018-11-18 22:56:45,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-18 22:56:45,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7447#true} {7447#true} #57#return; {7447#true} is VALID [2018-11-18 22:56:45,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {7447#true} call #t~ret4 := main(); {7447#true} is VALID [2018-11-18 22:56:45,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {7447#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {7485#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:45,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {7485#(<= main_~i~0 0)} assume true; {7485#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:45,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {7485#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7485#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:45,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {7485#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7485#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:45,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {7485#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7450#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:45,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {7450#(<= main_~i~0 1)} assume true; {7450#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:45,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {7450#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7450#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:45,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {7450#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7450#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:45,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {7450#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7451#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:45,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {7451#(<= main_~i~0 2)} assume true; {7451#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:45,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {7451#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7451#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:45,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {7451#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7451#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:45,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {7451#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7452#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:45,070 INFO L273 TraceCheckUtils]: 18: Hoare triple {7452#(<= main_~i~0 3)} assume true; {7452#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:45,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {7452#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7452#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:45,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {7452#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7452#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:45,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {7452#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7453#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:45,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {7453#(<= main_~i~0 4)} assume true; {7453#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:45,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {7453#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7453#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:45,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {7453#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7453#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:45,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {7453#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7454#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:45,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {7454#(<= main_~i~0 5)} assume true; {7454#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:45,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {7454#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7454#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:45,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {7454#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7454#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:45,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {7454#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7455#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:45,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {7455#(<= main_~i~0 6)} assume true; {7455#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:45,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {7455#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7455#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:45,078 INFO L273 TraceCheckUtils]: 32: Hoare triple {7455#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7455#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:45,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {7455#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7456#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:45,079 INFO L273 TraceCheckUtils]: 34: Hoare triple {7456#(<= main_~i~0 7)} assume true; {7456#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:45,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {7456#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7456#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:45,080 INFO L273 TraceCheckUtils]: 36: Hoare triple {7456#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7456#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:45,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {7456#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7457#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:45,081 INFO L273 TraceCheckUtils]: 38: Hoare triple {7457#(<= main_~i~0 8)} assume true; {7457#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:45,082 INFO L273 TraceCheckUtils]: 39: Hoare triple {7457#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7457#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:45,082 INFO L273 TraceCheckUtils]: 40: Hoare triple {7457#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7457#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:45,083 INFO L273 TraceCheckUtils]: 41: Hoare triple {7457#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7458#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:45,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {7458#(<= main_~i~0 9)} assume true; {7458#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:45,084 INFO L273 TraceCheckUtils]: 43: Hoare triple {7458#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7458#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:45,084 INFO L273 TraceCheckUtils]: 44: Hoare triple {7458#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7458#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:45,085 INFO L273 TraceCheckUtils]: 45: Hoare triple {7458#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7459#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:45,085 INFO L273 TraceCheckUtils]: 46: Hoare triple {7459#(<= main_~i~0 10)} assume true; {7459#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:45,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {7459#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7459#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:45,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {7459#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7459#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:45,087 INFO L273 TraceCheckUtils]: 49: Hoare triple {7459#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7460#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:45,088 INFO L273 TraceCheckUtils]: 50: Hoare triple {7460#(<= main_~i~0 11)} assume true; {7460#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:45,088 INFO L273 TraceCheckUtils]: 51: Hoare triple {7460#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7460#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:45,089 INFO L273 TraceCheckUtils]: 52: Hoare triple {7460#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7460#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:45,089 INFO L273 TraceCheckUtils]: 53: Hoare triple {7460#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7461#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:45,090 INFO L273 TraceCheckUtils]: 54: Hoare triple {7461#(<= main_~i~0 12)} assume true; {7461#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:45,090 INFO L273 TraceCheckUtils]: 55: Hoare triple {7461#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7461#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:45,091 INFO L273 TraceCheckUtils]: 56: Hoare triple {7461#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7461#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:45,091 INFO L273 TraceCheckUtils]: 57: Hoare triple {7461#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7462#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:45,092 INFO L273 TraceCheckUtils]: 58: Hoare triple {7462#(<= main_~i~0 13)} assume true; {7462#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:45,092 INFO L273 TraceCheckUtils]: 59: Hoare triple {7462#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7462#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:45,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {7462#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7462#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:45,094 INFO L273 TraceCheckUtils]: 61: Hoare triple {7462#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7463#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:45,094 INFO L273 TraceCheckUtils]: 62: Hoare triple {7463#(<= main_~i~0 14)} assume true; {7463#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:45,095 INFO L273 TraceCheckUtils]: 63: Hoare triple {7463#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7463#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:45,095 INFO L273 TraceCheckUtils]: 64: Hoare triple {7463#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7463#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:45,096 INFO L273 TraceCheckUtils]: 65: Hoare triple {7463#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7464#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:45,096 INFO L273 TraceCheckUtils]: 66: Hoare triple {7464#(<= main_~i~0 15)} assume true; {7464#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:45,097 INFO L273 TraceCheckUtils]: 67: Hoare triple {7464#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7464#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:45,097 INFO L273 TraceCheckUtils]: 68: Hoare triple {7464#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7464#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:45,098 INFO L273 TraceCheckUtils]: 69: Hoare triple {7464#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7465#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:45,099 INFO L273 TraceCheckUtils]: 70: Hoare triple {7465#(<= main_~i~0 16)} assume true; {7465#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:45,099 INFO L273 TraceCheckUtils]: 71: Hoare triple {7465#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7465#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:45,100 INFO L273 TraceCheckUtils]: 72: Hoare triple {7465#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7465#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:45,100 INFO L273 TraceCheckUtils]: 73: Hoare triple {7465#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7466#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:45,101 INFO L273 TraceCheckUtils]: 74: Hoare triple {7466#(<= main_~i~0 17)} assume true; {7466#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:45,102 INFO L273 TraceCheckUtils]: 75: Hoare triple {7466#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7448#false} is VALID [2018-11-18 22:56:45,102 INFO L273 TraceCheckUtils]: 76: Hoare triple {7448#false} havoc ~x~0;~x~0 := 0; {7448#false} is VALID [2018-11-18 22:56:45,102 INFO L273 TraceCheckUtils]: 77: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-18 22:56:45,102 INFO L273 TraceCheckUtils]: 78: Hoare triple {7448#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7448#false} is VALID [2018-11-18 22:56:45,102 INFO L256 TraceCheckUtils]: 79: Hoare triple {7448#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {7448#false} is VALID [2018-11-18 22:56:45,103 INFO L273 TraceCheckUtils]: 80: Hoare triple {7448#false} ~cond := #in~cond; {7448#false} is VALID [2018-11-18 22:56:45,103 INFO L273 TraceCheckUtils]: 81: Hoare triple {7448#false} assume 0 == ~cond; {7448#false} is VALID [2018-11-18 22:56:45,103 INFO L273 TraceCheckUtils]: 82: Hoare triple {7448#false} assume !false; {7448#false} is VALID [2018-11-18 22:56:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:45,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:45,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-18 22:56:45,128 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2018-11-18 22:56:45,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:45,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:56:45,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:45,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:56:45,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:56:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:56:45,224 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 21 states. [2018-11-18 22:56:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:45,826 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2018-11-18 22:56:45,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:56:45,826 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2018-11-18 22:56:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:56:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 127 transitions. [2018-11-18 22:56:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:56:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 127 transitions. [2018-11-18 22:56:45,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 127 transitions. [2018-11-18 22:56:45,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:45,958 INFO L225 Difference]: With dead ends: 106 [2018-11-18 22:56:45,958 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 22:56:45,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:56:45,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 22:56:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-11-18 22:56:45,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:45,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 92 states. [2018-11-18 22:56:45,974 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 92 states. [2018-11-18 22:56:45,974 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 92 states. [2018-11-18 22:56:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:45,976 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-11-18 22:56:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-18 22:56:45,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:45,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:45,977 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 94 states. [2018-11-18 22:56:45,978 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 94 states. [2018-11-18 22:56:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:45,980 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-11-18 22:56:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-18 22:56:45,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:45,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:45,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:45,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 22:56:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2018-11-18 22:56:45,982 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 83 [2018-11-18 22:56:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:45,982 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2018-11-18 22:56:45,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:56:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2018-11-18 22:56:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 22:56:45,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:45,984 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:45,984 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:45,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1093833870, now seen corresponding path program 18 times [2018-11-18 22:56:45,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:45,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:45,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:45,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:45,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:46,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {8157#true} call ULTIMATE.init(); {8157#true} is VALID [2018-11-18 22:56:46,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {8157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8157#true} is VALID [2018-11-18 22:56:46,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {8157#true} assume true; {8157#true} is VALID [2018-11-18 22:56:46,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8157#true} {8157#true} #57#return; {8157#true} is VALID [2018-11-18 22:56:46,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {8157#true} call #t~ret4 := main(); {8157#true} is VALID [2018-11-18 22:56:46,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {8157#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {8159#(= main_~i~0 0)} is VALID [2018-11-18 22:56:46,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {8159#(= main_~i~0 0)} assume true; {8159#(= main_~i~0 0)} is VALID [2018-11-18 22:56:46,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {8159#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8159#(= main_~i~0 0)} is VALID [2018-11-18 22:56:46,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {8159#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8159#(= main_~i~0 0)} is VALID [2018-11-18 22:56:46,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {8159#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8160#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {8160#(<= main_~i~0 1)} assume true; {8160#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {8160#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8160#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {8160#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8160#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {8160#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8161#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,421 INFO L273 TraceCheckUtils]: 14: Hoare triple {8161#(<= main_~i~0 2)} assume true; {8161#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {8161#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8161#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {8161#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8161#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {8161#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8162#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {8162#(<= main_~i~0 3)} assume true; {8162#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {8162#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8162#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {8162#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8162#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,425 INFO L273 TraceCheckUtils]: 21: Hoare triple {8162#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8163#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {8163#(<= main_~i~0 4)} assume true; {8163#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {8163#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8163#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {8163#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8163#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {8163#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8164#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,428 INFO L273 TraceCheckUtils]: 26: Hoare triple {8164#(<= main_~i~0 5)} assume true; {8164#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {8164#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8164#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,429 INFO L273 TraceCheckUtils]: 28: Hoare triple {8164#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8164#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {8164#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8165#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:46,430 INFO L273 TraceCheckUtils]: 30: Hoare triple {8165#(<= main_~i~0 6)} assume true; {8165#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:46,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {8165#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8165#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:46,431 INFO L273 TraceCheckUtils]: 32: Hoare triple {8165#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8165#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:46,432 INFO L273 TraceCheckUtils]: 33: Hoare triple {8165#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8166#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:46,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {8166#(<= main_~i~0 7)} assume true; {8166#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:46,433 INFO L273 TraceCheckUtils]: 35: Hoare triple {8166#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8166#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:46,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {8166#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8166#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:46,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {8166#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8167#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:46,434 INFO L273 TraceCheckUtils]: 38: Hoare triple {8167#(<= main_~i~0 8)} assume true; {8167#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:46,435 INFO L273 TraceCheckUtils]: 39: Hoare triple {8167#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8167#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:46,436 INFO L273 TraceCheckUtils]: 40: Hoare triple {8167#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8167#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:46,436 INFO L273 TraceCheckUtils]: 41: Hoare triple {8167#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8168#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:46,437 INFO L273 TraceCheckUtils]: 42: Hoare triple {8168#(<= main_~i~0 9)} assume true; {8168#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:46,437 INFO L273 TraceCheckUtils]: 43: Hoare triple {8168#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8168#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:46,438 INFO L273 TraceCheckUtils]: 44: Hoare triple {8168#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8168#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:46,439 INFO L273 TraceCheckUtils]: 45: Hoare triple {8168#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8169#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:46,439 INFO L273 TraceCheckUtils]: 46: Hoare triple {8169#(<= main_~i~0 10)} assume true; {8169#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:46,440 INFO L273 TraceCheckUtils]: 47: Hoare triple {8169#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8169#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:46,440 INFO L273 TraceCheckUtils]: 48: Hoare triple {8169#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8169#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:46,441 INFO L273 TraceCheckUtils]: 49: Hoare triple {8169#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8170#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:46,441 INFO L273 TraceCheckUtils]: 50: Hoare triple {8170#(<= main_~i~0 11)} assume true; {8170#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:46,442 INFO L273 TraceCheckUtils]: 51: Hoare triple {8170#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8170#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:46,442 INFO L273 TraceCheckUtils]: 52: Hoare triple {8170#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8170#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:46,443 INFO L273 TraceCheckUtils]: 53: Hoare triple {8170#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8171#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:46,444 INFO L273 TraceCheckUtils]: 54: Hoare triple {8171#(<= main_~i~0 12)} assume true; {8171#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:46,444 INFO L273 TraceCheckUtils]: 55: Hoare triple {8171#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8171#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:46,445 INFO L273 TraceCheckUtils]: 56: Hoare triple {8171#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8171#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:46,445 INFO L273 TraceCheckUtils]: 57: Hoare triple {8171#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8172#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:46,446 INFO L273 TraceCheckUtils]: 58: Hoare triple {8172#(<= main_~i~0 13)} assume true; {8172#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:46,446 INFO L273 TraceCheckUtils]: 59: Hoare triple {8172#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8172#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:46,447 INFO L273 TraceCheckUtils]: 60: Hoare triple {8172#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8172#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:46,448 INFO L273 TraceCheckUtils]: 61: Hoare triple {8172#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8173#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:46,448 INFO L273 TraceCheckUtils]: 62: Hoare triple {8173#(<= main_~i~0 14)} assume true; {8173#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:46,448 INFO L273 TraceCheckUtils]: 63: Hoare triple {8173#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8173#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:46,449 INFO L273 TraceCheckUtils]: 64: Hoare triple {8173#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8173#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:46,450 INFO L273 TraceCheckUtils]: 65: Hoare triple {8173#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8174#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:46,450 INFO L273 TraceCheckUtils]: 66: Hoare triple {8174#(<= main_~i~0 15)} assume true; {8174#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:46,451 INFO L273 TraceCheckUtils]: 67: Hoare triple {8174#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8174#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:46,451 INFO L273 TraceCheckUtils]: 68: Hoare triple {8174#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8174#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:46,452 INFO L273 TraceCheckUtils]: 69: Hoare triple {8174#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8175#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:46,452 INFO L273 TraceCheckUtils]: 70: Hoare triple {8175#(<= main_~i~0 16)} assume true; {8175#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:46,453 INFO L273 TraceCheckUtils]: 71: Hoare triple {8175#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8175#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:46,453 INFO L273 TraceCheckUtils]: 72: Hoare triple {8175#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8175#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:46,454 INFO L273 TraceCheckUtils]: 73: Hoare triple {8175#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8176#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:46,455 INFO L273 TraceCheckUtils]: 74: Hoare triple {8176#(<= main_~i~0 17)} assume true; {8176#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:46,455 INFO L273 TraceCheckUtils]: 75: Hoare triple {8176#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8176#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:46,456 INFO L273 TraceCheckUtils]: 76: Hoare triple {8176#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8176#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:46,456 INFO L273 TraceCheckUtils]: 77: Hoare triple {8176#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {8177#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:46,457 INFO L273 TraceCheckUtils]: 78: Hoare triple {8177#(<= main_~i~0 18)} assume true; {8177#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:46,458 INFO L273 TraceCheckUtils]: 79: Hoare triple {8177#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8158#false} is VALID [2018-11-18 22:56:46,458 INFO L273 TraceCheckUtils]: 80: Hoare triple {8158#false} havoc ~x~0;~x~0 := 0; {8158#false} is VALID [2018-11-18 22:56:46,458 INFO L273 TraceCheckUtils]: 81: Hoare triple {8158#false} assume true; {8158#false} is VALID [2018-11-18 22:56:46,458 INFO L273 TraceCheckUtils]: 82: Hoare triple {8158#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8158#false} is VALID [2018-11-18 22:56:46,458 INFO L256 TraceCheckUtils]: 83: Hoare triple {8158#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {8158#false} is VALID [2018-11-18 22:56:46,459 INFO L273 TraceCheckUtils]: 84: Hoare triple {8158#false} ~cond := #in~cond; {8158#false} is VALID [2018-11-18 22:56:46,459 INFO L273 TraceCheckUtils]: 85: Hoare triple {8158#false} assume 0 == ~cond; {8158#false} is VALID [2018-11-18 22:56:46,459 INFO L273 TraceCheckUtils]: 86: Hoare triple {8158#false} assume !false; {8158#false} is VALID [2018-11-18 22:56:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:46,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:46,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:46,474 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:56:46,525 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-18 22:56:46,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:46,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:46,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {8157#true} call ULTIMATE.init(); {8157#true} is VALID [2018-11-18 22:56:46,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {8157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8157#true} is VALID [2018-11-18 22:56:46,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {8157#true} assume true; {8157#true} is VALID [2018-11-18 22:56:46,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8157#true} {8157#true} #57#return; {8157#true} is VALID [2018-11-18 22:56:46,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {8157#true} call #t~ret4 := main(); {8157#true} is VALID [2018-11-18 22:56:46,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {8157#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {8196#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:46,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {8196#(<= main_~i~0 0)} assume true; {8196#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:46,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {8196#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8196#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:46,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {8196#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8196#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:46,838 INFO L273 TraceCheckUtils]: 9: Hoare triple {8196#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8160#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,839 INFO L273 TraceCheckUtils]: 10: Hoare triple {8160#(<= main_~i~0 1)} assume true; {8160#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,839 INFO L273 TraceCheckUtils]: 11: Hoare triple {8160#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8160#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,839 INFO L273 TraceCheckUtils]: 12: Hoare triple {8160#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8160#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,840 INFO L273 TraceCheckUtils]: 13: Hoare triple {8160#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8161#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {8161#(<= main_~i~0 2)} assume true; {8161#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {8161#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8161#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {8161#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8161#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {8161#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8162#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {8162#(<= main_~i~0 3)} assume true; {8162#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,843 INFO L273 TraceCheckUtils]: 19: Hoare triple {8162#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8162#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {8162#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8162#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,844 INFO L273 TraceCheckUtils]: 21: Hoare triple {8162#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8163#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,845 INFO L273 TraceCheckUtils]: 22: Hoare triple {8163#(<= main_~i~0 4)} assume true; {8163#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,845 INFO L273 TraceCheckUtils]: 23: Hoare triple {8163#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8163#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {8163#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8163#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {8163#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8164#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,847 INFO L273 TraceCheckUtils]: 26: Hoare triple {8164#(<= main_~i~0 5)} assume true; {8164#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,847 INFO L273 TraceCheckUtils]: 27: Hoare triple {8164#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8164#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {8164#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8164#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,849 INFO L273 TraceCheckUtils]: 29: Hoare triple {8164#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8165#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:46,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {8165#(<= main_~i~0 6)} assume true; {8165#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:46,850 INFO L273 TraceCheckUtils]: 31: Hoare triple {8165#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8165#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:46,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {8165#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8165#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:46,851 INFO L273 TraceCheckUtils]: 33: Hoare triple {8165#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8166#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:46,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {8166#(<= main_~i~0 7)} assume true; {8166#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:46,852 INFO L273 TraceCheckUtils]: 35: Hoare triple {8166#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8166#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:46,852 INFO L273 TraceCheckUtils]: 36: Hoare triple {8166#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8166#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:46,853 INFO L273 TraceCheckUtils]: 37: Hoare triple {8166#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8167#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:46,854 INFO L273 TraceCheckUtils]: 38: Hoare triple {8167#(<= main_~i~0 8)} assume true; {8167#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:46,854 INFO L273 TraceCheckUtils]: 39: Hoare triple {8167#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8167#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:46,855 INFO L273 TraceCheckUtils]: 40: Hoare triple {8167#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8167#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:46,855 INFO L273 TraceCheckUtils]: 41: Hoare triple {8167#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8168#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:46,856 INFO L273 TraceCheckUtils]: 42: Hoare triple {8168#(<= main_~i~0 9)} assume true; {8168#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:46,856 INFO L273 TraceCheckUtils]: 43: Hoare triple {8168#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8168#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:46,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {8168#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8168#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:46,858 INFO L273 TraceCheckUtils]: 45: Hoare triple {8168#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8169#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:46,858 INFO L273 TraceCheckUtils]: 46: Hoare triple {8169#(<= main_~i~0 10)} assume true; {8169#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:46,859 INFO L273 TraceCheckUtils]: 47: Hoare triple {8169#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8169#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:46,859 INFO L273 TraceCheckUtils]: 48: Hoare triple {8169#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8169#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:46,860 INFO L273 TraceCheckUtils]: 49: Hoare triple {8169#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8170#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:46,860 INFO L273 TraceCheckUtils]: 50: Hoare triple {8170#(<= main_~i~0 11)} assume true; {8170#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:46,861 INFO L273 TraceCheckUtils]: 51: Hoare triple {8170#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8170#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:46,862 INFO L273 TraceCheckUtils]: 52: Hoare triple {8170#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8170#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:46,862 INFO L273 TraceCheckUtils]: 53: Hoare triple {8170#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8171#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:46,863 INFO L273 TraceCheckUtils]: 54: Hoare triple {8171#(<= main_~i~0 12)} assume true; {8171#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:46,863 INFO L273 TraceCheckUtils]: 55: Hoare triple {8171#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8171#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:46,864 INFO L273 TraceCheckUtils]: 56: Hoare triple {8171#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8171#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:46,864 INFO L273 TraceCheckUtils]: 57: Hoare triple {8171#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8172#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:46,865 INFO L273 TraceCheckUtils]: 58: Hoare triple {8172#(<= main_~i~0 13)} assume true; {8172#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:46,866 INFO L273 TraceCheckUtils]: 59: Hoare triple {8172#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8172#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:46,866 INFO L273 TraceCheckUtils]: 60: Hoare triple {8172#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8172#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:46,867 INFO L273 TraceCheckUtils]: 61: Hoare triple {8172#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8173#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:46,867 INFO L273 TraceCheckUtils]: 62: Hoare triple {8173#(<= main_~i~0 14)} assume true; {8173#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:46,868 INFO L273 TraceCheckUtils]: 63: Hoare triple {8173#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8173#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:46,868 INFO L273 TraceCheckUtils]: 64: Hoare triple {8173#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8173#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:46,869 INFO L273 TraceCheckUtils]: 65: Hoare triple {8173#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8174#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:46,870 INFO L273 TraceCheckUtils]: 66: Hoare triple {8174#(<= main_~i~0 15)} assume true; {8174#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:46,870 INFO L273 TraceCheckUtils]: 67: Hoare triple {8174#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8174#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:46,871 INFO L273 TraceCheckUtils]: 68: Hoare triple {8174#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8174#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:46,871 INFO L273 TraceCheckUtils]: 69: Hoare triple {8174#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8175#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:46,872 INFO L273 TraceCheckUtils]: 70: Hoare triple {8175#(<= main_~i~0 16)} assume true; {8175#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:46,872 INFO L273 TraceCheckUtils]: 71: Hoare triple {8175#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8175#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:46,873 INFO L273 TraceCheckUtils]: 72: Hoare triple {8175#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8175#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:46,874 INFO L273 TraceCheckUtils]: 73: Hoare triple {8175#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8176#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:46,874 INFO L273 TraceCheckUtils]: 74: Hoare triple {8176#(<= main_~i~0 17)} assume true; {8176#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:46,875 INFO L273 TraceCheckUtils]: 75: Hoare triple {8176#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8176#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:46,875 INFO L273 TraceCheckUtils]: 76: Hoare triple {8176#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8176#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:46,876 INFO L273 TraceCheckUtils]: 77: Hoare triple {8176#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {8177#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:46,877 INFO L273 TraceCheckUtils]: 78: Hoare triple {8177#(<= main_~i~0 18)} assume true; {8177#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:46,877 INFO L273 TraceCheckUtils]: 79: Hoare triple {8177#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8158#false} is VALID [2018-11-18 22:56:46,877 INFO L273 TraceCheckUtils]: 80: Hoare triple {8158#false} havoc ~x~0;~x~0 := 0; {8158#false} is VALID [2018-11-18 22:56:46,878 INFO L273 TraceCheckUtils]: 81: Hoare triple {8158#false} assume true; {8158#false} is VALID [2018-11-18 22:56:46,878 INFO L273 TraceCheckUtils]: 82: Hoare triple {8158#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8158#false} is VALID [2018-11-18 22:56:46,878 INFO L256 TraceCheckUtils]: 83: Hoare triple {8158#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {8158#false} is VALID [2018-11-18 22:56:46,878 INFO L273 TraceCheckUtils]: 84: Hoare triple {8158#false} ~cond := #in~cond; {8158#false} is VALID [2018-11-18 22:56:46,878 INFO L273 TraceCheckUtils]: 85: Hoare triple {8158#false} assume 0 == ~cond; {8158#false} is VALID [2018-11-18 22:56:46,879 INFO L273 TraceCheckUtils]: 86: Hoare triple {8158#false} assume !false; {8158#false} is VALID [2018-11-18 22:56:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:46,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:46,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-18 22:56:46,912 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-11-18 22:56:46,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:46,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-18 22:56:46,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:46,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 22:56:46,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 22:56:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:56:46,998 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand 22 states. [2018-11-18 22:56:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:47,454 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2018-11-18 22:56:47,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 22:56:47,454 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-11-18 22:56:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:56:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 132 transitions. [2018-11-18 22:56:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:56:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 132 transitions. [2018-11-18 22:56:47,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 132 transitions. [2018-11-18 22:56:47,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:47,572 INFO L225 Difference]: With dead ends: 110 [2018-11-18 22:56:47,572 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 22:56:47,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:56:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 22:56:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-18 22:56:47,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:47,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2018-11-18 22:56:47,589 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2018-11-18 22:56:47,590 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2018-11-18 22:56:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:47,592 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2018-11-18 22:56:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-18 22:56:47,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:47,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:47,592 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2018-11-18 22:56:47,592 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2018-11-18 22:56:47,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:47,594 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2018-11-18 22:56:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-18 22:56:47,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:47,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:47,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:47,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-18 22:56:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2018-11-18 22:56:47,597 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 87 [2018-11-18 22:56:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:47,597 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2018-11-18 22:56:47,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 22:56:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-11-18 22:56:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 22:56:47,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:47,599 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:47,599 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:47,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:47,599 INFO L82 PathProgramCache]: Analyzing trace with hash 498874852, now seen corresponding path program 19 times [2018-11-18 22:56:47,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:47,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:47,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:47,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:47,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:48,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {8898#true} call ULTIMATE.init(); {8898#true} is VALID [2018-11-18 22:56:48,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {8898#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8898#true} is VALID [2018-11-18 22:56:48,195 INFO L273 TraceCheckUtils]: 2: Hoare triple {8898#true} assume true; {8898#true} is VALID [2018-11-18 22:56:48,195 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8898#true} {8898#true} #57#return; {8898#true} is VALID [2018-11-18 22:56:48,195 INFO L256 TraceCheckUtils]: 4: Hoare triple {8898#true} call #t~ret4 := main(); {8898#true} is VALID [2018-11-18 22:56:48,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {8898#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {8900#(= main_~i~0 0)} is VALID [2018-11-18 22:56:48,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {8900#(= main_~i~0 0)} assume true; {8900#(= main_~i~0 0)} is VALID [2018-11-18 22:56:48,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {8900#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8900#(= main_~i~0 0)} is VALID [2018-11-18 22:56:48,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {8900#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8900#(= main_~i~0 0)} is VALID [2018-11-18 22:56:48,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {8900#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8901#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {8901#(<= main_~i~0 1)} assume true; {8901#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {8901#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8901#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {8901#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8901#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {8901#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8902#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {8902#(<= main_~i~0 2)} assume true; {8902#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {8902#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8902#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {8902#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8902#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {8902#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8903#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {8903#(<= main_~i~0 3)} assume true; {8903#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {8903#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8903#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {8903#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8903#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {8903#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8904#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {8904#(<= main_~i~0 4)} assume true; {8904#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {8904#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8904#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {8904#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8904#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {8904#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8905#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,208 INFO L273 TraceCheckUtils]: 26: Hoare triple {8905#(<= main_~i~0 5)} assume true; {8905#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {8905#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8905#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,209 INFO L273 TraceCheckUtils]: 28: Hoare triple {8905#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8905#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,209 INFO L273 TraceCheckUtils]: 29: Hoare triple {8905#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8906#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,210 INFO L273 TraceCheckUtils]: 30: Hoare triple {8906#(<= main_~i~0 6)} assume true; {8906#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,210 INFO L273 TraceCheckUtils]: 31: Hoare triple {8906#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8906#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,211 INFO L273 TraceCheckUtils]: 32: Hoare triple {8906#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8906#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,211 INFO L273 TraceCheckUtils]: 33: Hoare triple {8906#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8907#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {8907#(<= main_~i~0 7)} assume true; {8907#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,212 INFO L273 TraceCheckUtils]: 35: Hoare triple {8907#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8907#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,213 INFO L273 TraceCheckUtils]: 36: Hoare triple {8907#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8907#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,214 INFO L273 TraceCheckUtils]: 37: Hoare triple {8907#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8908#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,214 INFO L273 TraceCheckUtils]: 38: Hoare triple {8908#(<= main_~i~0 8)} assume true; {8908#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,215 INFO L273 TraceCheckUtils]: 39: Hoare triple {8908#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8908#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,215 INFO L273 TraceCheckUtils]: 40: Hoare triple {8908#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8908#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,216 INFO L273 TraceCheckUtils]: 41: Hoare triple {8908#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8909#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:48,216 INFO L273 TraceCheckUtils]: 42: Hoare triple {8909#(<= main_~i~0 9)} assume true; {8909#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:48,217 INFO L273 TraceCheckUtils]: 43: Hoare triple {8909#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8909#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:48,217 INFO L273 TraceCheckUtils]: 44: Hoare triple {8909#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8909#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:48,218 INFO L273 TraceCheckUtils]: 45: Hoare triple {8909#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8910#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:48,219 INFO L273 TraceCheckUtils]: 46: Hoare triple {8910#(<= main_~i~0 10)} assume true; {8910#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:48,219 INFO L273 TraceCheckUtils]: 47: Hoare triple {8910#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8910#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:48,219 INFO L273 TraceCheckUtils]: 48: Hoare triple {8910#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8910#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:48,220 INFO L273 TraceCheckUtils]: 49: Hoare triple {8910#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8911#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:48,221 INFO L273 TraceCheckUtils]: 50: Hoare triple {8911#(<= main_~i~0 11)} assume true; {8911#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:48,221 INFO L273 TraceCheckUtils]: 51: Hoare triple {8911#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8911#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:48,222 INFO L273 TraceCheckUtils]: 52: Hoare triple {8911#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8911#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:48,222 INFO L273 TraceCheckUtils]: 53: Hoare triple {8911#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8912#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:48,223 INFO L273 TraceCheckUtils]: 54: Hoare triple {8912#(<= main_~i~0 12)} assume true; {8912#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:48,223 INFO L273 TraceCheckUtils]: 55: Hoare triple {8912#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8912#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:48,224 INFO L273 TraceCheckUtils]: 56: Hoare triple {8912#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8912#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:48,225 INFO L273 TraceCheckUtils]: 57: Hoare triple {8912#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8913#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:48,225 INFO L273 TraceCheckUtils]: 58: Hoare triple {8913#(<= main_~i~0 13)} assume true; {8913#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:48,226 INFO L273 TraceCheckUtils]: 59: Hoare triple {8913#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8913#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:48,226 INFO L273 TraceCheckUtils]: 60: Hoare triple {8913#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8913#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:48,227 INFO L273 TraceCheckUtils]: 61: Hoare triple {8913#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8914#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:48,227 INFO L273 TraceCheckUtils]: 62: Hoare triple {8914#(<= main_~i~0 14)} assume true; {8914#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:48,228 INFO L273 TraceCheckUtils]: 63: Hoare triple {8914#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8914#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:48,228 INFO L273 TraceCheckUtils]: 64: Hoare triple {8914#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8914#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:48,229 INFO L273 TraceCheckUtils]: 65: Hoare triple {8914#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8915#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:48,230 INFO L273 TraceCheckUtils]: 66: Hoare triple {8915#(<= main_~i~0 15)} assume true; {8915#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:48,230 INFO L273 TraceCheckUtils]: 67: Hoare triple {8915#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8915#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:48,231 INFO L273 TraceCheckUtils]: 68: Hoare triple {8915#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8915#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:48,231 INFO L273 TraceCheckUtils]: 69: Hoare triple {8915#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8916#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:48,232 INFO L273 TraceCheckUtils]: 70: Hoare triple {8916#(<= main_~i~0 16)} assume true; {8916#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:48,232 INFO L273 TraceCheckUtils]: 71: Hoare triple {8916#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8916#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:48,233 INFO L273 TraceCheckUtils]: 72: Hoare triple {8916#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8916#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:48,233 INFO L273 TraceCheckUtils]: 73: Hoare triple {8916#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8917#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:48,234 INFO L273 TraceCheckUtils]: 74: Hoare triple {8917#(<= main_~i~0 17)} assume true; {8917#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:48,234 INFO L273 TraceCheckUtils]: 75: Hoare triple {8917#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8917#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:48,235 INFO L273 TraceCheckUtils]: 76: Hoare triple {8917#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8917#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:48,236 INFO L273 TraceCheckUtils]: 77: Hoare triple {8917#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {8918#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:48,236 INFO L273 TraceCheckUtils]: 78: Hoare triple {8918#(<= main_~i~0 18)} assume true; {8918#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:48,237 INFO L273 TraceCheckUtils]: 79: Hoare triple {8918#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8918#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:48,237 INFO L273 TraceCheckUtils]: 80: Hoare triple {8918#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8918#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:48,238 INFO L273 TraceCheckUtils]: 81: Hoare triple {8918#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {8919#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:48,238 INFO L273 TraceCheckUtils]: 82: Hoare triple {8919#(<= main_~i~0 19)} assume true; {8919#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:48,239 INFO L273 TraceCheckUtils]: 83: Hoare triple {8919#(<= main_~i~0 19)} assume !(~i~0 < 100000); {8899#false} is VALID [2018-11-18 22:56:48,239 INFO L273 TraceCheckUtils]: 84: Hoare triple {8899#false} havoc ~x~0;~x~0 := 0; {8899#false} is VALID [2018-11-18 22:56:48,240 INFO L273 TraceCheckUtils]: 85: Hoare triple {8899#false} assume true; {8899#false} is VALID [2018-11-18 22:56:48,240 INFO L273 TraceCheckUtils]: 86: Hoare triple {8899#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8899#false} is VALID [2018-11-18 22:56:48,240 INFO L256 TraceCheckUtils]: 87: Hoare triple {8899#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {8899#false} is VALID [2018-11-18 22:56:48,240 INFO L273 TraceCheckUtils]: 88: Hoare triple {8899#false} ~cond := #in~cond; {8899#false} is VALID [2018-11-18 22:56:48,240 INFO L273 TraceCheckUtils]: 89: Hoare triple {8899#false} assume 0 == ~cond; {8899#false} is VALID [2018-11-18 22:56:48,241 INFO L273 TraceCheckUtils]: 90: Hoare triple {8899#false} assume !false; {8899#false} is VALID [2018-11-18 22:56:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:48,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:48,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:48,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:48,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:48,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {8898#true} call ULTIMATE.init(); {8898#true} is VALID [2018-11-18 22:56:48,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {8898#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8898#true} is VALID [2018-11-18 22:56:48,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {8898#true} assume true; {8898#true} is VALID [2018-11-18 22:56:48,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8898#true} {8898#true} #57#return; {8898#true} is VALID [2018-11-18 22:56:48,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {8898#true} call #t~ret4 := main(); {8898#true} is VALID [2018-11-18 22:56:48,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {8898#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {8938#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:48,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {8938#(<= main_~i~0 0)} assume true; {8938#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:48,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {8938#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8938#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:48,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {8938#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8938#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:48,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {8938#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8901#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {8901#(<= main_~i~0 1)} assume true; {8901#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {8901#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8901#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {8901#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8901#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {8901#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8902#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {8902#(<= main_~i~0 2)} assume true; {8902#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {8902#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8902#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {8902#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8902#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {8902#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8903#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {8903#(<= main_~i~0 3)} assume true; {8903#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {8903#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8903#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {8903#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8903#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {8903#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8904#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {8904#(<= main_~i~0 4)} assume true; {8904#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {8904#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8904#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {8904#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8904#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {8904#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8905#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,502 INFO L273 TraceCheckUtils]: 26: Hoare triple {8905#(<= main_~i~0 5)} assume true; {8905#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {8905#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8905#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {8905#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8905#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,504 INFO L273 TraceCheckUtils]: 29: Hoare triple {8905#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8906#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {8906#(<= main_~i~0 6)} assume true; {8906#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,505 INFO L273 TraceCheckUtils]: 31: Hoare triple {8906#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8906#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,505 INFO L273 TraceCheckUtils]: 32: Hoare triple {8906#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8906#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,506 INFO L273 TraceCheckUtils]: 33: Hoare triple {8906#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8907#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {8907#(<= main_~i~0 7)} assume true; {8907#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,507 INFO L273 TraceCheckUtils]: 35: Hoare triple {8907#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8907#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,508 INFO L273 TraceCheckUtils]: 36: Hoare triple {8907#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8907#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {8907#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8908#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,509 INFO L273 TraceCheckUtils]: 38: Hoare triple {8908#(<= main_~i~0 8)} assume true; {8908#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,509 INFO L273 TraceCheckUtils]: 39: Hoare triple {8908#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8908#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,510 INFO L273 TraceCheckUtils]: 40: Hoare triple {8908#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8908#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,510 INFO L273 TraceCheckUtils]: 41: Hoare triple {8908#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8909#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:48,511 INFO L273 TraceCheckUtils]: 42: Hoare triple {8909#(<= main_~i~0 9)} assume true; {8909#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:48,511 INFO L273 TraceCheckUtils]: 43: Hoare triple {8909#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8909#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:48,512 INFO L273 TraceCheckUtils]: 44: Hoare triple {8909#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8909#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:48,513 INFO L273 TraceCheckUtils]: 45: Hoare triple {8909#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8910#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:48,513 INFO L273 TraceCheckUtils]: 46: Hoare triple {8910#(<= main_~i~0 10)} assume true; {8910#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:48,514 INFO L273 TraceCheckUtils]: 47: Hoare triple {8910#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8910#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:48,514 INFO L273 TraceCheckUtils]: 48: Hoare triple {8910#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8910#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:48,515 INFO L273 TraceCheckUtils]: 49: Hoare triple {8910#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8911#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:48,515 INFO L273 TraceCheckUtils]: 50: Hoare triple {8911#(<= main_~i~0 11)} assume true; {8911#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:48,516 INFO L273 TraceCheckUtils]: 51: Hoare triple {8911#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8911#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:48,516 INFO L273 TraceCheckUtils]: 52: Hoare triple {8911#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8911#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:48,517 INFO L273 TraceCheckUtils]: 53: Hoare triple {8911#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8912#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:48,517 INFO L273 TraceCheckUtils]: 54: Hoare triple {8912#(<= main_~i~0 12)} assume true; {8912#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:48,518 INFO L273 TraceCheckUtils]: 55: Hoare triple {8912#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8912#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:48,518 INFO L273 TraceCheckUtils]: 56: Hoare triple {8912#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8912#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:48,519 INFO L273 TraceCheckUtils]: 57: Hoare triple {8912#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8913#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:48,520 INFO L273 TraceCheckUtils]: 58: Hoare triple {8913#(<= main_~i~0 13)} assume true; {8913#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:48,520 INFO L273 TraceCheckUtils]: 59: Hoare triple {8913#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8913#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:48,521 INFO L273 TraceCheckUtils]: 60: Hoare triple {8913#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8913#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:48,521 INFO L273 TraceCheckUtils]: 61: Hoare triple {8913#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8914#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:48,522 INFO L273 TraceCheckUtils]: 62: Hoare triple {8914#(<= main_~i~0 14)} assume true; {8914#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:48,522 INFO L273 TraceCheckUtils]: 63: Hoare triple {8914#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8914#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:48,523 INFO L273 TraceCheckUtils]: 64: Hoare triple {8914#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8914#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:48,524 INFO L273 TraceCheckUtils]: 65: Hoare triple {8914#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8915#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:48,524 INFO L273 TraceCheckUtils]: 66: Hoare triple {8915#(<= main_~i~0 15)} assume true; {8915#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:48,525 INFO L273 TraceCheckUtils]: 67: Hoare triple {8915#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8915#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:48,525 INFO L273 TraceCheckUtils]: 68: Hoare triple {8915#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8915#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:48,526 INFO L273 TraceCheckUtils]: 69: Hoare triple {8915#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8916#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:48,526 INFO L273 TraceCheckUtils]: 70: Hoare triple {8916#(<= main_~i~0 16)} assume true; {8916#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:48,527 INFO L273 TraceCheckUtils]: 71: Hoare triple {8916#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8916#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:48,527 INFO L273 TraceCheckUtils]: 72: Hoare triple {8916#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8916#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:48,528 INFO L273 TraceCheckUtils]: 73: Hoare triple {8916#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8917#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:48,529 INFO L273 TraceCheckUtils]: 74: Hoare triple {8917#(<= main_~i~0 17)} assume true; {8917#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:48,529 INFO L273 TraceCheckUtils]: 75: Hoare triple {8917#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8917#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:48,530 INFO L273 TraceCheckUtils]: 76: Hoare triple {8917#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8917#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:48,530 INFO L273 TraceCheckUtils]: 77: Hoare triple {8917#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {8918#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:48,531 INFO L273 TraceCheckUtils]: 78: Hoare triple {8918#(<= main_~i~0 18)} assume true; {8918#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:48,531 INFO L273 TraceCheckUtils]: 79: Hoare triple {8918#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8918#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:48,532 INFO L273 TraceCheckUtils]: 80: Hoare triple {8918#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8918#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:48,533 INFO L273 TraceCheckUtils]: 81: Hoare triple {8918#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {8919#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:48,533 INFO L273 TraceCheckUtils]: 82: Hoare triple {8919#(<= main_~i~0 19)} assume true; {8919#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:48,534 INFO L273 TraceCheckUtils]: 83: Hoare triple {8919#(<= main_~i~0 19)} assume !(~i~0 < 100000); {8899#false} is VALID [2018-11-18 22:56:48,534 INFO L273 TraceCheckUtils]: 84: Hoare triple {8899#false} havoc ~x~0;~x~0 := 0; {8899#false} is VALID [2018-11-18 22:56:48,534 INFO L273 TraceCheckUtils]: 85: Hoare triple {8899#false} assume true; {8899#false} is VALID [2018-11-18 22:56:48,535 INFO L273 TraceCheckUtils]: 86: Hoare triple {8899#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8899#false} is VALID [2018-11-18 22:56:48,535 INFO L256 TraceCheckUtils]: 87: Hoare triple {8899#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {8899#false} is VALID [2018-11-18 22:56:48,535 INFO L273 TraceCheckUtils]: 88: Hoare triple {8899#false} ~cond := #in~cond; {8899#false} is VALID [2018-11-18 22:56:48,535 INFO L273 TraceCheckUtils]: 89: Hoare triple {8899#false} assume 0 == ~cond; {8899#false} is VALID [2018-11-18 22:56:48,535 INFO L273 TraceCheckUtils]: 90: Hoare triple {8899#false} assume !false; {8899#false} is VALID [2018-11-18 22:56:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:48,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:48,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-18 22:56:48,563 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-11-18 22:56:48,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:48,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:56:48,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:48,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:56:48,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:56:48,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:56:48,660 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand 23 states. [2018-11-18 22:56:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:49,430 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2018-11-18 22:56:49,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 22:56:49,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-11-18 22:56:49,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:56:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 137 transitions. [2018-11-18 22:56:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:56:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 137 transitions. [2018-11-18 22:56:49,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 137 transitions. [2018-11-18 22:56:49,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:49,555 INFO L225 Difference]: With dead ends: 114 [2018-11-18 22:56:49,555 INFO L226 Difference]: Without dead ends: 102 [2018-11-18 22:56:49,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:56:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-18 22:56:49,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-18 22:56:49,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:49,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 100 states. [2018-11-18 22:56:49,576 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 100 states. [2018-11-18 22:56:49,576 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 100 states. [2018-11-18 22:56:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:49,578 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2018-11-18 22:56:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-11-18 22:56:49,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:49,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:49,579 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 102 states. [2018-11-18 22:56:49,579 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 102 states. [2018-11-18 22:56:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:49,580 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2018-11-18 22:56:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-11-18 22:56:49,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:49,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:49,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:49,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-18 22:56:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2018-11-18 22:56:49,582 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 91 [2018-11-18 22:56:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:49,583 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2018-11-18 22:56:49,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:56:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2018-11-18 22:56:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-18 22:56:49,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:49,584 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:49,584 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:49,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1482210246, now seen corresponding path program 20 times [2018-11-18 22:56:49,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:49,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:49,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:50,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {9670#true} call ULTIMATE.init(); {9670#true} is VALID [2018-11-18 22:56:50,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {9670#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9670#true} is VALID [2018-11-18 22:56:50,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {9670#true} assume true; {9670#true} is VALID [2018-11-18 22:56:50,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9670#true} {9670#true} #57#return; {9670#true} is VALID [2018-11-18 22:56:50,004 INFO L256 TraceCheckUtils]: 4: Hoare triple {9670#true} call #t~ret4 := main(); {9670#true} is VALID [2018-11-18 22:56:50,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {9670#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {9672#(= main_~i~0 0)} is VALID [2018-11-18 22:56:50,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {9672#(= main_~i~0 0)} assume true; {9672#(= main_~i~0 0)} is VALID [2018-11-18 22:56:50,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {9672#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9672#(= main_~i~0 0)} is VALID [2018-11-18 22:56:50,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {9672#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9672#(= main_~i~0 0)} is VALID [2018-11-18 22:56:50,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {9672#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9673#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {9673#(<= main_~i~0 1)} assume true; {9673#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {9673#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9673#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {9673#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9673#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {9673#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9674#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {9674#(<= main_~i~0 2)} assume true; {9674#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,008 INFO L273 TraceCheckUtils]: 15: Hoare triple {9674#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9674#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {9674#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9674#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,009 INFO L273 TraceCheckUtils]: 17: Hoare triple {9674#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9675#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {9675#(<= main_~i~0 3)} assume true; {9675#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {9675#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9675#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {9675#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9675#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {9675#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9676#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {9676#(<= main_~i~0 4)} assume true; {9676#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {9676#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9676#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {9676#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9676#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {9676#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9677#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {9677#(<= main_~i~0 5)} assume true; {9677#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {9677#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9677#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {9677#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9677#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {9677#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9678#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,016 INFO L273 TraceCheckUtils]: 30: Hoare triple {9678#(<= main_~i~0 6)} assume true; {9678#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,017 INFO L273 TraceCheckUtils]: 31: Hoare triple {9678#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9678#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {9678#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9678#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {9678#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9679#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {9679#(<= main_~i~0 7)} assume true; {9679#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,019 INFO L273 TraceCheckUtils]: 35: Hoare triple {9679#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9679#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,019 INFO L273 TraceCheckUtils]: 36: Hoare triple {9679#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9679#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,020 INFO L273 TraceCheckUtils]: 37: Hoare triple {9679#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9680#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {9680#(<= main_~i~0 8)} assume true; {9680#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,021 INFO L273 TraceCheckUtils]: 39: Hoare triple {9680#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9680#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,022 INFO L273 TraceCheckUtils]: 40: Hoare triple {9680#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9680#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,022 INFO L273 TraceCheckUtils]: 41: Hoare triple {9680#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9681#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,023 INFO L273 TraceCheckUtils]: 42: Hoare triple {9681#(<= main_~i~0 9)} assume true; {9681#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,023 INFO L273 TraceCheckUtils]: 43: Hoare triple {9681#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9681#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,024 INFO L273 TraceCheckUtils]: 44: Hoare triple {9681#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9681#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,024 INFO L273 TraceCheckUtils]: 45: Hoare triple {9681#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9682#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:50,025 INFO L273 TraceCheckUtils]: 46: Hoare triple {9682#(<= main_~i~0 10)} assume true; {9682#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:50,025 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9682#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:50,026 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9682#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:50,027 INFO L273 TraceCheckUtils]: 49: Hoare triple {9682#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9683#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:50,027 INFO L273 TraceCheckUtils]: 50: Hoare triple {9683#(<= main_~i~0 11)} assume true; {9683#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:50,028 INFO L273 TraceCheckUtils]: 51: Hoare triple {9683#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9683#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:50,028 INFO L273 TraceCheckUtils]: 52: Hoare triple {9683#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9683#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:50,029 INFO L273 TraceCheckUtils]: 53: Hoare triple {9683#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9684#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:50,029 INFO L273 TraceCheckUtils]: 54: Hoare triple {9684#(<= main_~i~0 12)} assume true; {9684#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:50,030 INFO L273 TraceCheckUtils]: 55: Hoare triple {9684#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9684#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:50,030 INFO L273 TraceCheckUtils]: 56: Hoare triple {9684#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9684#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:50,031 INFO L273 TraceCheckUtils]: 57: Hoare triple {9684#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9685#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:50,031 INFO L273 TraceCheckUtils]: 58: Hoare triple {9685#(<= main_~i~0 13)} assume true; {9685#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:50,032 INFO L273 TraceCheckUtils]: 59: Hoare triple {9685#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9685#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:50,032 INFO L273 TraceCheckUtils]: 60: Hoare triple {9685#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9685#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:50,033 INFO L273 TraceCheckUtils]: 61: Hoare triple {9685#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9686#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:50,033 INFO L273 TraceCheckUtils]: 62: Hoare triple {9686#(<= main_~i~0 14)} assume true; {9686#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:50,034 INFO L273 TraceCheckUtils]: 63: Hoare triple {9686#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9686#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:50,034 INFO L273 TraceCheckUtils]: 64: Hoare triple {9686#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9686#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:50,035 INFO L273 TraceCheckUtils]: 65: Hoare triple {9686#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9687#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:50,036 INFO L273 TraceCheckUtils]: 66: Hoare triple {9687#(<= main_~i~0 15)} assume true; {9687#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:50,036 INFO L273 TraceCheckUtils]: 67: Hoare triple {9687#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9687#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:50,037 INFO L273 TraceCheckUtils]: 68: Hoare triple {9687#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9687#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:50,037 INFO L273 TraceCheckUtils]: 69: Hoare triple {9687#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9688#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:50,038 INFO L273 TraceCheckUtils]: 70: Hoare triple {9688#(<= main_~i~0 16)} assume true; {9688#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:50,038 INFO L273 TraceCheckUtils]: 71: Hoare triple {9688#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9688#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:50,039 INFO L273 TraceCheckUtils]: 72: Hoare triple {9688#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9688#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:50,039 INFO L273 TraceCheckUtils]: 73: Hoare triple {9688#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9689#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:50,040 INFO L273 TraceCheckUtils]: 74: Hoare triple {9689#(<= main_~i~0 17)} assume true; {9689#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:50,040 INFO L273 TraceCheckUtils]: 75: Hoare triple {9689#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9689#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:50,041 INFO L273 TraceCheckUtils]: 76: Hoare triple {9689#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9689#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:50,041 INFO L273 TraceCheckUtils]: 77: Hoare triple {9689#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9690#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:50,042 INFO L273 TraceCheckUtils]: 78: Hoare triple {9690#(<= main_~i~0 18)} assume true; {9690#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:50,042 INFO L273 TraceCheckUtils]: 79: Hoare triple {9690#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9690#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:50,043 INFO L273 TraceCheckUtils]: 80: Hoare triple {9690#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9690#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:50,044 INFO L273 TraceCheckUtils]: 81: Hoare triple {9690#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9691#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:50,044 INFO L273 TraceCheckUtils]: 82: Hoare triple {9691#(<= main_~i~0 19)} assume true; {9691#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:50,045 INFO L273 TraceCheckUtils]: 83: Hoare triple {9691#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9691#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:50,045 INFO L273 TraceCheckUtils]: 84: Hoare triple {9691#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9691#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:50,046 INFO L273 TraceCheckUtils]: 85: Hoare triple {9691#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9692#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:50,046 INFO L273 TraceCheckUtils]: 86: Hoare triple {9692#(<= main_~i~0 20)} assume true; {9692#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:50,047 INFO L273 TraceCheckUtils]: 87: Hoare triple {9692#(<= main_~i~0 20)} assume !(~i~0 < 100000); {9671#false} is VALID [2018-11-18 22:56:50,047 INFO L273 TraceCheckUtils]: 88: Hoare triple {9671#false} havoc ~x~0;~x~0 := 0; {9671#false} is VALID [2018-11-18 22:56:50,047 INFO L273 TraceCheckUtils]: 89: Hoare triple {9671#false} assume true; {9671#false} is VALID [2018-11-18 22:56:50,048 INFO L273 TraceCheckUtils]: 90: Hoare triple {9671#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9671#false} is VALID [2018-11-18 22:56:50,048 INFO L256 TraceCheckUtils]: 91: Hoare triple {9671#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {9671#false} is VALID [2018-11-18 22:56:50,048 INFO L273 TraceCheckUtils]: 92: Hoare triple {9671#false} ~cond := #in~cond; {9671#false} is VALID [2018-11-18 22:56:50,048 INFO L273 TraceCheckUtils]: 93: Hoare triple {9671#false} assume 0 == ~cond; {9671#false} is VALID [2018-11-18 22:56:50,048 INFO L273 TraceCheckUtils]: 94: Hoare triple {9671#false} assume !false; {9671#false} is VALID [2018-11-18 22:56:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:50,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:50,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:50,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:56:50,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:56:50,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:50,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:50,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {9670#true} call ULTIMATE.init(); {9670#true} is VALID [2018-11-18 22:56:50,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {9670#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9670#true} is VALID [2018-11-18 22:56:50,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {9670#true} assume true; {9670#true} is VALID [2018-11-18 22:56:50,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9670#true} {9670#true} #57#return; {9670#true} is VALID [2018-11-18 22:56:50,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {9670#true} call #t~ret4 := main(); {9670#true} is VALID [2018-11-18 22:56:50,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {9670#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {9711#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:50,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {9711#(<= main_~i~0 0)} assume true; {9711#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:50,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {9711#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9711#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:50,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {9711#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9711#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:50,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {9711#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9673#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {9673#(<= main_~i~0 1)} assume true; {9673#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {9673#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9673#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {9673#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9673#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {9673#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9674#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {9674#(<= main_~i~0 2)} assume true; {9674#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {9674#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9674#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {9674#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9674#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {9674#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9675#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {9675#(<= main_~i~0 3)} assume true; {9675#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {9675#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9675#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {9675#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9675#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,381 INFO L273 TraceCheckUtils]: 21: Hoare triple {9675#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9676#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,383 INFO L273 TraceCheckUtils]: 22: Hoare triple {9676#(<= main_~i~0 4)} assume true; {9676#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,383 INFO L273 TraceCheckUtils]: 23: Hoare triple {9676#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9676#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,385 INFO L273 TraceCheckUtils]: 24: Hoare triple {9676#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9676#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,385 INFO L273 TraceCheckUtils]: 25: Hoare triple {9676#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9677#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,387 INFO L273 TraceCheckUtils]: 26: Hoare triple {9677#(<= main_~i~0 5)} assume true; {9677#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,387 INFO L273 TraceCheckUtils]: 27: Hoare triple {9677#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9677#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,389 INFO L273 TraceCheckUtils]: 28: Hoare triple {9677#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9677#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,389 INFO L273 TraceCheckUtils]: 29: Hoare triple {9677#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9678#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,391 INFO L273 TraceCheckUtils]: 30: Hoare triple {9678#(<= main_~i~0 6)} assume true; {9678#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,391 INFO L273 TraceCheckUtils]: 31: Hoare triple {9678#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9678#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {9678#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9678#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {9678#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9679#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {9679#(<= main_~i~0 7)} assume true; {9679#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,397 INFO L273 TraceCheckUtils]: 35: Hoare triple {9679#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9679#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,400 INFO L273 TraceCheckUtils]: 36: Hoare triple {9679#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9679#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,400 INFO L273 TraceCheckUtils]: 37: Hoare triple {9679#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9680#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {9680#(<= main_~i~0 8)} assume true; {9680#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,403 INFO L273 TraceCheckUtils]: 39: Hoare triple {9680#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9680#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,406 INFO L273 TraceCheckUtils]: 40: Hoare triple {9680#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9680#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,406 INFO L273 TraceCheckUtils]: 41: Hoare triple {9680#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9681#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {9681#(<= main_~i~0 9)} assume true; {9681#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {9681#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9681#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {9681#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9681#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {9681#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9682#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:50,414 INFO L273 TraceCheckUtils]: 46: Hoare triple {9682#(<= main_~i~0 10)} assume true; {9682#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:50,414 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9682#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:50,417 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9682#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:50,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {9682#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9683#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:50,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {9683#(<= main_~i~0 11)} assume true; {9683#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:50,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {9683#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9683#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:50,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {9683#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9683#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:50,422 INFO L273 TraceCheckUtils]: 53: Hoare triple {9683#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9684#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:50,425 INFO L273 TraceCheckUtils]: 54: Hoare triple {9684#(<= main_~i~0 12)} assume true; {9684#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:50,425 INFO L273 TraceCheckUtils]: 55: Hoare triple {9684#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9684#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:50,428 INFO L273 TraceCheckUtils]: 56: Hoare triple {9684#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9684#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:50,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {9684#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9685#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:50,431 INFO L273 TraceCheckUtils]: 58: Hoare triple {9685#(<= main_~i~0 13)} assume true; {9685#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:50,431 INFO L273 TraceCheckUtils]: 59: Hoare triple {9685#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9685#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:50,433 INFO L273 TraceCheckUtils]: 60: Hoare triple {9685#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9685#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:50,433 INFO L273 TraceCheckUtils]: 61: Hoare triple {9685#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9686#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:50,435 INFO L273 TraceCheckUtils]: 62: Hoare triple {9686#(<= main_~i~0 14)} assume true; {9686#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:50,435 INFO L273 TraceCheckUtils]: 63: Hoare triple {9686#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9686#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:50,438 INFO L273 TraceCheckUtils]: 64: Hoare triple {9686#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9686#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:50,438 INFO L273 TraceCheckUtils]: 65: Hoare triple {9686#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9687#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:50,441 INFO L273 TraceCheckUtils]: 66: Hoare triple {9687#(<= main_~i~0 15)} assume true; {9687#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:50,441 INFO L273 TraceCheckUtils]: 67: Hoare triple {9687#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9687#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:50,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {9687#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9687#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:50,444 INFO L273 TraceCheckUtils]: 69: Hoare triple {9687#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9688#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:50,446 INFO L273 TraceCheckUtils]: 70: Hoare triple {9688#(<= main_~i~0 16)} assume true; {9688#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:50,446 INFO L273 TraceCheckUtils]: 71: Hoare triple {9688#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9688#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:50,449 INFO L273 TraceCheckUtils]: 72: Hoare triple {9688#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9688#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:50,449 INFO L273 TraceCheckUtils]: 73: Hoare triple {9688#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9689#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:50,452 INFO L273 TraceCheckUtils]: 74: Hoare triple {9689#(<= main_~i~0 17)} assume true; {9689#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:50,452 INFO L273 TraceCheckUtils]: 75: Hoare triple {9689#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9689#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:50,455 INFO L273 TraceCheckUtils]: 76: Hoare triple {9689#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9689#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:50,455 INFO L273 TraceCheckUtils]: 77: Hoare triple {9689#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9690#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:50,457 INFO L273 TraceCheckUtils]: 78: Hoare triple {9690#(<= main_~i~0 18)} assume true; {9690#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:50,457 INFO L273 TraceCheckUtils]: 79: Hoare triple {9690#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9690#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:50,460 INFO L273 TraceCheckUtils]: 80: Hoare triple {9690#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9690#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:50,460 INFO L273 TraceCheckUtils]: 81: Hoare triple {9690#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9691#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:50,461 INFO L273 TraceCheckUtils]: 82: Hoare triple {9691#(<= main_~i~0 19)} assume true; {9691#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:50,462 INFO L273 TraceCheckUtils]: 83: Hoare triple {9691#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9691#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:50,465 INFO L273 TraceCheckUtils]: 84: Hoare triple {9691#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9691#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:50,465 INFO L273 TraceCheckUtils]: 85: Hoare triple {9691#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9692#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:50,467 INFO L273 TraceCheckUtils]: 86: Hoare triple {9692#(<= main_~i~0 20)} assume true; {9692#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:50,467 INFO L273 TraceCheckUtils]: 87: Hoare triple {9692#(<= main_~i~0 20)} assume !(~i~0 < 100000); {9671#false} is VALID [2018-11-18 22:56:50,468 INFO L273 TraceCheckUtils]: 88: Hoare triple {9671#false} havoc ~x~0;~x~0 := 0; {9671#false} is VALID [2018-11-18 22:56:50,468 INFO L273 TraceCheckUtils]: 89: Hoare triple {9671#false} assume true; {9671#false} is VALID [2018-11-18 22:56:50,468 INFO L273 TraceCheckUtils]: 90: Hoare triple {9671#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9671#false} is VALID [2018-11-18 22:56:50,468 INFO L256 TraceCheckUtils]: 91: Hoare triple {9671#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {9671#false} is VALID [2018-11-18 22:56:50,468 INFO L273 TraceCheckUtils]: 92: Hoare triple {9671#false} ~cond := #in~cond; {9671#false} is VALID [2018-11-18 22:56:50,468 INFO L273 TraceCheckUtils]: 93: Hoare triple {9671#false} assume 0 == ~cond; {9671#false} is VALID [2018-11-18 22:56:50,468 INFO L273 TraceCheckUtils]: 94: Hoare triple {9671#false} assume !false; {9671#false} is VALID [2018-11-18 22:56:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:50,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:50,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-18 22:56:50,496 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-11-18 22:56:50,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:50,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 22:56:50,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:50,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 22:56:50,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 22:56:50,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:56:50,626 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand 24 states. [2018-11-18 22:56:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:51,387 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2018-11-18 22:56:51,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 22:56:51,388 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-11-18 22:56:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:56:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 142 transitions. [2018-11-18 22:56:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:56:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 142 transitions. [2018-11-18 22:56:51,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 142 transitions. [2018-11-18 22:56:51,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:51,513 INFO L225 Difference]: With dead ends: 118 [2018-11-18 22:56:51,513 INFO L226 Difference]: Without dead ends: 106 [2018-11-18 22:56:51,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:56:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-18 22:56:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-11-18 22:56:51,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:51,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 104 states. [2018-11-18 22:56:51,540 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 104 states. [2018-11-18 22:56:51,540 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 104 states. [2018-11-18 22:56:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:51,542 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2018-11-18 22:56:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-18 22:56:51,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:51,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:51,543 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 106 states. [2018-11-18 22:56:51,543 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 106 states. [2018-11-18 22:56:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:51,544 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2018-11-18 22:56:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-18 22:56:51,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:51,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:51,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:51,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-18 22:56:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2018-11-18 22:56:51,546 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 95 [2018-11-18 22:56:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:51,547 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-11-18 22:56:51,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 22:56:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2018-11-18 22:56:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 22:56:51,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:51,547 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:51,548 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:51,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash -709282928, now seen corresponding path program 21 times [2018-11-18 22:56:51,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:51,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:51,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:51,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:51,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:52,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {10473#true} call ULTIMATE.init(); {10473#true} is VALID [2018-11-18 22:56:52,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {10473#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10473#true} is VALID [2018-11-18 22:56:52,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {10473#true} assume true; {10473#true} is VALID [2018-11-18 22:56:52,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10473#true} {10473#true} #57#return; {10473#true} is VALID [2018-11-18 22:56:52,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {10473#true} call #t~ret4 := main(); {10473#true} is VALID [2018-11-18 22:56:52,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {10473#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {10475#(= main_~i~0 0)} is VALID [2018-11-18 22:56:52,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {10475#(= main_~i~0 0)} assume true; {10475#(= main_~i~0 0)} is VALID [2018-11-18 22:56:52,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {10475#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10475#(= main_~i~0 0)} is VALID [2018-11-18 22:56:52,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {10475#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10475#(= main_~i~0 0)} is VALID [2018-11-18 22:56:52,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {10475#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {10476#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {10476#(<= main_~i~0 1)} assume true; {10476#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {10476#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10476#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {10476#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10476#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {10476#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {10477#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {10477#(<= main_~i~0 2)} assume true; {10477#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {10477#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10477#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {10477#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10477#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {10477#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {10478#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {10478#(<= main_~i~0 3)} assume true; {10478#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {10478#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10478#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {10478#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10478#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {10478#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {10479#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {10479#(<= main_~i~0 4)} assume true; {10479#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {10479#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10479#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {10479#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10479#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {10479#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {10480#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {10480#(<= main_~i~0 5)} assume true; {10480#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {10480#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10480#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {10480#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10480#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {10480#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {10481#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {10481#(<= main_~i~0 6)} assume true; {10481#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,085 INFO L273 TraceCheckUtils]: 31: Hoare triple {10481#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10481#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,085 INFO L273 TraceCheckUtils]: 32: Hoare triple {10481#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10481#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,086 INFO L273 TraceCheckUtils]: 33: Hoare triple {10481#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {10482#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {10482#(<= main_~i~0 7)} assume true; {10482#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,087 INFO L273 TraceCheckUtils]: 35: Hoare triple {10482#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10482#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,087 INFO L273 TraceCheckUtils]: 36: Hoare triple {10482#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10482#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,088 INFO L273 TraceCheckUtils]: 37: Hoare triple {10482#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {10483#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {10483#(<= main_~i~0 8)} assume true; {10483#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {10483#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10483#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,090 INFO L273 TraceCheckUtils]: 40: Hoare triple {10483#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10483#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,090 INFO L273 TraceCheckUtils]: 41: Hoare triple {10483#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {10484#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {10484#(<= main_~i~0 9)} assume true; {10484#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,092 INFO L273 TraceCheckUtils]: 43: Hoare triple {10484#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10484#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,092 INFO L273 TraceCheckUtils]: 44: Hoare triple {10484#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10484#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {10484#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {10485#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,093 INFO L273 TraceCheckUtils]: 46: Hoare triple {10485#(<= main_~i~0 10)} assume true; {10485#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,094 INFO L273 TraceCheckUtils]: 47: Hoare triple {10485#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10485#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,094 INFO L273 TraceCheckUtils]: 48: Hoare triple {10485#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10485#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {10485#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {10486#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,096 INFO L273 TraceCheckUtils]: 50: Hoare triple {10486#(<= main_~i~0 11)} assume true; {10486#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,096 INFO L273 TraceCheckUtils]: 51: Hoare triple {10486#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10486#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,097 INFO L273 TraceCheckUtils]: 52: Hoare triple {10486#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10486#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,097 INFO L273 TraceCheckUtils]: 53: Hoare triple {10486#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {10487#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:52,098 INFO L273 TraceCheckUtils]: 54: Hoare triple {10487#(<= main_~i~0 12)} assume true; {10487#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:52,098 INFO L273 TraceCheckUtils]: 55: Hoare triple {10487#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10487#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:52,099 INFO L273 TraceCheckUtils]: 56: Hoare triple {10487#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10487#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:52,100 INFO L273 TraceCheckUtils]: 57: Hoare triple {10487#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {10488#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:52,100 INFO L273 TraceCheckUtils]: 58: Hoare triple {10488#(<= main_~i~0 13)} assume true; {10488#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:52,101 INFO L273 TraceCheckUtils]: 59: Hoare triple {10488#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10488#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:52,101 INFO L273 TraceCheckUtils]: 60: Hoare triple {10488#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10488#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:52,102 INFO L273 TraceCheckUtils]: 61: Hoare triple {10488#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {10489#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:52,102 INFO L273 TraceCheckUtils]: 62: Hoare triple {10489#(<= main_~i~0 14)} assume true; {10489#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:52,103 INFO L273 TraceCheckUtils]: 63: Hoare triple {10489#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10489#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:52,103 INFO L273 TraceCheckUtils]: 64: Hoare triple {10489#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10489#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:52,104 INFO L273 TraceCheckUtils]: 65: Hoare triple {10489#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {10490#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:52,105 INFO L273 TraceCheckUtils]: 66: Hoare triple {10490#(<= main_~i~0 15)} assume true; {10490#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:52,105 INFO L273 TraceCheckUtils]: 67: Hoare triple {10490#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10490#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:52,106 INFO L273 TraceCheckUtils]: 68: Hoare triple {10490#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10490#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:52,107 INFO L273 TraceCheckUtils]: 69: Hoare triple {10490#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {10491#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:52,107 INFO L273 TraceCheckUtils]: 70: Hoare triple {10491#(<= main_~i~0 16)} assume true; {10491#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:52,108 INFO L273 TraceCheckUtils]: 71: Hoare triple {10491#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10491#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:52,108 INFO L273 TraceCheckUtils]: 72: Hoare triple {10491#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10491#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:52,109 INFO L273 TraceCheckUtils]: 73: Hoare triple {10491#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {10492#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:52,109 INFO L273 TraceCheckUtils]: 74: Hoare triple {10492#(<= main_~i~0 17)} assume true; {10492#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:52,110 INFO L273 TraceCheckUtils]: 75: Hoare triple {10492#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10492#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:52,110 INFO L273 TraceCheckUtils]: 76: Hoare triple {10492#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10492#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:52,111 INFO L273 TraceCheckUtils]: 77: Hoare triple {10492#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {10493#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:52,112 INFO L273 TraceCheckUtils]: 78: Hoare triple {10493#(<= main_~i~0 18)} assume true; {10493#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:52,112 INFO L273 TraceCheckUtils]: 79: Hoare triple {10493#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10493#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:52,113 INFO L273 TraceCheckUtils]: 80: Hoare triple {10493#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10493#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:52,113 INFO L273 TraceCheckUtils]: 81: Hoare triple {10493#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {10494#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:52,114 INFO L273 TraceCheckUtils]: 82: Hoare triple {10494#(<= main_~i~0 19)} assume true; {10494#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:52,114 INFO L273 TraceCheckUtils]: 83: Hoare triple {10494#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10494#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:52,115 INFO L273 TraceCheckUtils]: 84: Hoare triple {10494#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10494#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:52,116 INFO L273 TraceCheckUtils]: 85: Hoare triple {10494#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {10495#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:52,116 INFO L273 TraceCheckUtils]: 86: Hoare triple {10495#(<= main_~i~0 20)} assume true; {10495#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:52,117 INFO L273 TraceCheckUtils]: 87: Hoare triple {10495#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10495#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:52,117 INFO L273 TraceCheckUtils]: 88: Hoare triple {10495#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10495#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:52,118 INFO L273 TraceCheckUtils]: 89: Hoare triple {10495#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {10496#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:52,119 INFO L273 TraceCheckUtils]: 90: Hoare triple {10496#(<= main_~i~0 21)} assume true; {10496#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:52,119 INFO L273 TraceCheckUtils]: 91: Hoare triple {10496#(<= main_~i~0 21)} assume !(~i~0 < 100000); {10474#false} is VALID [2018-11-18 22:56:52,119 INFO L273 TraceCheckUtils]: 92: Hoare triple {10474#false} havoc ~x~0;~x~0 := 0; {10474#false} is VALID [2018-11-18 22:56:52,120 INFO L273 TraceCheckUtils]: 93: Hoare triple {10474#false} assume true; {10474#false} is VALID [2018-11-18 22:56:52,120 INFO L273 TraceCheckUtils]: 94: Hoare triple {10474#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10474#false} is VALID [2018-11-18 22:56:52,120 INFO L256 TraceCheckUtils]: 95: Hoare triple {10474#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {10474#false} is VALID [2018-11-18 22:56:52,120 INFO L273 TraceCheckUtils]: 96: Hoare triple {10474#false} ~cond := #in~cond; {10474#false} is VALID [2018-11-18 22:56:52,120 INFO L273 TraceCheckUtils]: 97: Hoare triple {10474#false} assume 0 == ~cond; {10474#false} is VALID [2018-11-18 22:56:52,121 INFO L273 TraceCheckUtils]: 98: Hoare triple {10474#false} assume !false; {10474#false} is VALID [2018-11-18 22:56:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:52,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:52,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:52,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:56:52,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-18 22:56:52,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:52,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:52,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {10473#true} call ULTIMATE.init(); {10473#true} is VALID [2018-11-18 22:56:52,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {10473#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10473#true} is VALID [2018-11-18 22:56:52,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {10473#true} assume true; {10473#true} is VALID [2018-11-18 22:56:52,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10473#true} {10473#true} #57#return; {10473#true} is VALID [2018-11-18 22:56:52,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {10473#true} call #t~ret4 := main(); {10473#true} is VALID [2018-11-18 22:56:52,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {10473#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {10515#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:52,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {10515#(<= main_~i~0 0)} assume true; {10515#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:52,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {10515#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10515#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:52,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {10515#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10515#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:52,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {10515#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {10476#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {10476#(<= main_~i~0 1)} assume true; {10476#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {10476#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10476#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {10476#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10476#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {10476#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {10477#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {10477#(<= main_~i~0 2)} assume true; {10477#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {10477#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10477#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {10477#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10477#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {10477#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {10478#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {10478#(<= main_~i~0 3)} assume true; {10478#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {10478#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10478#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {10478#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10478#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {10478#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {10479#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {10479#(<= main_~i~0 4)} assume true; {10479#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {10479#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10479#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,478 INFO L273 TraceCheckUtils]: 24: Hoare triple {10479#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10479#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {10479#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {10480#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {10480#(<= main_~i~0 5)} assume true; {10480#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,480 INFO L273 TraceCheckUtils]: 27: Hoare triple {10480#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10480#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {10480#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10480#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {10480#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {10481#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {10481#(<= main_~i~0 6)} assume true; {10481#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,482 INFO L273 TraceCheckUtils]: 31: Hoare triple {10481#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10481#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {10481#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10481#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,483 INFO L273 TraceCheckUtils]: 33: Hoare triple {10481#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {10482#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,484 INFO L273 TraceCheckUtils]: 34: Hoare triple {10482#(<= main_~i~0 7)} assume true; {10482#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,484 INFO L273 TraceCheckUtils]: 35: Hoare triple {10482#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10482#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,485 INFO L273 TraceCheckUtils]: 36: Hoare triple {10482#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10482#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,485 INFO L273 TraceCheckUtils]: 37: Hoare triple {10482#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {10483#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,486 INFO L273 TraceCheckUtils]: 38: Hoare triple {10483#(<= main_~i~0 8)} assume true; {10483#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,487 INFO L273 TraceCheckUtils]: 39: Hoare triple {10483#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10483#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,487 INFO L273 TraceCheckUtils]: 40: Hoare triple {10483#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10483#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,488 INFO L273 TraceCheckUtils]: 41: Hoare triple {10483#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {10484#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,488 INFO L273 TraceCheckUtils]: 42: Hoare triple {10484#(<= main_~i~0 9)} assume true; {10484#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,489 INFO L273 TraceCheckUtils]: 43: Hoare triple {10484#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10484#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,489 INFO L273 TraceCheckUtils]: 44: Hoare triple {10484#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10484#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,490 INFO L273 TraceCheckUtils]: 45: Hoare triple {10484#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {10485#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,491 INFO L273 TraceCheckUtils]: 46: Hoare triple {10485#(<= main_~i~0 10)} assume true; {10485#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,491 INFO L273 TraceCheckUtils]: 47: Hoare triple {10485#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10485#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,492 INFO L273 TraceCheckUtils]: 48: Hoare triple {10485#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10485#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,492 INFO L273 TraceCheckUtils]: 49: Hoare triple {10485#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {10486#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,493 INFO L273 TraceCheckUtils]: 50: Hoare triple {10486#(<= main_~i~0 11)} assume true; {10486#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,493 INFO L273 TraceCheckUtils]: 51: Hoare triple {10486#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10486#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,494 INFO L273 TraceCheckUtils]: 52: Hoare triple {10486#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10486#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,495 INFO L273 TraceCheckUtils]: 53: Hoare triple {10486#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {10487#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:52,495 INFO L273 TraceCheckUtils]: 54: Hoare triple {10487#(<= main_~i~0 12)} assume true; {10487#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:52,496 INFO L273 TraceCheckUtils]: 55: Hoare triple {10487#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10487#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:52,496 INFO L273 TraceCheckUtils]: 56: Hoare triple {10487#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10487#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:52,497 INFO L273 TraceCheckUtils]: 57: Hoare triple {10487#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {10488#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:52,498 INFO L273 TraceCheckUtils]: 58: Hoare triple {10488#(<= main_~i~0 13)} assume true; {10488#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:52,498 INFO L273 TraceCheckUtils]: 59: Hoare triple {10488#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10488#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:52,499 INFO L273 TraceCheckUtils]: 60: Hoare triple {10488#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10488#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:52,499 INFO L273 TraceCheckUtils]: 61: Hoare triple {10488#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {10489#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:52,500 INFO L273 TraceCheckUtils]: 62: Hoare triple {10489#(<= main_~i~0 14)} assume true; {10489#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:52,500 INFO L273 TraceCheckUtils]: 63: Hoare triple {10489#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10489#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:52,501 INFO L273 TraceCheckUtils]: 64: Hoare triple {10489#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10489#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:52,502 INFO L273 TraceCheckUtils]: 65: Hoare triple {10489#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {10490#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:52,502 INFO L273 TraceCheckUtils]: 66: Hoare triple {10490#(<= main_~i~0 15)} assume true; {10490#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:52,503 INFO L273 TraceCheckUtils]: 67: Hoare triple {10490#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10490#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:52,503 INFO L273 TraceCheckUtils]: 68: Hoare triple {10490#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10490#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:52,504 INFO L273 TraceCheckUtils]: 69: Hoare triple {10490#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {10491#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:52,504 INFO L273 TraceCheckUtils]: 70: Hoare triple {10491#(<= main_~i~0 16)} assume true; {10491#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:52,505 INFO L273 TraceCheckUtils]: 71: Hoare triple {10491#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10491#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:52,505 INFO L273 TraceCheckUtils]: 72: Hoare triple {10491#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10491#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:52,506 INFO L273 TraceCheckUtils]: 73: Hoare triple {10491#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {10492#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:52,507 INFO L273 TraceCheckUtils]: 74: Hoare triple {10492#(<= main_~i~0 17)} assume true; {10492#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:52,507 INFO L273 TraceCheckUtils]: 75: Hoare triple {10492#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10492#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:52,508 INFO L273 TraceCheckUtils]: 76: Hoare triple {10492#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10492#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:52,508 INFO L273 TraceCheckUtils]: 77: Hoare triple {10492#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {10493#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:52,509 INFO L273 TraceCheckUtils]: 78: Hoare triple {10493#(<= main_~i~0 18)} assume true; {10493#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:52,509 INFO L273 TraceCheckUtils]: 79: Hoare triple {10493#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10493#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:52,510 INFO L273 TraceCheckUtils]: 80: Hoare triple {10493#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10493#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:52,511 INFO L273 TraceCheckUtils]: 81: Hoare triple {10493#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {10494#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:52,511 INFO L273 TraceCheckUtils]: 82: Hoare triple {10494#(<= main_~i~0 19)} assume true; {10494#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:52,512 INFO L273 TraceCheckUtils]: 83: Hoare triple {10494#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10494#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:52,512 INFO L273 TraceCheckUtils]: 84: Hoare triple {10494#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10494#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:52,513 INFO L273 TraceCheckUtils]: 85: Hoare triple {10494#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {10495#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:52,513 INFO L273 TraceCheckUtils]: 86: Hoare triple {10495#(<= main_~i~0 20)} assume true; {10495#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:52,514 INFO L273 TraceCheckUtils]: 87: Hoare triple {10495#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10495#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:52,514 INFO L273 TraceCheckUtils]: 88: Hoare triple {10495#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10495#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:52,515 INFO L273 TraceCheckUtils]: 89: Hoare triple {10495#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {10496#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:52,516 INFO L273 TraceCheckUtils]: 90: Hoare triple {10496#(<= main_~i~0 21)} assume true; {10496#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:52,516 INFO L273 TraceCheckUtils]: 91: Hoare triple {10496#(<= main_~i~0 21)} assume !(~i~0 < 100000); {10474#false} is VALID [2018-11-18 22:56:52,517 INFO L273 TraceCheckUtils]: 92: Hoare triple {10474#false} havoc ~x~0;~x~0 := 0; {10474#false} is VALID [2018-11-18 22:56:52,517 INFO L273 TraceCheckUtils]: 93: Hoare triple {10474#false} assume true; {10474#false} is VALID [2018-11-18 22:56:52,517 INFO L273 TraceCheckUtils]: 94: Hoare triple {10474#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10474#false} is VALID [2018-11-18 22:56:52,517 INFO L256 TraceCheckUtils]: 95: Hoare triple {10474#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {10474#false} is VALID [2018-11-18 22:56:52,517 INFO L273 TraceCheckUtils]: 96: Hoare triple {10474#false} ~cond := #in~cond; {10474#false} is VALID [2018-11-18 22:56:52,518 INFO L273 TraceCheckUtils]: 97: Hoare triple {10474#false} assume 0 == ~cond; {10474#false} is VALID [2018-11-18 22:56:52,518 INFO L273 TraceCheckUtils]: 98: Hoare triple {10474#false} assume !false; {10474#false} is VALID [2018-11-18 22:56:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:52,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:52,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-18 22:56:52,545 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-18 22:56:52,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:52,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 22:56:52,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:52,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 22:56:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 22:56:52,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:56:52,639 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 25 states. [2018-11-18 22:56:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:52,902 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2018-11-18 22:56:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 22:56:52,902 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-18 22:56:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:56:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 147 transitions. [2018-11-18 22:56:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:56:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 147 transitions. [2018-11-18 22:56:52,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 147 transitions. [2018-11-18 22:56:53,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:53,036 INFO L225 Difference]: With dead ends: 122 [2018-11-18 22:56:53,036 INFO L226 Difference]: Without dead ends: 110 [2018-11-18 22:56:53,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:56:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-18 22:56:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-11-18 22:56:53,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:53,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 108 states. [2018-11-18 22:56:53,056 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 108 states. [2018-11-18 22:56:53,056 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 108 states. [2018-11-18 22:56:53,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:53,057 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2018-11-18 22:56:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-18 22:56:53,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:53,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:53,058 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 110 states. [2018-11-18 22:56:53,058 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 110 states. [2018-11-18 22:56:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:53,059 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2018-11-18 22:56:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-18 22:56:53,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:53,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:53,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:53,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-18 22:56:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-11-18 22:56:53,061 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 99 [2018-11-18 22:56:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:53,062 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-11-18 22:56:53,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 22:56:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-11-18 22:56:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 22:56:53,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:53,063 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:53,063 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:53,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1074296858, now seen corresponding path program 22 times [2018-11-18 22:56:53,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:53,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:53,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:53,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {11307#true} call ULTIMATE.init(); {11307#true} is VALID [2018-11-18 22:56:53,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {11307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11307#true} is VALID [2018-11-18 22:56:53,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {11307#true} assume true; {11307#true} is VALID [2018-11-18 22:56:53,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11307#true} {11307#true} #57#return; {11307#true} is VALID [2018-11-18 22:56:53,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {11307#true} call #t~ret4 := main(); {11307#true} is VALID [2018-11-18 22:56:53,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {11307#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {11309#(= main_~i~0 0)} is VALID [2018-11-18 22:56:53,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {11309#(= main_~i~0 0)} assume true; {11309#(= main_~i~0 0)} is VALID [2018-11-18 22:56:53,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {11309#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11309#(= main_~i~0 0)} is VALID [2018-11-18 22:56:53,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {11309#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11309#(= main_~i~0 0)} is VALID [2018-11-18 22:56:53,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {11309#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {11310#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:53,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {11310#(<= main_~i~0 1)} assume true; {11310#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:53,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {11310#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11310#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:53,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {11310#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11310#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:53,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {11310#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11311#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:53,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {11311#(<= main_~i~0 2)} assume true; {11311#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:53,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {11311#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11311#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:53,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {11311#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11311#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:53,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {11311#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11312#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:53,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {11312#(<= main_~i~0 3)} assume true; {11312#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:53,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {11312#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11312#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:53,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {11312#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11312#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:53,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {11312#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11313#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:53,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {11313#(<= main_~i~0 4)} assume true; {11313#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:53,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {11313#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11313#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:53,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {11313#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11313#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:53,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {11313#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11314#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:53,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {11314#(<= main_~i~0 5)} assume true; {11314#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:53,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {11314#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11314#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:53,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {11314#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11314#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:53,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {11314#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11315#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:53,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {11315#(<= main_~i~0 6)} assume true; {11315#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:53,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {11315#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11315#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:53,471 INFO L273 TraceCheckUtils]: 32: Hoare triple {11315#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11315#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:53,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {11315#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11316#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:53,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {11316#(<= main_~i~0 7)} assume true; {11316#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:53,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {11316#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11316#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:53,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {11316#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11316#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:53,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {11316#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11317#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:53,475 INFO L273 TraceCheckUtils]: 38: Hoare triple {11317#(<= main_~i~0 8)} assume true; {11317#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:53,475 INFO L273 TraceCheckUtils]: 39: Hoare triple {11317#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11317#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:53,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {11317#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11317#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:53,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {11317#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11318#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:53,477 INFO L273 TraceCheckUtils]: 42: Hoare triple {11318#(<= main_~i~0 9)} assume true; {11318#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:53,477 INFO L273 TraceCheckUtils]: 43: Hoare triple {11318#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11318#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:53,478 INFO L273 TraceCheckUtils]: 44: Hoare triple {11318#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11318#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:53,479 INFO L273 TraceCheckUtils]: 45: Hoare triple {11318#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11319#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:53,479 INFO L273 TraceCheckUtils]: 46: Hoare triple {11319#(<= main_~i~0 10)} assume true; {11319#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:53,480 INFO L273 TraceCheckUtils]: 47: Hoare triple {11319#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11319#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:53,480 INFO L273 TraceCheckUtils]: 48: Hoare triple {11319#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11319#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:53,481 INFO L273 TraceCheckUtils]: 49: Hoare triple {11319#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11320#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:53,482 INFO L273 TraceCheckUtils]: 50: Hoare triple {11320#(<= main_~i~0 11)} assume true; {11320#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:53,482 INFO L273 TraceCheckUtils]: 51: Hoare triple {11320#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11320#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:53,483 INFO L273 TraceCheckUtils]: 52: Hoare triple {11320#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11320#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:53,483 INFO L273 TraceCheckUtils]: 53: Hoare triple {11320#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11321#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:53,484 INFO L273 TraceCheckUtils]: 54: Hoare triple {11321#(<= main_~i~0 12)} assume true; {11321#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:53,484 INFO L273 TraceCheckUtils]: 55: Hoare triple {11321#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11321#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:53,485 INFO L273 TraceCheckUtils]: 56: Hoare triple {11321#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11321#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:53,486 INFO L273 TraceCheckUtils]: 57: Hoare triple {11321#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11322#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:53,486 INFO L273 TraceCheckUtils]: 58: Hoare triple {11322#(<= main_~i~0 13)} assume true; {11322#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:53,487 INFO L273 TraceCheckUtils]: 59: Hoare triple {11322#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11322#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:53,487 INFO L273 TraceCheckUtils]: 60: Hoare triple {11322#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11322#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:53,488 INFO L273 TraceCheckUtils]: 61: Hoare triple {11322#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {11323#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:53,489 INFO L273 TraceCheckUtils]: 62: Hoare triple {11323#(<= main_~i~0 14)} assume true; {11323#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:53,489 INFO L273 TraceCheckUtils]: 63: Hoare triple {11323#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11323#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:53,490 INFO L273 TraceCheckUtils]: 64: Hoare triple {11323#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11323#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:53,490 INFO L273 TraceCheckUtils]: 65: Hoare triple {11323#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {11324#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:53,491 INFO L273 TraceCheckUtils]: 66: Hoare triple {11324#(<= main_~i~0 15)} assume true; {11324#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:53,491 INFO L273 TraceCheckUtils]: 67: Hoare triple {11324#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11324#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:53,492 INFO L273 TraceCheckUtils]: 68: Hoare triple {11324#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11324#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:53,493 INFO L273 TraceCheckUtils]: 69: Hoare triple {11324#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {11325#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:53,493 INFO L273 TraceCheckUtils]: 70: Hoare triple {11325#(<= main_~i~0 16)} assume true; {11325#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:53,494 INFO L273 TraceCheckUtils]: 71: Hoare triple {11325#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11325#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:53,494 INFO L273 TraceCheckUtils]: 72: Hoare triple {11325#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11325#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:53,495 INFO L273 TraceCheckUtils]: 73: Hoare triple {11325#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {11326#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:53,495 INFO L273 TraceCheckUtils]: 74: Hoare triple {11326#(<= main_~i~0 17)} assume true; {11326#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:53,496 INFO L273 TraceCheckUtils]: 75: Hoare triple {11326#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11326#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:53,496 INFO L273 TraceCheckUtils]: 76: Hoare triple {11326#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11326#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:53,497 INFO L273 TraceCheckUtils]: 77: Hoare triple {11326#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {11327#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:53,498 INFO L273 TraceCheckUtils]: 78: Hoare triple {11327#(<= main_~i~0 18)} assume true; {11327#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:53,498 INFO L273 TraceCheckUtils]: 79: Hoare triple {11327#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11327#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:53,499 INFO L273 TraceCheckUtils]: 80: Hoare triple {11327#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11327#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:53,500 INFO L273 TraceCheckUtils]: 81: Hoare triple {11327#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {11328#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:53,500 INFO L273 TraceCheckUtils]: 82: Hoare triple {11328#(<= main_~i~0 19)} assume true; {11328#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:53,501 INFO L273 TraceCheckUtils]: 83: Hoare triple {11328#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11328#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:53,501 INFO L273 TraceCheckUtils]: 84: Hoare triple {11328#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11328#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:53,502 INFO L273 TraceCheckUtils]: 85: Hoare triple {11328#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {11329#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:53,502 INFO L273 TraceCheckUtils]: 86: Hoare triple {11329#(<= main_~i~0 20)} assume true; {11329#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:53,503 INFO L273 TraceCheckUtils]: 87: Hoare triple {11329#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11329#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:53,503 INFO L273 TraceCheckUtils]: 88: Hoare triple {11329#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11329#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:53,504 INFO L273 TraceCheckUtils]: 89: Hoare triple {11329#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {11330#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:53,505 INFO L273 TraceCheckUtils]: 90: Hoare triple {11330#(<= main_~i~0 21)} assume true; {11330#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:53,505 INFO L273 TraceCheckUtils]: 91: Hoare triple {11330#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11330#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:53,506 INFO L273 TraceCheckUtils]: 92: Hoare triple {11330#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11330#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:53,506 INFO L273 TraceCheckUtils]: 93: Hoare triple {11330#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {11331#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:53,507 INFO L273 TraceCheckUtils]: 94: Hoare triple {11331#(<= main_~i~0 22)} assume true; {11331#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:53,508 INFO L273 TraceCheckUtils]: 95: Hoare triple {11331#(<= main_~i~0 22)} assume !(~i~0 < 100000); {11308#false} is VALID [2018-11-18 22:56:53,508 INFO L273 TraceCheckUtils]: 96: Hoare triple {11308#false} havoc ~x~0;~x~0 := 0; {11308#false} is VALID [2018-11-18 22:56:53,508 INFO L273 TraceCheckUtils]: 97: Hoare triple {11308#false} assume true; {11308#false} is VALID [2018-11-18 22:56:53,508 INFO L273 TraceCheckUtils]: 98: Hoare triple {11308#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11308#false} is VALID [2018-11-18 22:56:53,509 INFO L256 TraceCheckUtils]: 99: Hoare triple {11308#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {11308#false} is VALID [2018-11-18 22:56:53,509 INFO L273 TraceCheckUtils]: 100: Hoare triple {11308#false} ~cond := #in~cond; {11308#false} is VALID [2018-11-18 22:56:53,509 INFO L273 TraceCheckUtils]: 101: Hoare triple {11308#false} assume 0 == ~cond; {11308#false} is VALID [2018-11-18 22:56:53,509 INFO L273 TraceCheckUtils]: 102: Hoare triple {11308#false} assume !false; {11308#false} is VALID [2018-11-18 22:56:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:53,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:53,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:53,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:56:53,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:56:53,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:53,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:53,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {11307#true} call ULTIMATE.init(); {11307#true} is VALID [2018-11-18 22:56:53,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {11307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11307#true} is VALID [2018-11-18 22:56:53,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {11307#true} assume true; {11307#true} is VALID [2018-11-18 22:56:53,885 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11307#true} {11307#true} #57#return; {11307#true} is VALID [2018-11-18 22:56:53,885 INFO L256 TraceCheckUtils]: 4: Hoare triple {11307#true} call #t~ret4 := main(); {11307#true} is VALID [2018-11-18 22:56:53,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {11307#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {11350#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:53,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {11350#(<= main_~i~0 0)} assume true; {11350#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:53,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {11350#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11350#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:53,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {11350#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11350#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:53,888 INFO L273 TraceCheckUtils]: 9: Hoare triple {11350#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {11310#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:53,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {11310#(<= main_~i~0 1)} assume true; {11310#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:53,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {11310#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11310#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:53,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {11310#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11310#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:53,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {11310#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11311#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:53,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {11311#(<= main_~i~0 2)} assume true; {11311#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:53,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {11311#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11311#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:53,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {11311#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11311#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:53,892 INFO L273 TraceCheckUtils]: 17: Hoare triple {11311#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11312#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:53,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {11312#(<= main_~i~0 3)} assume true; {11312#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:53,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {11312#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11312#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:53,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {11312#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11312#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:53,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {11312#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11313#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:53,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {11313#(<= main_~i~0 4)} assume true; {11313#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:53,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {11313#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11313#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:53,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {11313#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11313#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:53,905 INFO L273 TraceCheckUtils]: 25: Hoare triple {11313#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11314#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:53,905 INFO L273 TraceCheckUtils]: 26: Hoare triple {11314#(<= main_~i~0 5)} assume true; {11314#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:53,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {11314#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11314#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:53,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {11314#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11314#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:53,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {11314#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11315#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:53,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {11315#(<= main_~i~0 6)} assume true; {11315#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:53,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {11315#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11315#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:53,907 INFO L273 TraceCheckUtils]: 32: Hoare triple {11315#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11315#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:53,907 INFO L273 TraceCheckUtils]: 33: Hoare triple {11315#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11316#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:53,908 INFO L273 TraceCheckUtils]: 34: Hoare triple {11316#(<= main_~i~0 7)} assume true; {11316#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:53,908 INFO L273 TraceCheckUtils]: 35: Hoare triple {11316#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11316#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:53,909 INFO L273 TraceCheckUtils]: 36: Hoare triple {11316#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11316#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:53,910 INFO L273 TraceCheckUtils]: 37: Hoare triple {11316#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11317#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:53,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {11317#(<= main_~i~0 8)} assume true; {11317#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:53,911 INFO L273 TraceCheckUtils]: 39: Hoare triple {11317#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11317#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:53,911 INFO L273 TraceCheckUtils]: 40: Hoare triple {11317#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11317#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:53,912 INFO L273 TraceCheckUtils]: 41: Hoare triple {11317#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11318#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:53,913 INFO L273 TraceCheckUtils]: 42: Hoare triple {11318#(<= main_~i~0 9)} assume true; {11318#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:53,913 INFO L273 TraceCheckUtils]: 43: Hoare triple {11318#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11318#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:53,914 INFO L273 TraceCheckUtils]: 44: Hoare triple {11318#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11318#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:53,914 INFO L273 TraceCheckUtils]: 45: Hoare triple {11318#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11319#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:53,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {11319#(<= main_~i~0 10)} assume true; {11319#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:53,915 INFO L273 TraceCheckUtils]: 47: Hoare triple {11319#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11319#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:53,916 INFO L273 TraceCheckUtils]: 48: Hoare triple {11319#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11319#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:53,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {11319#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11320#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:53,917 INFO L273 TraceCheckUtils]: 50: Hoare triple {11320#(<= main_~i~0 11)} assume true; {11320#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:53,918 INFO L273 TraceCheckUtils]: 51: Hoare triple {11320#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11320#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:53,918 INFO L273 TraceCheckUtils]: 52: Hoare triple {11320#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11320#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:53,919 INFO L273 TraceCheckUtils]: 53: Hoare triple {11320#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11321#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:53,919 INFO L273 TraceCheckUtils]: 54: Hoare triple {11321#(<= main_~i~0 12)} assume true; {11321#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:53,920 INFO L273 TraceCheckUtils]: 55: Hoare triple {11321#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11321#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:53,940 INFO L273 TraceCheckUtils]: 56: Hoare triple {11321#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11321#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:53,949 INFO L273 TraceCheckUtils]: 57: Hoare triple {11321#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11322#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:53,950 INFO L273 TraceCheckUtils]: 58: Hoare triple {11322#(<= main_~i~0 13)} assume true; {11322#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:53,950 INFO L273 TraceCheckUtils]: 59: Hoare triple {11322#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11322#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:53,951 INFO L273 TraceCheckUtils]: 60: Hoare triple {11322#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11322#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:53,951 INFO L273 TraceCheckUtils]: 61: Hoare triple {11322#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {11323#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:53,952 INFO L273 TraceCheckUtils]: 62: Hoare triple {11323#(<= main_~i~0 14)} assume true; {11323#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:53,952 INFO L273 TraceCheckUtils]: 63: Hoare triple {11323#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11323#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:53,952 INFO L273 TraceCheckUtils]: 64: Hoare triple {11323#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11323#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:53,953 INFO L273 TraceCheckUtils]: 65: Hoare triple {11323#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {11324#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:53,953 INFO L273 TraceCheckUtils]: 66: Hoare triple {11324#(<= main_~i~0 15)} assume true; {11324#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:53,953 INFO L273 TraceCheckUtils]: 67: Hoare triple {11324#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11324#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:53,954 INFO L273 TraceCheckUtils]: 68: Hoare triple {11324#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11324#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:53,954 INFO L273 TraceCheckUtils]: 69: Hoare triple {11324#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {11325#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:53,955 INFO L273 TraceCheckUtils]: 70: Hoare triple {11325#(<= main_~i~0 16)} assume true; {11325#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:53,955 INFO L273 TraceCheckUtils]: 71: Hoare triple {11325#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11325#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:53,956 INFO L273 TraceCheckUtils]: 72: Hoare triple {11325#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11325#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:53,957 INFO L273 TraceCheckUtils]: 73: Hoare triple {11325#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {11326#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:53,957 INFO L273 TraceCheckUtils]: 74: Hoare triple {11326#(<= main_~i~0 17)} assume true; {11326#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:53,958 INFO L273 TraceCheckUtils]: 75: Hoare triple {11326#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11326#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:53,958 INFO L273 TraceCheckUtils]: 76: Hoare triple {11326#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11326#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:53,959 INFO L273 TraceCheckUtils]: 77: Hoare triple {11326#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {11327#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:53,961 INFO L273 TraceCheckUtils]: 78: Hoare triple {11327#(<= main_~i~0 18)} assume true; {11327#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:53,962 INFO L273 TraceCheckUtils]: 79: Hoare triple {11327#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11327#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:53,963 INFO L273 TraceCheckUtils]: 80: Hoare triple {11327#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11327#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:53,963 INFO L273 TraceCheckUtils]: 81: Hoare triple {11327#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {11328#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:53,964 INFO L273 TraceCheckUtils]: 82: Hoare triple {11328#(<= main_~i~0 19)} assume true; {11328#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:53,964 INFO L273 TraceCheckUtils]: 83: Hoare triple {11328#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11328#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:53,965 INFO L273 TraceCheckUtils]: 84: Hoare triple {11328#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11328#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:53,965 INFO L273 TraceCheckUtils]: 85: Hoare triple {11328#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {11329#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:53,965 INFO L273 TraceCheckUtils]: 86: Hoare triple {11329#(<= main_~i~0 20)} assume true; {11329#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:53,966 INFO L273 TraceCheckUtils]: 87: Hoare triple {11329#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11329#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:53,966 INFO L273 TraceCheckUtils]: 88: Hoare triple {11329#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11329#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:53,966 INFO L273 TraceCheckUtils]: 89: Hoare triple {11329#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {11330#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:53,967 INFO L273 TraceCheckUtils]: 90: Hoare triple {11330#(<= main_~i~0 21)} assume true; {11330#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:53,967 INFO L273 TraceCheckUtils]: 91: Hoare triple {11330#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11330#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:53,967 INFO L273 TraceCheckUtils]: 92: Hoare triple {11330#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11330#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:53,968 INFO L273 TraceCheckUtils]: 93: Hoare triple {11330#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {11331#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:53,969 INFO L273 TraceCheckUtils]: 94: Hoare triple {11331#(<= main_~i~0 22)} assume true; {11331#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:53,969 INFO L273 TraceCheckUtils]: 95: Hoare triple {11331#(<= main_~i~0 22)} assume !(~i~0 < 100000); {11308#false} is VALID [2018-11-18 22:56:53,970 INFO L273 TraceCheckUtils]: 96: Hoare triple {11308#false} havoc ~x~0;~x~0 := 0; {11308#false} is VALID [2018-11-18 22:56:53,970 INFO L273 TraceCheckUtils]: 97: Hoare triple {11308#false} assume true; {11308#false} is VALID [2018-11-18 22:56:53,970 INFO L273 TraceCheckUtils]: 98: Hoare triple {11308#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11308#false} is VALID [2018-11-18 22:56:53,970 INFO L256 TraceCheckUtils]: 99: Hoare triple {11308#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {11308#false} is VALID [2018-11-18 22:56:53,970 INFO L273 TraceCheckUtils]: 100: Hoare triple {11308#false} ~cond := #in~cond; {11308#false} is VALID [2018-11-18 22:56:53,971 INFO L273 TraceCheckUtils]: 101: Hoare triple {11308#false} assume 0 == ~cond; {11308#false} is VALID [2018-11-18 22:56:53,971 INFO L273 TraceCheckUtils]: 102: Hoare triple {11308#false} assume !false; {11308#false} is VALID [2018-11-18 22:56:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:53,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:54,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-18 22:56:54,000 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-11-18 22:56:54,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:54,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-18 22:56:54,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:54,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 22:56:54,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 22:56:54,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:56:54,133 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 26 states. [2018-11-18 22:56:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:54,510 INFO L93 Difference]: Finished difference Result 126 states and 152 transitions. [2018-11-18 22:56:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:56:54,511 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-11-18 22:56:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:56:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 152 transitions. [2018-11-18 22:56:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:56:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 152 transitions. [2018-11-18 22:56:54,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 152 transitions. [2018-11-18 22:56:54,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:54,674 INFO L225 Difference]: With dead ends: 126 [2018-11-18 22:56:54,674 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 22:56:54,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:56:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 22:56:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-18 22:56:54,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:54,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2018-11-18 22:56:54,732 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2018-11-18 22:56:54,732 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2018-11-18 22:56:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:54,734 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2018-11-18 22:56:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-18 22:56:54,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:54,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:54,734 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2018-11-18 22:56:54,735 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2018-11-18 22:56:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:54,736 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2018-11-18 22:56:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-18 22:56:54,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:54,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:54,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:54,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 22:56:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2018-11-18 22:56:54,738 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 103 [2018-11-18 22:56:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:54,738 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2018-11-18 22:56:54,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 22:56:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2018-11-18 22:56:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 22:56:54,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:54,739 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:54,739 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:54,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:54,740 INFO L82 PathProgramCache]: Analyzing trace with hash -5783236, now seen corresponding path program 23 times [2018-11-18 22:56:54,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:54,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:54,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:54,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:54,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:55,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {12172#true} call ULTIMATE.init(); {12172#true} is VALID [2018-11-18 22:56:55,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {12172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12172#true} is VALID [2018-11-18 22:56:55,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {12172#true} assume true; {12172#true} is VALID [2018-11-18 22:56:55,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12172#true} {12172#true} #57#return; {12172#true} is VALID [2018-11-18 22:56:55,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {12172#true} call #t~ret4 := main(); {12172#true} is VALID [2018-11-18 22:56:55,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {12172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {12174#(= main_~i~0 0)} is VALID [2018-11-18 22:56:55,347 INFO L273 TraceCheckUtils]: 6: Hoare triple {12174#(= main_~i~0 0)} assume true; {12174#(= main_~i~0 0)} is VALID [2018-11-18 22:56:55,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {12174#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12174#(= main_~i~0 0)} is VALID [2018-11-18 22:56:55,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {12174#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12174#(= main_~i~0 0)} is VALID [2018-11-18 22:56:55,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {12174#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12175#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {12175#(<= main_~i~0 1)} assume true; {12175#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {12175#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12175#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {12175#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12175#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {12175#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12176#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {12176#(<= main_~i~0 2)} assume true; {12176#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {12176#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12176#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {12176#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12176#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {12176#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12177#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {12177#(<= main_~i~0 3)} assume true; {12177#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {12177#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12177#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {12177#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12177#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {12177#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12178#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {12178#(<= main_~i~0 4)} assume true; {12178#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {12178#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12178#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {12178#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12178#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {12178#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12179#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {12179#(<= main_~i~0 5)} assume true; {12179#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,359 INFO L273 TraceCheckUtils]: 27: Hoare triple {12179#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12179#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {12179#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12179#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {12179#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12180#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,360 INFO L273 TraceCheckUtils]: 30: Hoare triple {12180#(<= main_~i~0 6)} assume true; {12180#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {12180#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12180#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {12180#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12180#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,362 INFO L273 TraceCheckUtils]: 33: Hoare triple {12180#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12181#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,362 INFO L273 TraceCheckUtils]: 34: Hoare triple {12181#(<= main_~i~0 7)} assume true; {12181#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,363 INFO L273 TraceCheckUtils]: 35: Hoare triple {12181#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12181#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,363 INFO L273 TraceCheckUtils]: 36: Hoare triple {12181#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12181#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,364 INFO L273 TraceCheckUtils]: 37: Hoare triple {12181#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12182#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,365 INFO L273 TraceCheckUtils]: 38: Hoare triple {12182#(<= main_~i~0 8)} assume true; {12182#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,368 INFO L273 TraceCheckUtils]: 39: Hoare triple {12182#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12182#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,368 INFO L273 TraceCheckUtils]: 40: Hoare triple {12182#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12182#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,369 INFO L273 TraceCheckUtils]: 41: Hoare triple {12182#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12183#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,369 INFO L273 TraceCheckUtils]: 42: Hoare triple {12183#(<= main_~i~0 9)} assume true; {12183#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,369 INFO L273 TraceCheckUtils]: 43: Hoare triple {12183#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12183#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,370 INFO L273 TraceCheckUtils]: 44: Hoare triple {12183#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12183#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,370 INFO L273 TraceCheckUtils]: 45: Hoare triple {12183#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12184#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,370 INFO L273 TraceCheckUtils]: 46: Hoare triple {12184#(<= main_~i~0 10)} assume true; {12184#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,371 INFO L273 TraceCheckUtils]: 47: Hoare triple {12184#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12184#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,371 INFO L273 TraceCheckUtils]: 48: Hoare triple {12184#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12184#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,371 INFO L273 TraceCheckUtils]: 49: Hoare triple {12184#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12185#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,372 INFO L273 TraceCheckUtils]: 50: Hoare triple {12185#(<= main_~i~0 11)} assume true; {12185#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,372 INFO L273 TraceCheckUtils]: 51: Hoare triple {12185#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12185#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,372 INFO L273 TraceCheckUtils]: 52: Hoare triple {12185#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12185#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,373 INFO L273 TraceCheckUtils]: 53: Hoare triple {12185#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12186#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,374 INFO L273 TraceCheckUtils]: 54: Hoare triple {12186#(<= main_~i~0 12)} assume true; {12186#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,374 INFO L273 TraceCheckUtils]: 55: Hoare triple {12186#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12186#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,375 INFO L273 TraceCheckUtils]: 56: Hoare triple {12186#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12186#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,375 INFO L273 TraceCheckUtils]: 57: Hoare triple {12186#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12187#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:55,376 INFO L273 TraceCheckUtils]: 58: Hoare triple {12187#(<= main_~i~0 13)} assume true; {12187#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:55,376 INFO L273 TraceCheckUtils]: 59: Hoare triple {12187#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12187#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:55,377 INFO L273 TraceCheckUtils]: 60: Hoare triple {12187#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12187#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:55,378 INFO L273 TraceCheckUtils]: 61: Hoare triple {12187#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12188#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:55,378 INFO L273 TraceCheckUtils]: 62: Hoare triple {12188#(<= main_~i~0 14)} assume true; {12188#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:55,379 INFO L273 TraceCheckUtils]: 63: Hoare triple {12188#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12188#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:55,379 INFO L273 TraceCheckUtils]: 64: Hoare triple {12188#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12188#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:55,380 INFO L273 TraceCheckUtils]: 65: Hoare triple {12188#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12189#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:55,380 INFO L273 TraceCheckUtils]: 66: Hoare triple {12189#(<= main_~i~0 15)} assume true; {12189#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:55,381 INFO L273 TraceCheckUtils]: 67: Hoare triple {12189#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12189#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:55,381 INFO L273 TraceCheckUtils]: 68: Hoare triple {12189#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12189#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:55,382 INFO L273 TraceCheckUtils]: 69: Hoare triple {12189#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12190#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:55,382 INFO L273 TraceCheckUtils]: 70: Hoare triple {12190#(<= main_~i~0 16)} assume true; {12190#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:55,383 INFO L273 TraceCheckUtils]: 71: Hoare triple {12190#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12190#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:55,383 INFO L273 TraceCheckUtils]: 72: Hoare triple {12190#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12190#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:55,384 INFO L273 TraceCheckUtils]: 73: Hoare triple {12190#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12191#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:55,385 INFO L273 TraceCheckUtils]: 74: Hoare triple {12191#(<= main_~i~0 17)} assume true; {12191#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:55,385 INFO L273 TraceCheckUtils]: 75: Hoare triple {12191#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12191#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:55,386 INFO L273 TraceCheckUtils]: 76: Hoare triple {12191#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12191#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:55,386 INFO L273 TraceCheckUtils]: 77: Hoare triple {12191#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12192#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:55,387 INFO L273 TraceCheckUtils]: 78: Hoare triple {12192#(<= main_~i~0 18)} assume true; {12192#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:55,387 INFO L273 TraceCheckUtils]: 79: Hoare triple {12192#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12192#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:55,388 INFO L273 TraceCheckUtils]: 80: Hoare triple {12192#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12192#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:55,388 INFO L273 TraceCheckUtils]: 81: Hoare triple {12192#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12193#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:55,389 INFO L273 TraceCheckUtils]: 82: Hoare triple {12193#(<= main_~i~0 19)} assume true; {12193#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:55,389 INFO L273 TraceCheckUtils]: 83: Hoare triple {12193#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12193#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:55,390 INFO L273 TraceCheckUtils]: 84: Hoare triple {12193#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12193#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:55,391 INFO L273 TraceCheckUtils]: 85: Hoare triple {12193#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12194#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:55,391 INFO L273 TraceCheckUtils]: 86: Hoare triple {12194#(<= main_~i~0 20)} assume true; {12194#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:55,392 INFO L273 TraceCheckUtils]: 87: Hoare triple {12194#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12194#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:55,392 INFO L273 TraceCheckUtils]: 88: Hoare triple {12194#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12194#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:55,393 INFO L273 TraceCheckUtils]: 89: Hoare triple {12194#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12195#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:55,393 INFO L273 TraceCheckUtils]: 90: Hoare triple {12195#(<= main_~i~0 21)} assume true; {12195#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:55,394 INFO L273 TraceCheckUtils]: 91: Hoare triple {12195#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12195#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:55,395 INFO L273 TraceCheckUtils]: 92: Hoare triple {12195#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12195#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:55,397 INFO L273 TraceCheckUtils]: 93: Hoare triple {12195#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12196#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:55,397 INFO L273 TraceCheckUtils]: 94: Hoare triple {12196#(<= main_~i~0 22)} assume true; {12196#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:55,399 INFO L273 TraceCheckUtils]: 95: Hoare triple {12196#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12196#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:55,400 INFO L273 TraceCheckUtils]: 96: Hoare triple {12196#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12196#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:55,400 INFO L273 TraceCheckUtils]: 97: Hoare triple {12196#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12197#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:55,401 INFO L273 TraceCheckUtils]: 98: Hoare triple {12197#(<= main_~i~0 23)} assume true; {12197#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:55,402 INFO L273 TraceCheckUtils]: 99: Hoare triple {12197#(<= main_~i~0 23)} assume !(~i~0 < 100000); {12173#false} is VALID [2018-11-18 22:56:55,402 INFO L273 TraceCheckUtils]: 100: Hoare triple {12173#false} havoc ~x~0;~x~0 := 0; {12173#false} is VALID [2018-11-18 22:56:55,402 INFO L273 TraceCheckUtils]: 101: Hoare triple {12173#false} assume true; {12173#false} is VALID [2018-11-18 22:56:55,402 INFO L273 TraceCheckUtils]: 102: Hoare triple {12173#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12173#false} is VALID [2018-11-18 22:56:55,403 INFO L256 TraceCheckUtils]: 103: Hoare triple {12173#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {12173#false} is VALID [2018-11-18 22:56:55,403 INFO L273 TraceCheckUtils]: 104: Hoare triple {12173#false} ~cond := #in~cond; {12173#false} is VALID [2018-11-18 22:56:55,403 INFO L273 TraceCheckUtils]: 105: Hoare triple {12173#false} assume 0 == ~cond; {12173#false} is VALID [2018-11-18 22:56:55,403 INFO L273 TraceCheckUtils]: 106: Hoare triple {12173#false} assume !false; {12173#false} is VALID [2018-11-18 22:56:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:55,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:55,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:55,420 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:56:55,485 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-18 22:56:55,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:55,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:55,950 INFO L256 TraceCheckUtils]: 0: Hoare triple {12172#true} call ULTIMATE.init(); {12172#true} is VALID [2018-11-18 22:56:55,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {12172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12172#true} is VALID [2018-11-18 22:56:55,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {12172#true} assume true; {12172#true} is VALID [2018-11-18 22:56:55,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12172#true} {12172#true} #57#return; {12172#true} is VALID [2018-11-18 22:56:55,951 INFO L256 TraceCheckUtils]: 4: Hoare triple {12172#true} call #t~ret4 := main(); {12172#true} is VALID [2018-11-18 22:56:55,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {12172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {12216#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:55,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {12216#(<= main_~i~0 0)} assume true; {12216#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:55,952 INFO L273 TraceCheckUtils]: 7: Hoare triple {12216#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12216#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:55,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {12216#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12216#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:55,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {12216#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12175#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {12175#(<= main_~i~0 1)} assume true; {12175#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {12175#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12175#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {12175#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12175#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {12175#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12176#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {12176#(<= main_~i~0 2)} assume true; {12176#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {12176#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12176#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {12176#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12176#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {12176#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12177#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {12177#(<= main_~i~0 3)} assume true; {12177#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,959 INFO L273 TraceCheckUtils]: 19: Hoare triple {12177#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12177#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {12177#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12177#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,960 INFO L273 TraceCheckUtils]: 21: Hoare triple {12177#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12178#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {12178#(<= main_~i~0 4)} assume true; {12178#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,961 INFO L273 TraceCheckUtils]: 23: Hoare triple {12178#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12178#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {12178#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12178#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,962 INFO L273 TraceCheckUtils]: 25: Hoare triple {12178#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12179#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {12179#(<= main_~i~0 5)} assume true; {12179#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {12179#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12179#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,964 INFO L273 TraceCheckUtils]: 28: Hoare triple {12179#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12179#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {12179#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12180#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {12180#(<= main_~i~0 6)} assume true; {12180#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {12180#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12180#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {12180#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12180#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {12180#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12181#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {12181#(<= main_~i~0 7)} assume true; {12181#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,967 INFO L273 TraceCheckUtils]: 35: Hoare triple {12181#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12181#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,968 INFO L273 TraceCheckUtils]: 36: Hoare triple {12181#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12181#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,968 INFO L273 TraceCheckUtils]: 37: Hoare triple {12181#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12182#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,969 INFO L273 TraceCheckUtils]: 38: Hoare triple {12182#(<= main_~i~0 8)} assume true; {12182#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,969 INFO L273 TraceCheckUtils]: 39: Hoare triple {12182#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12182#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,970 INFO L273 TraceCheckUtils]: 40: Hoare triple {12182#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12182#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,971 INFO L273 TraceCheckUtils]: 41: Hoare triple {12182#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12183#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,971 INFO L273 TraceCheckUtils]: 42: Hoare triple {12183#(<= main_~i~0 9)} assume true; {12183#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,972 INFO L273 TraceCheckUtils]: 43: Hoare triple {12183#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12183#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,972 INFO L273 TraceCheckUtils]: 44: Hoare triple {12183#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12183#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,973 INFO L273 TraceCheckUtils]: 45: Hoare triple {12183#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12184#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,973 INFO L273 TraceCheckUtils]: 46: Hoare triple {12184#(<= main_~i~0 10)} assume true; {12184#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,974 INFO L273 TraceCheckUtils]: 47: Hoare triple {12184#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12184#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,974 INFO L273 TraceCheckUtils]: 48: Hoare triple {12184#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12184#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,975 INFO L273 TraceCheckUtils]: 49: Hoare triple {12184#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12185#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,975 INFO L273 TraceCheckUtils]: 50: Hoare triple {12185#(<= main_~i~0 11)} assume true; {12185#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,976 INFO L273 TraceCheckUtils]: 51: Hoare triple {12185#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12185#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,976 INFO L273 TraceCheckUtils]: 52: Hoare triple {12185#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12185#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,977 INFO L273 TraceCheckUtils]: 53: Hoare triple {12185#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12186#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,977 INFO L273 TraceCheckUtils]: 54: Hoare triple {12186#(<= main_~i~0 12)} assume true; {12186#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,978 INFO L273 TraceCheckUtils]: 55: Hoare triple {12186#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12186#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,978 INFO L273 TraceCheckUtils]: 56: Hoare triple {12186#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12186#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,979 INFO L273 TraceCheckUtils]: 57: Hoare triple {12186#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12187#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:55,980 INFO L273 TraceCheckUtils]: 58: Hoare triple {12187#(<= main_~i~0 13)} assume true; {12187#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:55,980 INFO L273 TraceCheckUtils]: 59: Hoare triple {12187#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12187#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:55,981 INFO L273 TraceCheckUtils]: 60: Hoare triple {12187#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12187#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:55,981 INFO L273 TraceCheckUtils]: 61: Hoare triple {12187#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12188#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:55,982 INFO L273 TraceCheckUtils]: 62: Hoare triple {12188#(<= main_~i~0 14)} assume true; {12188#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:55,982 INFO L273 TraceCheckUtils]: 63: Hoare triple {12188#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12188#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:55,983 INFO L273 TraceCheckUtils]: 64: Hoare triple {12188#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12188#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:55,983 INFO L273 TraceCheckUtils]: 65: Hoare triple {12188#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12189#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:55,984 INFO L273 TraceCheckUtils]: 66: Hoare triple {12189#(<= main_~i~0 15)} assume true; {12189#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:55,984 INFO L273 TraceCheckUtils]: 67: Hoare triple {12189#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12189#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:55,985 INFO L273 TraceCheckUtils]: 68: Hoare triple {12189#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12189#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:55,985 INFO L273 TraceCheckUtils]: 69: Hoare triple {12189#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12190#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:55,986 INFO L273 TraceCheckUtils]: 70: Hoare triple {12190#(<= main_~i~0 16)} assume true; {12190#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:55,986 INFO L273 TraceCheckUtils]: 71: Hoare triple {12190#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12190#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:55,987 INFO L273 TraceCheckUtils]: 72: Hoare triple {12190#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12190#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:55,988 INFO L273 TraceCheckUtils]: 73: Hoare triple {12190#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12191#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:55,988 INFO L273 TraceCheckUtils]: 74: Hoare triple {12191#(<= main_~i~0 17)} assume true; {12191#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:55,989 INFO L273 TraceCheckUtils]: 75: Hoare triple {12191#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12191#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:55,989 INFO L273 TraceCheckUtils]: 76: Hoare triple {12191#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12191#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:55,990 INFO L273 TraceCheckUtils]: 77: Hoare triple {12191#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12192#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:55,990 INFO L273 TraceCheckUtils]: 78: Hoare triple {12192#(<= main_~i~0 18)} assume true; {12192#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:55,991 INFO L273 TraceCheckUtils]: 79: Hoare triple {12192#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12192#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:55,991 INFO L273 TraceCheckUtils]: 80: Hoare triple {12192#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12192#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:55,992 INFO L273 TraceCheckUtils]: 81: Hoare triple {12192#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12193#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:55,992 INFO L273 TraceCheckUtils]: 82: Hoare triple {12193#(<= main_~i~0 19)} assume true; {12193#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:55,993 INFO L273 TraceCheckUtils]: 83: Hoare triple {12193#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12193#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:55,993 INFO L273 TraceCheckUtils]: 84: Hoare triple {12193#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12193#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:55,994 INFO L273 TraceCheckUtils]: 85: Hoare triple {12193#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12194#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:55,994 INFO L273 TraceCheckUtils]: 86: Hoare triple {12194#(<= main_~i~0 20)} assume true; {12194#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:55,995 INFO L273 TraceCheckUtils]: 87: Hoare triple {12194#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12194#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:55,995 INFO L273 TraceCheckUtils]: 88: Hoare triple {12194#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12194#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:55,996 INFO L273 TraceCheckUtils]: 89: Hoare triple {12194#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12195#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:55,997 INFO L273 TraceCheckUtils]: 90: Hoare triple {12195#(<= main_~i~0 21)} assume true; {12195#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:55,997 INFO L273 TraceCheckUtils]: 91: Hoare triple {12195#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12195#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:55,998 INFO L273 TraceCheckUtils]: 92: Hoare triple {12195#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12195#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:55,998 INFO L273 TraceCheckUtils]: 93: Hoare triple {12195#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12196#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:55,999 INFO L273 TraceCheckUtils]: 94: Hoare triple {12196#(<= main_~i~0 22)} assume true; {12196#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:55,999 INFO L273 TraceCheckUtils]: 95: Hoare triple {12196#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12196#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:56,000 INFO L273 TraceCheckUtils]: 96: Hoare triple {12196#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12196#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:56,000 INFO L273 TraceCheckUtils]: 97: Hoare triple {12196#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12197#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:56,001 INFO L273 TraceCheckUtils]: 98: Hoare triple {12197#(<= main_~i~0 23)} assume true; {12197#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:56,002 INFO L273 TraceCheckUtils]: 99: Hoare triple {12197#(<= main_~i~0 23)} assume !(~i~0 < 100000); {12173#false} is VALID [2018-11-18 22:56:56,002 INFO L273 TraceCheckUtils]: 100: Hoare triple {12173#false} havoc ~x~0;~x~0 := 0; {12173#false} is VALID [2018-11-18 22:56:56,002 INFO L273 TraceCheckUtils]: 101: Hoare triple {12173#false} assume true; {12173#false} is VALID [2018-11-18 22:56:56,002 INFO L273 TraceCheckUtils]: 102: Hoare triple {12173#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12173#false} is VALID [2018-11-18 22:56:56,002 INFO L256 TraceCheckUtils]: 103: Hoare triple {12173#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {12173#false} is VALID [2018-11-18 22:56:56,003 INFO L273 TraceCheckUtils]: 104: Hoare triple {12173#false} ~cond := #in~cond; {12173#false} is VALID [2018-11-18 22:56:56,003 INFO L273 TraceCheckUtils]: 105: Hoare triple {12173#false} assume 0 == ~cond; {12173#false} is VALID [2018-11-18 22:56:56,003 INFO L273 TraceCheckUtils]: 106: Hoare triple {12173#false} assume !false; {12173#false} is VALID [2018-11-18 22:56:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:56,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:56,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-18 22:56:56,032 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2018-11-18 22:56:56,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:56,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 22:56:56,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:56,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 22:56:56,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 22:56:56,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:56:56,143 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand 27 states. [2018-11-18 22:56:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:56,732 INFO L93 Difference]: Finished difference Result 130 states and 157 transitions. [2018-11-18 22:56:56,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 22:56:56,733 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2018-11-18 22:56:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:56:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 157 transitions. [2018-11-18 22:56:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:56:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 157 transitions. [2018-11-18 22:56:56,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 157 transitions. [2018-11-18 22:56:56,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:56,887 INFO L225 Difference]: With dead ends: 130 [2018-11-18 22:56:56,887 INFO L226 Difference]: Without dead ends: 118 [2018-11-18 22:56:56,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:56:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-18 22:56:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-11-18 22:56:56,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:56,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 116 states. [2018-11-18 22:56:56,932 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 116 states. [2018-11-18 22:56:56,933 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 116 states. [2018-11-18 22:56:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:56,934 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-11-18 22:56:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2018-11-18 22:56:56,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:56,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:56,935 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 118 states. [2018-11-18 22:56:56,935 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 118 states. [2018-11-18 22:56:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:56,937 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-11-18 22:56:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2018-11-18 22:56:56,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:56,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:56,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:56,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-18 22:56:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2018-11-18 22:56:56,940 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 107 [2018-11-18 22:56:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:56,940 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2018-11-18 22:56:56,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 22:56:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2018-11-18 22:56:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 22:56:56,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:56,941 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:56,941 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:56,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:56,942 INFO L82 PathProgramCache]: Analyzing trace with hash 256860050, now seen corresponding path program 24 times [2018-11-18 22:56:56,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:56,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:56,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:56,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:56,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:58,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {13068#true} call ULTIMATE.init(); {13068#true} is VALID [2018-11-18 22:56:58,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {13068#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13068#true} is VALID [2018-11-18 22:56:58,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {13068#true} assume true; {13068#true} is VALID [2018-11-18 22:56:58,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13068#true} {13068#true} #57#return; {13068#true} is VALID [2018-11-18 22:56:58,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {13068#true} call #t~ret4 := main(); {13068#true} is VALID [2018-11-18 22:56:58,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {13068#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {13070#(= main_~i~0 0)} is VALID [2018-11-18 22:56:58,093 INFO L273 TraceCheckUtils]: 6: Hoare triple {13070#(= main_~i~0 0)} assume true; {13070#(= main_~i~0 0)} is VALID [2018-11-18 22:56:58,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {13070#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13070#(= main_~i~0 0)} is VALID [2018-11-18 22:56:58,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {13070#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13070#(= main_~i~0 0)} is VALID [2018-11-18 22:56:58,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {13070#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {13071#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:58,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {13071#(<= main_~i~0 1)} assume true; {13071#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:58,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {13071#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13071#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:58,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {13071#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13071#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:58,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {13071#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13072#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:58,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {13072#(<= main_~i~0 2)} assume true; {13072#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:58,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {13072#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13072#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:58,096 INFO L273 TraceCheckUtils]: 16: Hoare triple {13072#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13072#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:58,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {13072#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {13073#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:58,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {13073#(<= main_~i~0 3)} assume true; {13073#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:58,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {13073#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13073#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:58,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {13073#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13073#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:58,099 INFO L273 TraceCheckUtils]: 21: Hoare triple {13073#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {13074#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:58,099 INFO L273 TraceCheckUtils]: 22: Hoare triple {13074#(<= main_~i~0 4)} assume true; {13074#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:58,100 INFO L273 TraceCheckUtils]: 23: Hoare triple {13074#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13074#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:58,100 INFO L273 TraceCheckUtils]: 24: Hoare triple {13074#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13074#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:58,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {13074#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {13075#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:58,102 INFO L273 TraceCheckUtils]: 26: Hoare triple {13075#(<= main_~i~0 5)} assume true; {13075#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:58,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {13075#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13075#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:58,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {13075#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13075#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:58,103 INFO L273 TraceCheckUtils]: 29: Hoare triple {13075#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {13076#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:58,104 INFO L273 TraceCheckUtils]: 30: Hoare triple {13076#(<= main_~i~0 6)} assume true; {13076#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:58,104 INFO L273 TraceCheckUtils]: 31: Hoare triple {13076#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13076#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:58,105 INFO L273 TraceCheckUtils]: 32: Hoare triple {13076#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13076#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:58,105 INFO L273 TraceCheckUtils]: 33: Hoare triple {13076#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {13077#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:58,106 INFO L273 TraceCheckUtils]: 34: Hoare triple {13077#(<= main_~i~0 7)} assume true; {13077#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:58,106 INFO L273 TraceCheckUtils]: 35: Hoare triple {13077#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13077#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:58,107 INFO L273 TraceCheckUtils]: 36: Hoare triple {13077#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13077#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:58,107 INFO L273 TraceCheckUtils]: 37: Hoare triple {13077#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {13078#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:58,108 INFO L273 TraceCheckUtils]: 38: Hoare triple {13078#(<= main_~i~0 8)} assume true; {13078#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:58,108 INFO L273 TraceCheckUtils]: 39: Hoare triple {13078#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13078#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:58,109 INFO L273 TraceCheckUtils]: 40: Hoare triple {13078#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13078#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:58,110 INFO L273 TraceCheckUtils]: 41: Hoare triple {13078#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {13079#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:58,110 INFO L273 TraceCheckUtils]: 42: Hoare triple {13079#(<= main_~i~0 9)} assume true; {13079#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:58,111 INFO L273 TraceCheckUtils]: 43: Hoare triple {13079#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13079#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:58,111 INFO L273 TraceCheckUtils]: 44: Hoare triple {13079#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13079#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:58,112 INFO L273 TraceCheckUtils]: 45: Hoare triple {13079#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {13080#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:58,112 INFO L273 TraceCheckUtils]: 46: Hoare triple {13080#(<= main_~i~0 10)} assume true; {13080#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:58,113 INFO L273 TraceCheckUtils]: 47: Hoare triple {13080#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13080#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:58,113 INFO L273 TraceCheckUtils]: 48: Hoare triple {13080#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13080#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:58,114 INFO L273 TraceCheckUtils]: 49: Hoare triple {13080#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {13081#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:58,115 INFO L273 TraceCheckUtils]: 50: Hoare triple {13081#(<= main_~i~0 11)} assume true; {13081#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:58,115 INFO L273 TraceCheckUtils]: 51: Hoare triple {13081#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13081#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:58,116 INFO L273 TraceCheckUtils]: 52: Hoare triple {13081#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13081#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:58,116 INFO L273 TraceCheckUtils]: 53: Hoare triple {13081#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {13082#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:58,117 INFO L273 TraceCheckUtils]: 54: Hoare triple {13082#(<= main_~i~0 12)} assume true; {13082#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:58,117 INFO L273 TraceCheckUtils]: 55: Hoare triple {13082#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13082#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:58,118 INFO L273 TraceCheckUtils]: 56: Hoare triple {13082#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13082#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:58,119 INFO L273 TraceCheckUtils]: 57: Hoare triple {13082#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {13083#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:58,119 INFO L273 TraceCheckUtils]: 58: Hoare triple {13083#(<= main_~i~0 13)} assume true; {13083#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:58,120 INFO L273 TraceCheckUtils]: 59: Hoare triple {13083#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13083#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:58,120 INFO L273 TraceCheckUtils]: 60: Hoare triple {13083#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13083#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:58,121 INFO L273 TraceCheckUtils]: 61: Hoare triple {13083#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {13084#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:58,121 INFO L273 TraceCheckUtils]: 62: Hoare triple {13084#(<= main_~i~0 14)} assume true; {13084#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:58,122 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13084#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:58,122 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13084#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:58,123 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {13085#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:58,124 INFO L273 TraceCheckUtils]: 66: Hoare triple {13085#(<= main_~i~0 15)} assume true; {13085#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:58,124 INFO L273 TraceCheckUtils]: 67: Hoare triple {13085#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13085#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:58,125 INFO L273 TraceCheckUtils]: 68: Hoare triple {13085#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13085#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:58,125 INFO L273 TraceCheckUtils]: 69: Hoare triple {13085#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {13086#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:58,126 INFO L273 TraceCheckUtils]: 70: Hoare triple {13086#(<= main_~i~0 16)} assume true; {13086#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:58,126 INFO L273 TraceCheckUtils]: 71: Hoare triple {13086#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13086#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:58,127 INFO L273 TraceCheckUtils]: 72: Hoare triple {13086#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13086#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:58,127 INFO L273 TraceCheckUtils]: 73: Hoare triple {13086#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {13087#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:58,128 INFO L273 TraceCheckUtils]: 74: Hoare triple {13087#(<= main_~i~0 17)} assume true; {13087#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:58,128 INFO L273 TraceCheckUtils]: 75: Hoare triple {13087#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13087#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:58,129 INFO L273 TraceCheckUtils]: 76: Hoare triple {13087#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13087#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:58,130 INFO L273 TraceCheckUtils]: 77: Hoare triple {13087#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {13088#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:58,130 INFO L273 TraceCheckUtils]: 78: Hoare triple {13088#(<= main_~i~0 18)} assume true; {13088#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:58,130 INFO L273 TraceCheckUtils]: 79: Hoare triple {13088#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13088#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:58,131 INFO L273 TraceCheckUtils]: 80: Hoare triple {13088#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13088#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:58,132 INFO L273 TraceCheckUtils]: 81: Hoare triple {13088#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {13089#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:58,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {13089#(<= main_~i~0 19)} assume true; {13089#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:58,133 INFO L273 TraceCheckUtils]: 83: Hoare triple {13089#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13089#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:58,133 INFO L273 TraceCheckUtils]: 84: Hoare triple {13089#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13089#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:58,134 INFO L273 TraceCheckUtils]: 85: Hoare triple {13089#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {13090#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:58,134 INFO L273 TraceCheckUtils]: 86: Hoare triple {13090#(<= main_~i~0 20)} assume true; {13090#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:58,135 INFO L273 TraceCheckUtils]: 87: Hoare triple {13090#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13090#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:58,136 INFO L273 TraceCheckUtils]: 88: Hoare triple {13090#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13090#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:58,136 INFO L273 TraceCheckUtils]: 89: Hoare triple {13090#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {13091#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:58,137 INFO L273 TraceCheckUtils]: 90: Hoare triple {13091#(<= main_~i~0 21)} assume true; {13091#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:58,137 INFO L273 TraceCheckUtils]: 91: Hoare triple {13091#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13091#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:58,138 INFO L273 TraceCheckUtils]: 92: Hoare triple {13091#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13091#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:58,139 INFO L273 TraceCheckUtils]: 93: Hoare triple {13091#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {13092#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:58,139 INFO L273 TraceCheckUtils]: 94: Hoare triple {13092#(<= main_~i~0 22)} assume true; {13092#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:58,140 INFO L273 TraceCheckUtils]: 95: Hoare triple {13092#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13092#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:58,140 INFO L273 TraceCheckUtils]: 96: Hoare triple {13092#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13092#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:58,141 INFO L273 TraceCheckUtils]: 97: Hoare triple {13092#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {13093#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:58,141 INFO L273 TraceCheckUtils]: 98: Hoare triple {13093#(<= main_~i~0 23)} assume true; {13093#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:58,142 INFO L273 TraceCheckUtils]: 99: Hoare triple {13093#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13093#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:58,142 INFO L273 TraceCheckUtils]: 100: Hoare triple {13093#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13093#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:58,143 INFO L273 TraceCheckUtils]: 101: Hoare triple {13093#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {13094#(<= main_~i~0 24)} is VALID [2018-11-18 22:56:58,144 INFO L273 TraceCheckUtils]: 102: Hoare triple {13094#(<= main_~i~0 24)} assume true; {13094#(<= main_~i~0 24)} is VALID [2018-11-18 22:56:58,144 INFO L273 TraceCheckUtils]: 103: Hoare triple {13094#(<= main_~i~0 24)} assume !(~i~0 < 100000); {13069#false} is VALID [2018-11-18 22:56:58,145 INFO L273 TraceCheckUtils]: 104: Hoare triple {13069#false} havoc ~x~0;~x~0 := 0; {13069#false} is VALID [2018-11-18 22:56:58,145 INFO L273 TraceCheckUtils]: 105: Hoare triple {13069#false} assume true; {13069#false} is VALID [2018-11-18 22:56:58,145 INFO L273 TraceCheckUtils]: 106: Hoare triple {13069#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13069#false} is VALID [2018-11-18 22:56:58,145 INFO L256 TraceCheckUtils]: 107: Hoare triple {13069#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {13069#false} is VALID [2018-11-18 22:56:58,146 INFO L273 TraceCheckUtils]: 108: Hoare triple {13069#false} ~cond := #in~cond; {13069#false} is VALID [2018-11-18 22:56:58,146 INFO L273 TraceCheckUtils]: 109: Hoare triple {13069#false} assume 0 == ~cond; {13069#false} is VALID [2018-11-18 22:56:58,146 INFO L273 TraceCheckUtils]: 110: Hoare triple {13069#false} assume !false; {13069#false} is VALID [2018-11-18 22:56:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:58,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:58,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:58,165 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:56:58,238 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-18 22:56:58,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:58,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:58,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {13068#true} call ULTIMATE.init(); {13068#true} is VALID [2018-11-18 22:56:58,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {13068#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13068#true} is VALID [2018-11-18 22:56:58,482 INFO L273 TraceCheckUtils]: 2: Hoare triple {13068#true} assume true; {13068#true} is VALID [2018-11-18 22:56:58,482 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13068#true} {13068#true} #57#return; {13068#true} is VALID [2018-11-18 22:56:58,482 INFO L256 TraceCheckUtils]: 4: Hoare triple {13068#true} call #t~ret4 := main(); {13068#true} is VALID [2018-11-18 22:56:58,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {13068#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {13113#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:58,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {13113#(<= main_~i~0 0)} assume true; {13113#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:58,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {13113#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13113#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:58,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {13113#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13113#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:58,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {13113#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {13071#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:58,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {13071#(<= main_~i~0 1)} assume true; {13071#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:58,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {13071#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13071#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:58,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {13071#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13071#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:58,487 INFO L273 TraceCheckUtils]: 13: Hoare triple {13071#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13072#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:58,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {13072#(<= main_~i~0 2)} assume true; {13072#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:58,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {13072#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13072#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:58,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {13072#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13072#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:58,489 INFO L273 TraceCheckUtils]: 17: Hoare triple {13072#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {13073#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:58,489 INFO L273 TraceCheckUtils]: 18: Hoare triple {13073#(<= main_~i~0 3)} assume true; {13073#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:58,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {13073#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13073#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:58,490 INFO L273 TraceCheckUtils]: 20: Hoare triple {13073#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13073#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:58,491 INFO L273 TraceCheckUtils]: 21: Hoare triple {13073#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {13074#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:58,492 INFO L273 TraceCheckUtils]: 22: Hoare triple {13074#(<= main_~i~0 4)} assume true; {13074#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:58,492 INFO L273 TraceCheckUtils]: 23: Hoare triple {13074#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13074#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:58,493 INFO L273 TraceCheckUtils]: 24: Hoare triple {13074#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13074#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:58,494 INFO L273 TraceCheckUtils]: 25: Hoare triple {13074#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {13075#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:58,494 INFO L273 TraceCheckUtils]: 26: Hoare triple {13075#(<= main_~i~0 5)} assume true; {13075#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:58,495 INFO L273 TraceCheckUtils]: 27: Hoare triple {13075#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13075#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:58,495 INFO L273 TraceCheckUtils]: 28: Hoare triple {13075#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13075#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:58,496 INFO L273 TraceCheckUtils]: 29: Hoare triple {13075#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {13076#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:58,496 INFO L273 TraceCheckUtils]: 30: Hoare triple {13076#(<= main_~i~0 6)} assume true; {13076#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:58,497 INFO L273 TraceCheckUtils]: 31: Hoare triple {13076#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13076#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:58,497 INFO L273 TraceCheckUtils]: 32: Hoare triple {13076#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13076#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:58,498 INFO L273 TraceCheckUtils]: 33: Hoare triple {13076#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {13077#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:58,499 INFO L273 TraceCheckUtils]: 34: Hoare triple {13077#(<= main_~i~0 7)} assume true; {13077#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:58,499 INFO L273 TraceCheckUtils]: 35: Hoare triple {13077#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13077#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:58,500 INFO L273 TraceCheckUtils]: 36: Hoare triple {13077#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13077#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:58,500 INFO L273 TraceCheckUtils]: 37: Hoare triple {13077#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {13078#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:58,501 INFO L273 TraceCheckUtils]: 38: Hoare triple {13078#(<= main_~i~0 8)} assume true; {13078#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:58,501 INFO L273 TraceCheckUtils]: 39: Hoare triple {13078#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13078#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:58,502 INFO L273 TraceCheckUtils]: 40: Hoare triple {13078#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13078#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:58,503 INFO L273 TraceCheckUtils]: 41: Hoare triple {13078#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {13079#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:58,503 INFO L273 TraceCheckUtils]: 42: Hoare triple {13079#(<= main_~i~0 9)} assume true; {13079#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:58,504 INFO L273 TraceCheckUtils]: 43: Hoare triple {13079#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13079#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:58,504 INFO L273 TraceCheckUtils]: 44: Hoare triple {13079#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13079#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:58,505 INFO L273 TraceCheckUtils]: 45: Hoare triple {13079#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {13080#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:58,505 INFO L273 TraceCheckUtils]: 46: Hoare triple {13080#(<= main_~i~0 10)} assume true; {13080#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:58,506 INFO L273 TraceCheckUtils]: 47: Hoare triple {13080#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13080#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:58,506 INFO L273 TraceCheckUtils]: 48: Hoare triple {13080#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13080#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:58,507 INFO L273 TraceCheckUtils]: 49: Hoare triple {13080#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {13081#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:58,508 INFO L273 TraceCheckUtils]: 50: Hoare triple {13081#(<= main_~i~0 11)} assume true; {13081#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:58,508 INFO L273 TraceCheckUtils]: 51: Hoare triple {13081#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13081#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:58,509 INFO L273 TraceCheckUtils]: 52: Hoare triple {13081#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13081#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:58,509 INFO L273 TraceCheckUtils]: 53: Hoare triple {13081#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {13082#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:58,510 INFO L273 TraceCheckUtils]: 54: Hoare triple {13082#(<= main_~i~0 12)} assume true; {13082#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:58,510 INFO L273 TraceCheckUtils]: 55: Hoare triple {13082#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13082#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:58,511 INFO L273 TraceCheckUtils]: 56: Hoare triple {13082#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13082#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:58,512 INFO L273 TraceCheckUtils]: 57: Hoare triple {13082#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {13083#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:58,512 INFO L273 TraceCheckUtils]: 58: Hoare triple {13083#(<= main_~i~0 13)} assume true; {13083#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:58,513 INFO L273 TraceCheckUtils]: 59: Hoare triple {13083#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13083#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:58,513 INFO L273 TraceCheckUtils]: 60: Hoare triple {13083#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13083#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:58,514 INFO L273 TraceCheckUtils]: 61: Hoare triple {13083#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {13084#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:58,514 INFO L273 TraceCheckUtils]: 62: Hoare triple {13084#(<= main_~i~0 14)} assume true; {13084#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:58,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13084#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:58,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13084#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:58,516 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {13085#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:58,517 INFO L273 TraceCheckUtils]: 66: Hoare triple {13085#(<= main_~i~0 15)} assume true; {13085#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:58,517 INFO L273 TraceCheckUtils]: 67: Hoare triple {13085#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13085#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:58,518 INFO L273 TraceCheckUtils]: 68: Hoare triple {13085#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13085#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:58,519 INFO L273 TraceCheckUtils]: 69: Hoare triple {13085#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {13086#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:58,519 INFO L273 TraceCheckUtils]: 70: Hoare triple {13086#(<= main_~i~0 16)} assume true; {13086#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:58,520 INFO L273 TraceCheckUtils]: 71: Hoare triple {13086#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13086#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:58,520 INFO L273 TraceCheckUtils]: 72: Hoare triple {13086#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13086#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:58,521 INFO L273 TraceCheckUtils]: 73: Hoare triple {13086#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {13087#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:58,521 INFO L273 TraceCheckUtils]: 74: Hoare triple {13087#(<= main_~i~0 17)} assume true; {13087#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:58,522 INFO L273 TraceCheckUtils]: 75: Hoare triple {13087#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13087#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:58,522 INFO L273 TraceCheckUtils]: 76: Hoare triple {13087#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13087#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:58,523 INFO L273 TraceCheckUtils]: 77: Hoare triple {13087#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {13088#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:58,524 INFO L273 TraceCheckUtils]: 78: Hoare triple {13088#(<= main_~i~0 18)} assume true; {13088#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:58,524 INFO L273 TraceCheckUtils]: 79: Hoare triple {13088#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13088#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:58,525 INFO L273 TraceCheckUtils]: 80: Hoare triple {13088#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13088#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:58,525 INFO L273 TraceCheckUtils]: 81: Hoare triple {13088#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {13089#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:58,526 INFO L273 TraceCheckUtils]: 82: Hoare triple {13089#(<= main_~i~0 19)} assume true; {13089#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:58,526 INFO L273 TraceCheckUtils]: 83: Hoare triple {13089#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13089#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:58,527 INFO L273 TraceCheckUtils]: 84: Hoare triple {13089#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13089#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:58,528 INFO L273 TraceCheckUtils]: 85: Hoare triple {13089#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {13090#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:58,528 INFO L273 TraceCheckUtils]: 86: Hoare triple {13090#(<= main_~i~0 20)} assume true; {13090#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:58,529 INFO L273 TraceCheckUtils]: 87: Hoare triple {13090#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13090#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:58,529 INFO L273 TraceCheckUtils]: 88: Hoare triple {13090#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13090#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:58,530 INFO L273 TraceCheckUtils]: 89: Hoare triple {13090#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {13091#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:58,531 INFO L273 TraceCheckUtils]: 90: Hoare triple {13091#(<= main_~i~0 21)} assume true; {13091#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:58,531 INFO L273 TraceCheckUtils]: 91: Hoare triple {13091#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13091#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:58,532 INFO L273 TraceCheckUtils]: 92: Hoare triple {13091#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13091#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:58,532 INFO L273 TraceCheckUtils]: 93: Hoare triple {13091#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {13092#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:58,533 INFO L273 TraceCheckUtils]: 94: Hoare triple {13092#(<= main_~i~0 22)} assume true; {13092#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:58,533 INFO L273 TraceCheckUtils]: 95: Hoare triple {13092#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13092#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:58,534 INFO L273 TraceCheckUtils]: 96: Hoare triple {13092#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13092#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:58,535 INFO L273 TraceCheckUtils]: 97: Hoare triple {13092#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {13093#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:58,535 INFO L273 TraceCheckUtils]: 98: Hoare triple {13093#(<= main_~i~0 23)} assume true; {13093#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:58,536 INFO L273 TraceCheckUtils]: 99: Hoare triple {13093#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13093#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:58,536 INFO L273 TraceCheckUtils]: 100: Hoare triple {13093#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13093#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:58,537 INFO L273 TraceCheckUtils]: 101: Hoare triple {13093#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {13094#(<= main_~i~0 24)} is VALID [2018-11-18 22:56:58,537 INFO L273 TraceCheckUtils]: 102: Hoare triple {13094#(<= main_~i~0 24)} assume true; {13094#(<= main_~i~0 24)} is VALID [2018-11-18 22:56:58,538 INFO L273 TraceCheckUtils]: 103: Hoare triple {13094#(<= main_~i~0 24)} assume !(~i~0 < 100000); {13069#false} is VALID [2018-11-18 22:56:58,538 INFO L273 TraceCheckUtils]: 104: Hoare triple {13069#false} havoc ~x~0;~x~0 := 0; {13069#false} is VALID [2018-11-18 22:56:58,538 INFO L273 TraceCheckUtils]: 105: Hoare triple {13069#false} assume true; {13069#false} is VALID [2018-11-18 22:56:58,539 INFO L273 TraceCheckUtils]: 106: Hoare triple {13069#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13069#false} is VALID [2018-11-18 22:56:58,539 INFO L256 TraceCheckUtils]: 107: Hoare triple {13069#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {13069#false} is VALID [2018-11-18 22:56:58,539 INFO L273 TraceCheckUtils]: 108: Hoare triple {13069#false} ~cond := #in~cond; {13069#false} is VALID [2018-11-18 22:56:58,539 INFO L273 TraceCheckUtils]: 109: Hoare triple {13069#false} assume 0 == ~cond; {13069#false} is VALID [2018-11-18 22:56:58,539 INFO L273 TraceCheckUtils]: 110: Hoare triple {13069#false} assume !false; {13069#false} is VALID [2018-11-18 22:56:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:58,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:58,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-18 22:56:58,569 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2018-11-18 22:56:58,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:58,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:56:58,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:58,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:56:58,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:56:58,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:56:58,895 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand 28 states. [2018-11-18 22:56:59,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:59,893 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2018-11-18 22:56:59,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 22:56:59,893 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2018-11-18 22:56:59,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:56:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 162 transitions. [2018-11-18 22:56:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:56:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 162 transitions. [2018-11-18 22:56:59,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 162 transitions. [2018-11-18 22:57:00,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:00,932 INFO L225 Difference]: With dead ends: 134 [2018-11-18 22:57:00,933 INFO L226 Difference]: Without dead ends: 122 [2018-11-18 22:57:00,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:57:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-18 22:57:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-18 22:57:01,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:01,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 120 states. [2018-11-18 22:57:01,045 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 120 states. [2018-11-18 22:57:01,045 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 120 states. [2018-11-18 22:57:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:01,048 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2018-11-18 22:57:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2018-11-18 22:57:01,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:01,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:01,048 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 122 states. [2018-11-18 22:57:01,048 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 122 states. [2018-11-18 22:57:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:01,050 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2018-11-18 22:57:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2018-11-18 22:57:01,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:01,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:01,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:01,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-18 22:57:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2018-11-18 22:57:01,052 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 111 [2018-11-18 22:57:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:01,052 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2018-11-18 22:57:01,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 22:57:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2018-11-18 22:57:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 22:57:01,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:01,053 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:01,054 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:01,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1431051544, now seen corresponding path program 25 times [2018-11-18 22:57:01,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:01,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:01,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:01,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:01,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:02,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {13995#true} call ULTIMATE.init(); {13995#true} is VALID [2018-11-18 22:57:02,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {13995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13995#true} is VALID [2018-11-18 22:57:02,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-18 22:57:02,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13995#true} {13995#true} #57#return; {13995#true} is VALID [2018-11-18 22:57:02,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {13995#true} call #t~ret4 := main(); {13995#true} is VALID [2018-11-18 22:57:02,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {13995#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {13997#(= main_~i~0 0)} is VALID [2018-11-18 22:57:02,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {13997#(= main_~i~0 0)} assume true; {13997#(= main_~i~0 0)} is VALID [2018-11-18 22:57:02,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {13997#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13997#(= main_~i~0 0)} is VALID [2018-11-18 22:57:02,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {13997#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13997#(= main_~i~0 0)} is VALID [2018-11-18 22:57:02,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {13997#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {13998#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:02,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {13998#(<= main_~i~0 1)} assume true; {13998#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:02,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {13998#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13998#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:02,071 INFO L273 TraceCheckUtils]: 12: Hoare triple {13998#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13998#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:02,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {13998#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13999#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:02,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {13999#(<= main_~i~0 2)} assume true; {13999#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:02,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {13999#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13999#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:02,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {13999#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13999#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:02,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {13999#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14000#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:02,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {14000#(<= main_~i~0 3)} assume true; {14000#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:02,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {14000#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14000#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:02,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {14000#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14000#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:02,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {14000#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14001#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:02,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {14001#(<= main_~i~0 4)} assume true; {14001#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:02,076 INFO L273 TraceCheckUtils]: 23: Hoare triple {14001#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14001#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:02,077 INFO L273 TraceCheckUtils]: 24: Hoare triple {14001#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14001#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:02,078 INFO L273 TraceCheckUtils]: 25: Hoare triple {14001#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14002#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:02,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {14002#(<= main_~i~0 5)} assume true; {14002#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:02,079 INFO L273 TraceCheckUtils]: 27: Hoare triple {14002#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14002#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:02,079 INFO L273 TraceCheckUtils]: 28: Hoare triple {14002#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14002#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:02,080 INFO L273 TraceCheckUtils]: 29: Hoare triple {14002#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14003#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:02,080 INFO L273 TraceCheckUtils]: 30: Hoare triple {14003#(<= main_~i~0 6)} assume true; {14003#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:02,081 INFO L273 TraceCheckUtils]: 31: Hoare triple {14003#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14003#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:02,081 INFO L273 TraceCheckUtils]: 32: Hoare triple {14003#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14003#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:02,082 INFO L273 TraceCheckUtils]: 33: Hoare triple {14003#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14004#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:02,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {14004#(<= main_~i~0 7)} assume true; {14004#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:02,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {14004#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14004#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:02,084 INFO L273 TraceCheckUtils]: 36: Hoare triple {14004#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14004#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:02,084 INFO L273 TraceCheckUtils]: 37: Hoare triple {14004#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14005#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:02,085 INFO L273 TraceCheckUtils]: 38: Hoare triple {14005#(<= main_~i~0 8)} assume true; {14005#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:02,085 INFO L273 TraceCheckUtils]: 39: Hoare triple {14005#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14005#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:02,086 INFO L273 TraceCheckUtils]: 40: Hoare triple {14005#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14005#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:02,087 INFO L273 TraceCheckUtils]: 41: Hoare triple {14005#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14006#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:02,087 INFO L273 TraceCheckUtils]: 42: Hoare triple {14006#(<= main_~i~0 9)} assume true; {14006#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:02,088 INFO L273 TraceCheckUtils]: 43: Hoare triple {14006#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14006#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:02,088 INFO L273 TraceCheckUtils]: 44: Hoare triple {14006#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14006#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:02,089 INFO L273 TraceCheckUtils]: 45: Hoare triple {14006#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14007#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:02,090 INFO L273 TraceCheckUtils]: 46: Hoare triple {14007#(<= main_~i~0 10)} assume true; {14007#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:02,090 INFO L273 TraceCheckUtils]: 47: Hoare triple {14007#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14007#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:02,091 INFO L273 TraceCheckUtils]: 48: Hoare triple {14007#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14007#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:02,091 INFO L273 TraceCheckUtils]: 49: Hoare triple {14007#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14008#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:02,092 INFO L273 TraceCheckUtils]: 50: Hoare triple {14008#(<= main_~i~0 11)} assume true; {14008#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:02,095 INFO L273 TraceCheckUtils]: 51: Hoare triple {14008#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14008#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:02,095 INFO L273 TraceCheckUtils]: 52: Hoare triple {14008#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14008#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:02,096 INFO L273 TraceCheckUtils]: 53: Hoare triple {14008#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14009#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:02,096 INFO L273 TraceCheckUtils]: 54: Hoare triple {14009#(<= main_~i~0 12)} assume true; {14009#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:02,096 INFO L273 TraceCheckUtils]: 55: Hoare triple {14009#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14009#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:02,097 INFO L273 TraceCheckUtils]: 56: Hoare triple {14009#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14009#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:02,097 INFO L273 TraceCheckUtils]: 57: Hoare triple {14009#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14010#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:02,097 INFO L273 TraceCheckUtils]: 58: Hoare triple {14010#(<= main_~i~0 13)} assume true; {14010#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:02,098 INFO L273 TraceCheckUtils]: 59: Hoare triple {14010#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14010#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:02,098 INFO L273 TraceCheckUtils]: 60: Hoare triple {14010#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14010#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:02,098 INFO L273 TraceCheckUtils]: 61: Hoare triple {14010#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14011#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:02,099 INFO L273 TraceCheckUtils]: 62: Hoare triple {14011#(<= main_~i~0 14)} assume true; {14011#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:02,099 INFO L273 TraceCheckUtils]: 63: Hoare triple {14011#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14011#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:02,099 INFO L273 TraceCheckUtils]: 64: Hoare triple {14011#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14011#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:02,100 INFO L273 TraceCheckUtils]: 65: Hoare triple {14011#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14012#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:02,100 INFO L273 TraceCheckUtils]: 66: Hoare triple {14012#(<= main_~i~0 15)} assume true; {14012#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:02,101 INFO L273 TraceCheckUtils]: 67: Hoare triple {14012#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14012#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:02,101 INFO L273 TraceCheckUtils]: 68: Hoare triple {14012#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14012#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:02,102 INFO L273 TraceCheckUtils]: 69: Hoare triple {14012#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14013#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:02,103 INFO L273 TraceCheckUtils]: 70: Hoare triple {14013#(<= main_~i~0 16)} assume true; {14013#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:02,103 INFO L273 TraceCheckUtils]: 71: Hoare triple {14013#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14013#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:02,104 INFO L273 TraceCheckUtils]: 72: Hoare triple {14013#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14013#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:02,104 INFO L273 TraceCheckUtils]: 73: Hoare triple {14013#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14014#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:02,105 INFO L273 TraceCheckUtils]: 74: Hoare triple {14014#(<= main_~i~0 17)} assume true; {14014#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:02,105 INFO L273 TraceCheckUtils]: 75: Hoare triple {14014#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14014#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:02,106 INFO L273 TraceCheckUtils]: 76: Hoare triple {14014#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14014#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:02,107 INFO L273 TraceCheckUtils]: 77: Hoare triple {14014#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14015#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:02,107 INFO L273 TraceCheckUtils]: 78: Hoare triple {14015#(<= main_~i~0 18)} assume true; {14015#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:02,108 INFO L273 TraceCheckUtils]: 79: Hoare triple {14015#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14015#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:02,108 INFO L273 TraceCheckUtils]: 80: Hoare triple {14015#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14015#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:02,109 INFO L273 TraceCheckUtils]: 81: Hoare triple {14015#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14016#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:02,109 INFO L273 TraceCheckUtils]: 82: Hoare triple {14016#(<= main_~i~0 19)} assume true; {14016#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:02,110 INFO L273 TraceCheckUtils]: 83: Hoare triple {14016#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14016#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:02,110 INFO L273 TraceCheckUtils]: 84: Hoare triple {14016#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14016#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:02,111 INFO L273 TraceCheckUtils]: 85: Hoare triple {14016#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14017#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:02,112 INFO L273 TraceCheckUtils]: 86: Hoare triple {14017#(<= main_~i~0 20)} assume true; {14017#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:02,114 INFO L273 TraceCheckUtils]: 87: Hoare triple {14017#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14017#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:02,114 INFO L273 TraceCheckUtils]: 88: Hoare triple {14017#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14017#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:02,115 INFO L273 TraceCheckUtils]: 89: Hoare triple {14017#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14018#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:02,116 INFO L273 TraceCheckUtils]: 90: Hoare triple {14018#(<= main_~i~0 21)} assume true; {14018#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:02,116 INFO L273 TraceCheckUtils]: 91: Hoare triple {14018#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14018#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:02,116 INFO L273 TraceCheckUtils]: 92: Hoare triple {14018#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14018#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:02,117 INFO L273 TraceCheckUtils]: 93: Hoare triple {14018#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14019#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:02,117 INFO L273 TraceCheckUtils]: 94: Hoare triple {14019#(<= main_~i~0 22)} assume true; {14019#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:02,117 INFO L273 TraceCheckUtils]: 95: Hoare triple {14019#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14019#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:02,118 INFO L273 TraceCheckUtils]: 96: Hoare triple {14019#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14019#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:02,118 INFO L273 TraceCheckUtils]: 97: Hoare triple {14019#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {14020#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:02,118 INFO L273 TraceCheckUtils]: 98: Hoare triple {14020#(<= main_~i~0 23)} assume true; {14020#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:02,119 INFO L273 TraceCheckUtils]: 99: Hoare triple {14020#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14020#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:02,119 INFO L273 TraceCheckUtils]: 100: Hoare triple {14020#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14020#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:02,120 INFO L273 TraceCheckUtils]: 101: Hoare triple {14020#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {14021#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:02,120 INFO L273 TraceCheckUtils]: 102: Hoare triple {14021#(<= main_~i~0 24)} assume true; {14021#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:02,121 INFO L273 TraceCheckUtils]: 103: Hoare triple {14021#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14021#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:02,121 INFO L273 TraceCheckUtils]: 104: Hoare triple {14021#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14021#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:02,122 INFO L273 TraceCheckUtils]: 105: Hoare triple {14021#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {14022#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:02,123 INFO L273 TraceCheckUtils]: 106: Hoare triple {14022#(<= main_~i~0 25)} assume true; {14022#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:02,123 INFO L273 TraceCheckUtils]: 107: Hoare triple {14022#(<= main_~i~0 25)} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-18 22:57:02,124 INFO L273 TraceCheckUtils]: 108: Hoare triple {13996#false} havoc ~x~0;~x~0 := 0; {13996#false} is VALID [2018-11-18 22:57:02,124 INFO L273 TraceCheckUtils]: 109: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-18 22:57:02,124 INFO L273 TraceCheckUtils]: 110: Hoare triple {13996#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13996#false} is VALID [2018-11-18 22:57:02,124 INFO L256 TraceCheckUtils]: 111: Hoare triple {13996#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {13996#false} is VALID [2018-11-18 22:57:02,124 INFO L273 TraceCheckUtils]: 112: Hoare triple {13996#false} ~cond := #in~cond; {13996#false} is VALID [2018-11-18 22:57:02,125 INFO L273 TraceCheckUtils]: 113: Hoare triple {13996#false} assume 0 == ~cond; {13996#false} is VALID [2018-11-18 22:57:02,125 INFO L273 TraceCheckUtils]: 114: Hoare triple {13996#false} assume !false; {13996#false} is VALID [2018-11-18 22:57:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:02,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:02,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:02,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:02,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:02,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {13995#true} call ULTIMATE.init(); {13995#true} is VALID [2018-11-18 22:57:02,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {13995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13995#true} is VALID [2018-11-18 22:57:02,416 INFO L273 TraceCheckUtils]: 2: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-18 22:57:02,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13995#true} {13995#true} #57#return; {13995#true} is VALID [2018-11-18 22:57:02,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {13995#true} call #t~ret4 := main(); {13995#true} is VALID [2018-11-18 22:57:02,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {13995#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {14041#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:02,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {14041#(<= main_~i~0 0)} assume true; {14041#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:02,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {14041#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14041#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:02,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {14041#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14041#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:02,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {14041#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {13998#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:02,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {13998#(<= main_~i~0 1)} assume true; {13998#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:02,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {13998#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13998#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:02,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {13998#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13998#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:02,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {13998#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13999#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:02,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {13999#(<= main_~i~0 2)} assume true; {13999#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:02,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {13999#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13999#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:02,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {13999#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13999#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:02,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {13999#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14000#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:02,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {14000#(<= main_~i~0 3)} assume true; {14000#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:02,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {14000#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14000#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:02,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {14000#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14000#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:02,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {14000#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14001#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:02,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {14001#(<= main_~i~0 4)} assume true; {14001#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:02,577 INFO L273 TraceCheckUtils]: 23: Hoare triple {14001#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14001#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:02,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {14001#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14001#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:02,602 INFO L273 TraceCheckUtils]: 25: Hoare triple {14001#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14002#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:02,616 INFO L273 TraceCheckUtils]: 26: Hoare triple {14002#(<= main_~i~0 5)} assume true; {14002#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:02,628 INFO L273 TraceCheckUtils]: 27: Hoare triple {14002#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14002#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:02,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {14002#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14002#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:02,653 INFO L273 TraceCheckUtils]: 29: Hoare triple {14002#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14003#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:02,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {14003#(<= main_~i~0 6)} assume true; {14003#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:02,680 INFO L273 TraceCheckUtils]: 31: Hoare triple {14003#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14003#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:02,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {14003#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14003#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:02,704 INFO L273 TraceCheckUtils]: 33: Hoare triple {14003#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14004#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:02,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {14004#(<= main_~i~0 7)} assume true; {14004#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:02,729 INFO L273 TraceCheckUtils]: 35: Hoare triple {14004#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14004#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:02,737 INFO L273 TraceCheckUtils]: 36: Hoare triple {14004#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14004#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:02,737 INFO L273 TraceCheckUtils]: 37: Hoare triple {14004#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14005#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:02,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {14005#(<= main_~i~0 8)} assume true; {14005#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:02,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {14005#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14005#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:02,742 INFO L273 TraceCheckUtils]: 40: Hoare triple {14005#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14005#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:02,742 INFO L273 TraceCheckUtils]: 41: Hoare triple {14005#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14006#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:02,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {14006#(<= main_~i~0 9)} assume true; {14006#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:02,745 INFO L273 TraceCheckUtils]: 43: Hoare triple {14006#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14006#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:02,745 INFO L273 TraceCheckUtils]: 44: Hoare triple {14006#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14006#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:02,746 INFO L273 TraceCheckUtils]: 45: Hoare triple {14006#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14007#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:02,746 INFO L273 TraceCheckUtils]: 46: Hoare triple {14007#(<= main_~i~0 10)} assume true; {14007#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:02,746 INFO L273 TraceCheckUtils]: 47: Hoare triple {14007#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14007#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:02,747 INFO L273 TraceCheckUtils]: 48: Hoare triple {14007#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14007#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:02,747 INFO L273 TraceCheckUtils]: 49: Hoare triple {14007#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14008#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:02,747 INFO L273 TraceCheckUtils]: 50: Hoare triple {14008#(<= main_~i~0 11)} assume true; {14008#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:02,748 INFO L273 TraceCheckUtils]: 51: Hoare triple {14008#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14008#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:02,748 INFO L273 TraceCheckUtils]: 52: Hoare triple {14008#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14008#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:02,748 INFO L273 TraceCheckUtils]: 53: Hoare triple {14008#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14009#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:02,749 INFO L273 TraceCheckUtils]: 54: Hoare triple {14009#(<= main_~i~0 12)} assume true; {14009#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:02,749 INFO L273 TraceCheckUtils]: 55: Hoare triple {14009#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14009#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:02,749 INFO L273 TraceCheckUtils]: 56: Hoare triple {14009#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14009#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:02,750 INFO L273 TraceCheckUtils]: 57: Hoare triple {14009#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14010#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:02,751 INFO L273 TraceCheckUtils]: 58: Hoare triple {14010#(<= main_~i~0 13)} assume true; {14010#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:02,751 INFO L273 TraceCheckUtils]: 59: Hoare triple {14010#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14010#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:02,751 INFO L273 TraceCheckUtils]: 60: Hoare triple {14010#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14010#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:02,752 INFO L273 TraceCheckUtils]: 61: Hoare triple {14010#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14011#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:02,753 INFO L273 TraceCheckUtils]: 62: Hoare triple {14011#(<= main_~i~0 14)} assume true; {14011#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:02,753 INFO L273 TraceCheckUtils]: 63: Hoare triple {14011#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14011#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:02,754 INFO L273 TraceCheckUtils]: 64: Hoare triple {14011#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14011#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:02,754 INFO L273 TraceCheckUtils]: 65: Hoare triple {14011#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14012#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:02,755 INFO L273 TraceCheckUtils]: 66: Hoare triple {14012#(<= main_~i~0 15)} assume true; {14012#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:02,755 INFO L273 TraceCheckUtils]: 67: Hoare triple {14012#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14012#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:02,756 INFO L273 TraceCheckUtils]: 68: Hoare triple {14012#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14012#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:02,756 INFO L273 TraceCheckUtils]: 69: Hoare triple {14012#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14013#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:02,757 INFO L273 TraceCheckUtils]: 70: Hoare triple {14013#(<= main_~i~0 16)} assume true; {14013#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:02,757 INFO L273 TraceCheckUtils]: 71: Hoare triple {14013#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14013#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:02,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {14013#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14013#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:02,759 INFO L273 TraceCheckUtils]: 73: Hoare triple {14013#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14014#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:02,764 INFO L273 TraceCheckUtils]: 74: Hoare triple {14014#(<= main_~i~0 17)} assume true; {14014#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:02,764 INFO L273 TraceCheckUtils]: 75: Hoare triple {14014#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14014#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:02,764 INFO L273 TraceCheckUtils]: 76: Hoare triple {14014#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14014#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:02,765 INFO L273 TraceCheckUtils]: 77: Hoare triple {14014#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14015#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:02,765 INFO L273 TraceCheckUtils]: 78: Hoare triple {14015#(<= main_~i~0 18)} assume true; {14015#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:02,765 INFO L273 TraceCheckUtils]: 79: Hoare triple {14015#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14015#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:02,766 INFO L273 TraceCheckUtils]: 80: Hoare triple {14015#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14015#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:02,766 INFO L273 TraceCheckUtils]: 81: Hoare triple {14015#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14016#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:02,766 INFO L273 TraceCheckUtils]: 82: Hoare triple {14016#(<= main_~i~0 19)} assume true; {14016#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:02,767 INFO L273 TraceCheckUtils]: 83: Hoare triple {14016#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14016#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:02,767 INFO L273 TraceCheckUtils]: 84: Hoare triple {14016#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14016#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:02,767 INFO L273 TraceCheckUtils]: 85: Hoare triple {14016#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14017#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:02,768 INFO L273 TraceCheckUtils]: 86: Hoare triple {14017#(<= main_~i~0 20)} assume true; {14017#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:02,768 INFO L273 TraceCheckUtils]: 87: Hoare triple {14017#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14017#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:02,768 INFO L273 TraceCheckUtils]: 88: Hoare triple {14017#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14017#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:02,769 INFO L273 TraceCheckUtils]: 89: Hoare triple {14017#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14018#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:02,769 INFO L273 TraceCheckUtils]: 90: Hoare triple {14018#(<= main_~i~0 21)} assume true; {14018#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:02,770 INFO L273 TraceCheckUtils]: 91: Hoare triple {14018#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14018#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:02,770 INFO L273 TraceCheckUtils]: 92: Hoare triple {14018#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14018#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:02,771 INFO L273 TraceCheckUtils]: 93: Hoare triple {14018#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14019#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:02,771 INFO L273 TraceCheckUtils]: 94: Hoare triple {14019#(<= main_~i~0 22)} assume true; {14019#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:02,772 INFO L273 TraceCheckUtils]: 95: Hoare triple {14019#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14019#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:02,776 INFO L273 TraceCheckUtils]: 96: Hoare triple {14019#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14019#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:02,776 INFO L273 TraceCheckUtils]: 97: Hoare triple {14019#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {14020#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:02,777 INFO L273 TraceCheckUtils]: 98: Hoare triple {14020#(<= main_~i~0 23)} assume true; {14020#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:02,777 INFO L273 TraceCheckUtils]: 99: Hoare triple {14020#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14020#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:02,777 INFO L273 TraceCheckUtils]: 100: Hoare triple {14020#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14020#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:02,778 INFO L273 TraceCheckUtils]: 101: Hoare triple {14020#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {14021#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:02,778 INFO L273 TraceCheckUtils]: 102: Hoare triple {14021#(<= main_~i~0 24)} assume true; {14021#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:02,778 INFO L273 TraceCheckUtils]: 103: Hoare triple {14021#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14021#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:02,779 INFO L273 TraceCheckUtils]: 104: Hoare triple {14021#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14021#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:02,779 INFO L273 TraceCheckUtils]: 105: Hoare triple {14021#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {14022#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:02,779 INFO L273 TraceCheckUtils]: 106: Hoare triple {14022#(<= main_~i~0 25)} assume true; {14022#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:02,780 INFO L273 TraceCheckUtils]: 107: Hoare triple {14022#(<= main_~i~0 25)} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-18 22:57:02,780 INFO L273 TraceCheckUtils]: 108: Hoare triple {13996#false} havoc ~x~0;~x~0 := 0; {13996#false} is VALID [2018-11-18 22:57:02,780 INFO L273 TraceCheckUtils]: 109: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-18 22:57:02,780 INFO L273 TraceCheckUtils]: 110: Hoare triple {13996#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13996#false} is VALID [2018-11-18 22:57:02,780 INFO L256 TraceCheckUtils]: 111: Hoare triple {13996#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {13996#false} is VALID [2018-11-18 22:57:02,780 INFO L273 TraceCheckUtils]: 112: Hoare triple {13996#false} ~cond := #in~cond; {13996#false} is VALID [2018-11-18 22:57:02,781 INFO L273 TraceCheckUtils]: 113: Hoare triple {13996#false} assume 0 == ~cond; {13996#false} is VALID [2018-11-18 22:57:02,781 INFO L273 TraceCheckUtils]: 114: Hoare triple {13996#false} assume !false; {13996#false} is VALID [2018-11-18 22:57:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:02,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:02,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-18 22:57:02,811 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-18 22:57:02,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:02,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 22:57:02,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:02,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 22:57:02,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 22:57:02,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-18 22:57:02,945 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand 29 states. [2018-11-18 22:57:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:03,312 INFO L93 Difference]: Finished difference Result 138 states and 167 transitions. [2018-11-18 22:57:03,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 22:57:03,312 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-18 22:57:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:57:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 167 transitions. [2018-11-18 22:57:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:57:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 167 transitions. [2018-11-18 22:57:03,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 167 transitions. [2018-11-18 22:57:03,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:03,463 INFO L225 Difference]: With dead ends: 138 [2018-11-18 22:57:03,463 INFO L226 Difference]: Without dead ends: 126 [2018-11-18 22:57:03,464 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-18 22:57:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-18 22:57:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-11-18 22:57:03,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:03,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 124 states. [2018-11-18 22:57:03,510 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 124 states. [2018-11-18 22:57:03,511 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 124 states. [2018-11-18 22:57:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:03,513 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2018-11-18 22:57:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2018-11-18 22:57:03,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:03,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:03,514 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 126 states. [2018-11-18 22:57:03,514 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 126 states. [2018-11-18 22:57:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:03,516 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2018-11-18 22:57:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2018-11-18 22:57:03,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:03,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:03,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:03,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-18 22:57:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2018-11-18 22:57:03,519 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 115 [2018-11-18 22:57:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:03,519 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2018-11-18 22:57:03,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 22:57:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2018-11-18 22:57:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 22:57:03,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:03,521 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:03,521 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:03,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash 786090814, now seen corresponding path program 26 times [2018-11-18 22:57:03,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:03,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:03,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:03,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:03,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:04,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {14953#true} call ULTIMATE.init(); {14953#true} is VALID [2018-11-18 22:57:04,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {14953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14953#true} is VALID [2018-11-18 22:57:04,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {14953#true} assume true; {14953#true} is VALID [2018-11-18 22:57:04,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14953#true} {14953#true} #57#return; {14953#true} is VALID [2018-11-18 22:57:04,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {14953#true} call #t~ret4 := main(); {14953#true} is VALID [2018-11-18 22:57:04,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {14953#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {14955#(= main_~i~0 0)} is VALID [2018-11-18 22:57:04,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {14955#(= main_~i~0 0)} assume true; {14955#(= main_~i~0 0)} is VALID [2018-11-18 22:57:04,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {14955#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14955#(= main_~i~0 0)} is VALID [2018-11-18 22:57:04,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {14955#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14955#(= main_~i~0 0)} is VALID [2018-11-18 22:57:04,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {14955#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {14956#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {14956#(<= main_~i~0 1)} assume true; {14956#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {14956#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14956#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {14956#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14956#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {14956#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {14957#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:04,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {14957#(<= main_~i~0 2)} assume true; {14957#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:04,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {14957#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14957#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:04,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {14957#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14957#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:04,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {14957#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14958#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:04,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {14958#(<= main_~i~0 3)} assume true; {14958#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:04,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {14958#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14958#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:04,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {14958#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14958#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:04,532 INFO L273 TraceCheckUtils]: 21: Hoare triple {14958#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14959#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:04,533 INFO L273 TraceCheckUtils]: 22: Hoare triple {14959#(<= main_~i~0 4)} assume true; {14959#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:04,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {14959#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14959#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:04,534 INFO L273 TraceCheckUtils]: 24: Hoare triple {14959#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14959#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:04,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {14959#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14960#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:04,535 INFO L273 TraceCheckUtils]: 26: Hoare triple {14960#(<= main_~i~0 5)} assume true; {14960#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:04,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {14960#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14960#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:04,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {14960#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14960#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:04,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {14960#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14961#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:04,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {14961#(<= main_~i~0 6)} assume true; {14961#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:04,538 INFO L273 TraceCheckUtils]: 31: Hoare triple {14961#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14961#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:04,538 INFO L273 TraceCheckUtils]: 32: Hoare triple {14961#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14961#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:04,539 INFO L273 TraceCheckUtils]: 33: Hoare triple {14961#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14962#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:04,539 INFO L273 TraceCheckUtils]: 34: Hoare triple {14962#(<= main_~i~0 7)} assume true; {14962#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:04,540 INFO L273 TraceCheckUtils]: 35: Hoare triple {14962#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14962#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:04,540 INFO L273 TraceCheckUtils]: 36: Hoare triple {14962#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14962#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:04,541 INFO L273 TraceCheckUtils]: 37: Hoare triple {14962#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14963#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:04,542 INFO L273 TraceCheckUtils]: 38: Hoare triple {14963#(<= main_~i~0 8)} assume true; {14963#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:04,542 INFO L273 TraceCheckUtils]: 39: Hoare triple {14963#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14963#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:04,543 INFO L273 TraceCheckUtils]: 40: Hoare triple {14963#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14963#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:04,543 INFO L273 TraceCheckUtils]: 41: Hoare triple {14963#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14964#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:04,553 INFO L273 TraceCheckUtils]: 42: Hoare triple {14964#(<= main_~i~0 9)} assume true; {14964#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:04,553 INFO L273 TraceCheckUtils]: 43: Hoare triple {14964#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14964#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:04,554 INFO L273 TraceCheckUtils]: 44: Hoare triple {14964#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14964#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:04,554 INFO L273 TraceCheckUtils]: 45: Hoare triple {14964#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14965#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:04,574 INFO L273 TraceCheckUtils]: 46: Hoare triple {14965#(<= main_~i~0 10)} assume true; {14965#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:04,587 INFO L273 TraceCheckUtils]: 47: Hoare triple {14965#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14965#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:04,596 INFO L273 TraceCheckUtils]: 48: Hoare triple {14965#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14965#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:04,610 INFO L273 TraceCheckUtils]: 49: Hoare triple {14965#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14966#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:04,619 INFO L273 TraceCheckUtils]: 50: Hoare triple {14966#(<= main_~i~0 11)} assume true; {14966#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:04,632 INFO L273 TraceCheckUtils]: 51: Hoare triple {14966#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14966#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:04,634 INFO L273 TraceCheckUtils]: 52: Hoare triple {14966#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14966#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:04,634 INFO L273 TraceCheckUtils]: 53: Hoare triple {14966#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14967#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:04,636 INFO L273 TraceCheckUtils]: 54: Hoare triple {14967#(<= main_~i~0 12)} assume true; {14967#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:04,636 INFO L273 TraceCheckUtils]: 55: Hoare triple {14967#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14967#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:04,636 INFO L273 TraceCheckUtils]: 56: Hoare triple {14967#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14967#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:04,637 INFO L273 TraceCheckUtils]: 57: Hoare triple {14967#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14968#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:04,637 INFO L273 TraceCheckUtils]: 58: Hoare triple {14968#(<= main_~i~0 13)} assume true; {14968#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:04,637 INFO L273 TraceCheckUtils]: 59: Hoare triple {14968#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14968#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:04,638 INFO L273 TraceCheckUtils]: 60: Hoare triple {14968#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14968#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:04,638 INFO L273 TraceCheckUtils]: 61: Hoare triple {14968#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14969#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:04,638 INFO L273 TraceCheckUtils]: 62: Hoare triple {14969#(<= main_~i~0 14)} assume true; {14969#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:04,639 INFO L273 TraceCheckUtils]: 63: Hoare triple {14969#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14969#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:04,639 INFO L273 TraceCheckUtils]: 64: Hoare triple {14969#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14969#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:04,639 INFO L273 TraceCheckUtils]: 65: Hoare triple {14969#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14970#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:04,640 INFO L273 TraceCheckUtils]: 66: Hoare triple {14970#(<= main_~i~0 15)} assume true; {14970#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:04,640 INFO L273 TraceCheckUtils]: 67: Hoare triple {14970#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14970#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:04,641 INFO L273 TraceCheckUtils]: 68: Hoare triple {14970#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14970#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:04,641 INFO L273 TraceCheckUtils]: 69: Hoare triple {14970#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14971#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:04,642 INFO L273 TraceCheckUtils]: 70: Hoare triple {14971#(<= main_~i~0 16)} assume true; {14971#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:04,642 INFO L273 TraceCheckUtils]: 71: Hoare triple {14971#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14971#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:04,643 INFO L273 TraceCheckUtils]: 72: Hoare triple {14971#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14971#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:04,644 INFO L273 TraceCheckUtils]: 73: Hoare triple {14971#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14972#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:04,644 INFO L273 TraceCheckUtils]: 74: Hoare triple {14972#(<= main_~i~0 17)} assume true; {14972#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:04,645 INFO L273 TraceCheckUtils]: 75: Hoare triple {14972#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14972#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:04,645 INFO L273 TraceCheckUtils]: 76: Hoare triple {14972#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14972#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:04,646 INFO L273 TraceCheckUtils]: 77: Hoare triple {14972#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14973#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:04,646 INFO L273 TraceCheckUtils]: 78: Hoare triple {14973#(<= main_~i~0 18)} assume true; {14973#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:04,647 INFO L273 TraceCheckUtils]: 79: Hoare triple {14973#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14973#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:04,647 INFO L273 TraceCheckUtils]: 80: Hoare triple {14973#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14973#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:04,648 INFO L273 TraceCheckUtils]: 81: Hoare triple {14973#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14974#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:04,649 INFO L273 TraceCheckUtils]: 82: Hoare triple {14974#(<= main_~i~0 19)} assume true; {14974#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:04,649 INFO L273 TraceCheckUtils]: 83: Hoare triple {14974#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14974#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:04,650 INFO L273 TraceCheckUtils]: 84: Hoare triple {14974#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14974#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:04,651 INFO L273 TraceCheckUtils]: 85: Hoare triple {14974#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14975#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:04,651 INFO L273 TraceCheckUtils]: 86: Hoare triple {14975#(<= main_~i~0 20)} assume true; {14975#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:04,652 INFO L273 TraceCheckUtils]: 87: Hoare triple {14975#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14975#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:04,652 INFO L273 TraceCheckUtils]: 88: Hoare triple {14975#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14975#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:04,653 INFO L273 TraceCheckUtils]: 89: Hoare triple {14975#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14976#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:04,653 INFO L273 TraceCheckUtils]: 90: Hoare triple {14976#(<= main_~i~0 21)} assume true; {14976#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:04,654 INFO L273 TraceCheckUtils]: 91: Hoare triple {14976#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14976#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:04,654 INFO L273 TraceCheckUtils]: 92: Hoare triple {14976#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14976#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:04,655 INFO L273 TraceCheckUtils]: 93: Hoare triple {14976#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14977#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:04,656 INFO L273 TraceCheckUtils]: 94: Hoare triple {14977#(<= main_~i~0 22)} assume true; {14977#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:04,656 INFO L273 TraceCheckUtils]: 95: Hoare triple {14977#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14977#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:04,657 INFO L273 TraceCheckUtils]: 96: Hoare triple {14977#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14977#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:04,657 INFO L273 TraceCheckUtils]: 97: Hoare triple {14977#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {14978#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:04,658 INFO L273 TraceCheckUtils]: 98: Hoare triple {14978#(<= main_~i~0 23)} assume true; {14978#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:04,658 INFO L273 TraceCheckUtils]: 99: Hoare triple {14978#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14978#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:04,659 INFO L273 TraceCheckUtils]: 100: Hoare triple {14978#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14978#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:04,660 INFO L273 TraceCheckUtils]: 101: Hoare triple {14978#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {14979#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:04,660 INFO L273 TraceCheckUtils]: 102: Hoare triple {14979#(<= main_~i~0 24)} assume true; {14979#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:04,661 INFO L273 TraceCheckUtils]: 103: Hoare triple {14979#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14979#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:04,661 INFO L273 TraceCheckUtils]: 104: Hoare triple {14979#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14979#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:04,662 INFO L273 TraceCheckUtils]: 105: Hoare triple {14979#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {14980#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:04,662 INFO L273 TraceCheckUtils]: 106: Hoare triple {14980#(<= main_~i~0 25)} assume true; {14980#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:04,663 INFO L273 TraceCheckUtils]: 107: Hoare triple {14980#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14980#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:04,663 INFO L273 TraceCheckUtils]: 108: Hoare triple {14980#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14980#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:04,664 INFO L273 TraceCheckUtils]: 109: Hoare triple {14980#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {14981#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:04,665 INFO L273 TraceCheckUtils]: 110: Hoare triple {14981#(<= main_~i~0 26)} assume true; {14981#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:04,665 INFO L273 TraceCheckUtils]: 111: Hoare triple {14981#(<= main_~i~0 26)} assume !(~i~0 < 100000); {14954#false} is VALID [2018-11-18 22:57:04,665 INFO L273 TraceCheckUtils]: 112: Hoare triple {14954#false} havoc ~x~0;~x~0 := 0; {14954#false} is VALID [2018-11-18 22:57:04,666 INFO L273 TraceCheckUtils]: 113: Hoare triple {14954#false} assume true; {14954#false} is VALID [2018-11-18 22:57:04,666 INFO L273 TraceCheckUtils]: 114: Hoare triple {14954#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14954#false} is VALID [2018-11-18 22:57:04,666 INFO L256 TraceCheckUtils]: 115: Hoare triple {14954#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {14954#false} is VALID [2018-11-18 22:57:04,666 INFO L273 TraceCheckUtils]: 116: Hoare triple {14954#false} ~cond := #in~cond; {14954#false} is VALID [2018-11-18 22:57:04,666 INFO L273 TraceCheckUtils]: 117: Hoare triple {14954#false} assume 0 == ~cond; {14954#false} is VALID [2018-11-18 22:57:04,667 INFO L273 TraceCheckUtils]: 118: Hoare triple {14954#false} assume !false; {14954#false} is VALID [2018-11-18 22:57:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:04,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:04,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:04,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:57:04,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:57:04,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:04,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:04,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {14953#true} call ULTIMATE.init(); {14953#true} is VALID [2018-11-18 22:57:04,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {14953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14953#true} is VALID [2018-11-18 22:57:04,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {14953#true} assume true; {14953#true} is VALID [2018-11-18 22:57:04,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14953#true} {14953#true} #57#return; {14953#true} is VALID [2018-11-18 22:57:04,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {14953#true} call #t~ret4 := main(); {14953#true} is VALID [2018-11-18 22:57:04,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {14953#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {15000#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:04,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {15000#(<= main_~i~0 0)} assume true; {15000#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:04,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {15000#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15000#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:04,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {15000#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15000#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:04,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {15000#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {14956#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {14956#(<= main_~i~0 1)} assume true; {14956#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {14956#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14956#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {14956#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14956#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:05,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {14956#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {14957#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {14957#(<= main_~i~0 2)} assume true; {14957#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {14957#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14957#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {14957#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14957#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,020 INFO L273 TraceCheckUtils]: 17: Hoare triple {14957#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14958#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {14958#(<= main_~i~0 3)} assume true; {14958#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {14958#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14958#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {14958#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14958#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {14958#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14959#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {14959#(<= main_~i~0 4)} assume true; {14959#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {14959#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14959#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {14959#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14959#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {14959#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14960#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {14960#(<= main_~i~0 5)} assume true; {14960#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {14960#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14960#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {14960#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14960#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {14960#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14961#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {14961#(<= main_~i~0 6)} assume true; {14961#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,025 INFO L273 TraceCheckUtils]: 31: Hoare triple {14961#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14961#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {14961#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14961#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {14961#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14962#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,027 INFO L273 TraceCheckUtils]: 34: Hoare triple {14962#(<= main_~i~0 7)} assume true; {14962#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {14962#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14962#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,028 INFO L273 TraceCheckUtils]: 36: Hoare triple {14962#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14962#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,029 INFO L273 TraceCheckUtils]: 37: Hoare triple {14962#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14963#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,029 INFO L273 TraceCheckUtils]: 38: Hoare triple {14963#(<= main_~i~0 8)} assume true; {14963#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,030 INFO L273 TraceCheckUtils]: 39: Hoare triple {14963#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14963#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,030 INFO L273 TraceCheckUtils]: 40: Hoare triple {14963#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14963#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {14963#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14964#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,032 INFO L273 TraceCheckUtils]: 42: Hoare triple {14964#(<= main_~i~0 9)} assume true; {14964#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,050 INFO L273 TraceCheckUtils]: 43: Hoare triple {14964#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14964#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,059 INFO L273 TraceCheckUtils]: 44: Hoare triple {14964#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14964#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,072 INFO L273 TraceCheckUtils]: 45: Hoare triple {14964#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14965#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,080 INFO L273 TraceCheckUtils]: 46: Hoare triple {14965#(<= main_~i~0 10)} assume true; {14965#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,094 INFO L273 TraceCheckUtils]: 47: Hoare triple {14965#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14965#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,102 INFO L273 TraceCheckUtils]: 48: Hoare triple {14965#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14965#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,111 INFO L273 TraceCheckUtils]: 49: Hoare triple {14965#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14966#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,112 INFO L273 TraceCheckUtils]: 50: Hoare triple {14966#(<= main_~i~0 11)} assume true; {14966#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,117 INFO L273 TraceCheckUtils]: 51: Hoare triple {14966#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14966#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,117 INFO L273 TraceCheckUtils]: 52: Hoare triple {14966#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14966#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,120 INFO L273 TraceCheckUtils]: 53: Hoare triple {14966#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14967#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,120 INFO L273 TraceCheckUtils]: 54: Hoare triple {14967#(<= main_~i~0 12)} assume true; {14967#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,120 INFO L273 TraceCheckUtils]: 55: Hoare triple {14967#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14967#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,121 INFO L273 TraceCheckUtils]: 56: Hoare triple {14967#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14967#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,121 INFO L273 TraceCheckUtils]: 57: Hoare triple {14967#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14968#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,121 INFO L273 TraceCheckUtils]: 58: Hoare triple {14968#(<= main_~i~0 13)} assume true; {14968#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,122 INFO L273 TraceCheckUtils]: 59: Hoare triple {14968#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14968#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,122 INFO L273 TraceCheckUtils]: 60: Hoare triple {14968#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14968#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,122 INFO L273 TraceCheckUtils]: 61: Hoare triple {14968#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14969#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,123 INFO L273 TraceCheckUtils]: 62: Hoare triple {14969#(<= main_~i~0 14)} assume true; {14969#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,123 INFO L273 TraceCheckUtils]: 63: Hoare triple {14969#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14969#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,123 INFO L273 TraceCheckUtils]: 64: Hoare triple {14969#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14969#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,124 INFO L273 TraceCheckUtils]: 65: Hoare triple {14969#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14970#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,124 INFO L273 TraceCheckUtils]: 66: Hoare triple {14970#(<= main_~i~0 15)} assume true; {14970#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,124 INFO L273 TraceCheckUtils]: 67: Hoare triple {14970#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14970#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,125 INFO L273 TraceCheckUtils]: 68: Hoare triple {14970#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14970#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,125 INFO L273 TraceCheckUtils]: 69: Hoare triple {14970#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14971#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:05,126 INFO L273 TraceCheckUtils]: 70: Hoare triple {14971#(<= main_~i~0 16)} assume true; {14971#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:05,126 INFO L273 TraceCheckUtils]: 71: Hoare triple {14971#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14971#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:05,127 INFO L273 TraceCheckUtils]: 72: Hoare triple {14971#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14971#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:05,127 INFO L273 TraceCheckUtils]: 73: Hoare triple {14971#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14972#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:05,128 INFO L273 TraceCheckUtils]: 74: Hoare triple {14972#(<= main_~i~0 17)} assume true; {14972#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:05,128 INFO L273 TraceCheckUtils]: 75: Hoare triple {14972#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14972#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:05,129 INFO L273 TraceCheckUtils]: 76: Hoare triple {14972#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14972#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:05,129 INFO L273 TraceCheckUtils]: 77: Hoare triple {14972#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14973#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:05,130 INFO L273 TraceCheckUtils]: 78: Hoare triple {14973#(<= main_~i~0 18)} assume true; {14973#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:05,130 INFO L273 TraceCheckUtils]: 79: Hoare triple {14973#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14973#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:05,131 INFO L273 TraceCheckUtils]: 80: Hoare triple {14973#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14973#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:05,132 INFO L273 TraceCheckUtils]: 81: Hoare triple {14973#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14974#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:05,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {14974#(<= main_~i~0 19)} assume true; {14974#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:05,132 INFO L273 TraceCheckUtils]: 83: Hoare triple {14974#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14974#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:05,133 INFO L273 TraceCheckUtils]: 84: Hoare triple {14974#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14974#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:05,134 INFO L273 TraceCheckUtils]: 85: Hoare triple {14974#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14975#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:05,134 INFO L273 TraceCheckUtils]: 86: Hoare triple {14975#(<= main_~i~0 20)} assume true; {14975#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:05,135 INFO L273 TraceCheckUtils]: 87: Hoare triple {14975#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14975#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:05,135 INFO L273 TraceCheckUtils]: 88: Hoare triple {14975#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14975#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:05,136 INFO L273 TraceCheckUtils]: 89: Hoare triple {14975#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14976#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:05,136 INFO L273 TraceCheckUtils]: 90: Hoare triple {14976#(<= main_~i~0 21)} assume true; {14976#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:05,137 INFO L273 TraceCheckUtils]: 91: Hoare triple {14976#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14976#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:05,137 INFO L273 TraceCheckUtils]: 92: Hoare triple {14976#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14976#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:05,138 INFO L273 TraceCheckUtils]: 93: Hoare triple {14976#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14977#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:05,138 INFO L273 TraceCheckUtils]: 94: Hoare triple {14977#(<= main_~i~0 22)} assume true; {14977#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:05,139 INFO L273 TraceCheckUtils]: 95: Hoare triple {14977#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14977#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:05,139 INFO L273 TraceCheckUtils]: 96: Hoare triple {14977#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14977#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:05,140 INFO L273 TraceCheckUtils]: 97: Hoare triple {14977#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {14978#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:05,140 INFO L273 TraceCheckUtils]: 98: Hoare triple {14978#(<= main_~i~0 23)} assume true; {14978#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:05,141 INFO L273 TraceCheckUtils]: 99: Hoare triple {14978#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14978#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:05,141 INFO L273 TraceCheckUtils]: 100: Hoare triple {14978#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14978#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:05,142 INFO L273 TraceCheckUtils]: 101: Hoare triple {14978#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {14979#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:05,143 INFO L273 TraceCheckUtils]: 102: Hoare triple {14979#(<= main_~i~0 24)} assume true; {14979#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:05,143 INFO L273 TraceCheckUtils]: 103: Hoare triple {14979#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14979#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:05,144 INFO L273 TraceCheckUtils]: 104: Hoare triple {14979#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14979#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:05,144 INFO L273 TraceCheckUtils]: 105: Hoare triple {14979#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {14980#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:05,145 INFO L273 TraceCheckUtils]: 106: Hoare triple {14980#(<= main_~i~0 25)} assume true; {14980#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:05,145 INFO L273 TraceCheckUtils]: 107: Hoare triple {14980#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14980#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:05,146 INFO L273 TraceCheckUtils]: 108: Hoare triple {14980#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14980#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:05,147 INFO L273 TraceCheckUtils]: 109: Hoare triple {14980#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {14981#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:05,147 INFO L273 TraceCheckUtils]: 110: Hoare triple {14981#(<= main_~i~0 26)} assume true; {14981#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:05,148 INFO L273 TraceCheckUtils]: 111: Hoare triple {14981#(<= main_~i~0 26)} assume !(~i~0 < 100000); {14954#false} is VALID [2018-11-18 22:57:05,148 INFO L273 TraceCheckUtils]: 112: Hoare triple {14954#false} havoc ~x~0;~x~0 := 0; {14954#false} is VALID [2018-11-18 22:57:05,148 INFO L273 TraceCheckUtils]: 113: Hoare triple {14954#false} assume true; {14954#false} is VALID [2018-11-18 22:57:05,148 INFO L273 TraceCheckUtils]: 114: Hoare triple {14954#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14954#false} is VALID [2018-11-18 22:57:05,148 INFO L256 TraceCheckUtils]: 115: Hoare triple {14954#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {14954#false} is VALID [2018-11-18 22:57:05,149 INFO L273 TraceCheckUtils]: 116: Hoare triple {14954#false} ~cond := #in~cond; {14954#false} is VALID [2018-11-18 22:57:05,149 INFO L273 TraceCheckUtils]: 117: Hoare triple {14954#false} assume 0 == ~cond; {14954#false} is VALID [2018-11-18 22:57:05,149 INFO L273 TraceCheckUtils]: 118: Hoare triple {14954#false} assume !false; {14954#false} is VALID [2018-11-18 22:57:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:05,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:05,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-18 22:57:05,179 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2018-11-18 22:57:05,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:05,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-18 22:57:05,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:05,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 22:57:05,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 22:57:05,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:57:05,291 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand 30 states. [2018-11-18 22:57:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:05,663 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2018-11-18 22:57:05,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 22:57:05,663 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2018-11-18 22:57:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:57:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 172 transitions. [2018-11-18 22:57:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:57:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 172 transitions. [2018-11-18 22:57:05,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 172 transitions. [2018-11-18 22:57:05,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:05,895 INFO L225 Difference]: With dead ends: 142 [2018-11-18 22:57:05,895 INFO L226 Difference]: Without dead ends: 130 [2018-11-18 22:57:05,896 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:57:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-18 22:57:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-11-18 22:57:05,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:05,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 128 states. [2018-11-18 22:57:05,957 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 128 states. [2018-11-18 22:57:05,957 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 128 states. [2018-11-18 22:57:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:05,959 INFO L93 Difference]: Finished difference Result 130 states and 159 transitions. [2018-11-18 22:57:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2018-11-18 22:57:05,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:05,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:05,960 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 130 states. [2018-11-18 22:57:05,960 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 130 states. [2018-11-18 22:57:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:05,962 INFO L93 Difference]: Finished difference Result 130 states and 159 transitions. [2018-11-18 22:57:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2018-11-18 22:57:05,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:05,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:05,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:05,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 22:57:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2018-11-18 22:57:05,965 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 119 [2018-11-18 22:57:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:05,966 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2018-11-18 22:57:05,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 22:57:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2018-11-18 22:57:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-18 22:57:05,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:05,967 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:05,967 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:05,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:05,967 INFO L82 PathProgramCache]: Analyzing trace with hash -100034412, now seen corresponding path program 27 times [2018-11-18 22:57:05,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:05,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:05,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:05,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:05,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:06,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {15942#true} call ULTIMATE.init(); {15942#true} is VALID [2018-11-18 22:57:06,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {15942#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15942#true} is VALID [2018-11-18 22:57:06,431 INFO L273 TraceCheckUtils]: 2: Hoare triple {15942#true} assume true; {15942#true} is VALID [2018-11-18 22:57:06,431 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15942#true} {15942#true} #57#return; {15942#true} is VALID [2018-11-18 22:57:06,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {15942#true} call #t~ret4 := main(); {15942#true} is VALID [2018-11-18 22:57:06,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {15942#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {15944#(= main_~i~0 0)} is VALID [2018-11-18 22:57:06,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {15944#(= main_~i~0 0)} assume true; {15944#(= main_~i~0 0)} is VALID [2018-11-18 22:57:06,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {15944#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15944#(= main_~i~0 0)} is VALID [2018-11-18 22:57:06,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {15944#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15944#(= main_~i~0 0)} is VALID [2018-11-18 22:57:06,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {15944#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {15945#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:06,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {15945#(<= main_~i~0 1)} assume true; {15945#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:06,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {15945#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15945#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:06,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {15945#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15945#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:06,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {15945#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15946#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:06,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {15946#(<= main_~i~0 2)} assume true; {15946#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:06,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {15946#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15946#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:06,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {15946#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15946#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:06,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {15946#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15947#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:06,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {15947#(<= main_~i~0 3)} assume true; {15947#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:06,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {15947#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15947#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:06,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {15947#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15947#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:06,439 INFO L273 TraceCheckUtils]: 21: Hoare triple {15947#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15948#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:06,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {15948#(<= main_~i~0 4)} assume true; {15948#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:06,440 INFO L273 TraceCheckUtils]: 23: Hoare triple {15948#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15948#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:06,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {15948#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15948#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:06,441 INFO L273 TraceCheckUtils]: 25: Hoare triple {15948#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15949#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:06,442 INFO L273 TraceCheckUtils]: 26: Hoare triple {15949#(<= main_~i~0 5)} assume true; {15949#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:06,442 INFO L273 TraceCheckUtils]: 27: Hoare triple {15949#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15949#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:06,443 INFO L273 TraceCheckUtils]: 28: Hoare triple {15949#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15949#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:06,443 INFO L273 TraceCheckUtils]: 29: Hoare triple {15949#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15950#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:06,444 INFO L273 TraceCheckUtils]: 30: Hoare triple {15950#(<= main_~i~0 6)} assume true; {15950#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:06,444 INFO L273 TraceCheckUtils]: 31: Hoare triple {15950#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15950#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:06,445 INFO L273 TraceCheckUtils]: 32: Hoare triple {15950#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15950#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:06,446 INFO L273 TraceCheckUtils]: 33: Hoare triple {15950#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15951#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:06,446 INFO L273 TraceCheckUtils]: 34: Hoare triple {15951#(<= main_~i~0 7)} assume true; {15951#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:06,447 INFO L273 TraceCheckUtils]: 35: Hoare triple {15951#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15951#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:06,447 INFO L273 TraceCheckUtils]: 36: Hoare triple {15951#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15951#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:06,448 INFO L273 TraceCheckUtils]: 37: Hoare triple {15951#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15952#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:06,448 INFO L273 TraceCheckUtils]: 38: Hoare triple {15952#(<= main_~i~0 8)} assume true; {15952#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:06,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {15952#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15952#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:06,449 INFO L273 TraceCheckUtils]: 40: Hoare triple {15952#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15952#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:06,450 INFO L273 TraceCheckUtils]: 41: Hoare triple {15952#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15953#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:06,451 INFO L273 TraceCheckUtils]: 42: Hoare triple {15953#(<= main_~i~0 9)} assume true; {15953#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:06,451 INFO L273 TraceCheckUtils]: 43: Hoare triple {15953#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15953#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:06,452 INFO L273 TraceCheckUtils]: 44: Hoare triple {15953#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15953#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:06,452 INFO L273 TraceCheckUtils]: 45: Hoare triple {15953#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15954#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:06,453 INFO L273 TraceCheckUtils]: 46: Hoare triple {15954#(<= main_~i~0 10)} assume true; {15954#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:06,453 INFO L273 TraceCheckUtils]: 47: Hoare triple {15954#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15954#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:06,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {15954#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15954#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:06,455 INFO L273 TraceCheckUtils]: 49: Hoare triple {15954#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15955#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:06,455 INFO L273 TraceCheckUtils]: 50: Hoare triple {15955#(<= main_~i~0 11)} assume true; {15955#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:06,456 INFO L273 TraceCheckUtils]: 51: Hoare triple {15955#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15955#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:06,456 INFO L273 TraceCheckUtils]: 52: Hoare triple {15955#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15955#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:06,457 INFO L273 TraceCheckUtils]: 53: Hoare triple {15955#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15956#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:06,457 INFO L273 TraceCheckUtils]: 54: Hoare triple {15956#(<= main_~i~0 12)} assume true; {15956#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:06,458 INFO L273 TraceCheckUtils]: 55: Hoare triple {15956#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15956#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:06,458 INFO L273 TraceCheckUtils]: 56: Hoare triple {15956#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15956#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:06,459 INFO L273 TraceCheckUtils]: 57: Hoare triple {15956#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15957#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:06,459 INFO L273 TraceCheckUtils]: 58: Hoare triple {15957#(<= main_~i~0 13)} assume true; {15957#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:06,460 INFO L273 TraceCheckUtils]: 59: Hoare triple {15957#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15957#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:06,460 INFO L273 TraceCheckUtils]: 60: Hoare triple {15957#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15957#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:06,461 INFO L273 TraceCheckUtils]: 61: Hoare triple {15957#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15958#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:06,462 INFO L273 TraceCheckUtils]: 62: Hoare triple {15958#(<= main_~i~0 14)} assume true; {15958#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:06,462 INFO L273 TraceCheckUtils]: 63: Hoare triple {15958#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15958#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:06,463 INFO L273 TraceCheckUtils]: 64: Hoare triple {15958#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15958#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:06,463 INFO L273 TraceCheckUtils]: 65: Hoare triple {15958#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {15959#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:06,464 INFO L273 TraceCheckUtils]: 66: Hoare triple {15959#(<= main_~i~0 15)} assume true; {15959#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:06,464 INFO L273 TraceCheckUtils]: 67: Hoare triple {15959#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15959#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:06,465 INFO L273 TraceCheckUtils]: 68: Hoare triple {15959#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15959#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:06,466 INFO L273 TraceCheckUtils]: 69: Hoare triple {15959#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {15960#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:06,466 INFO L273 TraceCheckUtils]: 70: Hoare triple {15960#(<= main_~i~0 16)} assume true; {15960#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:06,467 INFO L273 TraceCheckUtils]: 71: Hoare triple {15960#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15960#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:06,467 INFO L273 TraceCheckUtils]: 72: Hoare triple {15960#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15960#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:06,468 INFO L273 TraceCheckUtils]: 73: Hoare triple {15960#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {15961#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:06,468 INFO L273 TraceCheckUtils]: 74: Hoare triple {15961#(<= main_~i~0 17)} assume true; {15961#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:06,469 INFO L273 TraceCheckUtils]: 75: Hoare triple {15961#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15961#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:06,469 INFO L273 TraceCheckUtils]: 76: Hoare triple {15961#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15961#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:06,470 INFO L273 TraceCheckUtils]: 77: Hoare triple {15961#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {15962#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:06,471 INFO L273 TraceCheckUtils]: 78: Hoare triple {15962#(<= main_~i~0 18)} assume true; {15962#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:06,471 INFO L273 TraceCheckUtils]: 79: Hoare triple {15962#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15962#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:06,472 INFO L273 TraceCheckUtils]: 80: Hoare triple {15962#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15962#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:06,472 INFO L273 TraceCheckUtils]: 81: Hoare triple {15962#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {15963#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:06,473 INFO L273 TraceCheckUtils]: 82: Hoare triple {15963#(<= main_~i~0 19)} assume true; {15963#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:06,473 INFO L273 TraceCheckUtils]: 83: Hoare triple {15963#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15963#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:06,474 INFO L273 TraceCheckUtils]: 84: Hoare triple {15963#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15963#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:06,475 INFO L273 TraceCheckUtils]: 85: Hoare triple {15963#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {15964#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:06,475 INFO L273 TraceCheckUtils]: 86: Hoare triple {15964#(<= main_~i~0 20)} assume true; {15964#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:06,476 INFO L273 TraceCheckUtils]: 87: Hoare triple {15964#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15964#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:06,476 INFO L273 TraceCheckUtils]: 88: Hoare triple {15964#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15964#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:06,477 INFO L273 TraceCheckUtils]: 89: Hoare triple {15964#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {15965#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:06,477 INFO L273 TraceCheckUtils]: 90: Hoare triple {15965#(<= main_~i~0 21)} assume true; {15965#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:06,478 INFO L273 TraceCheckUtils]: 91: Hoare triple {15965#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15965#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:06,478 INFO L273 TraceCheckUtils]: 92: Hoare triple {15965#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15965#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:06,479 INFO L273 TraceCheckUtils]: 93: Hoare triple {15965#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {15966#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:06,479 INFO L273 TraceCheckUtils]: 94: Hoare triple {15966#(<= main_~i~0 22)} assume true; {15966#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:06,480 INFO L273 TraceCheckUtils]: 95: Hoare triple {15966#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15966#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:06,480 INFO L273 TraceCheckUtils]: 96: Hoare triple {15966#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15966#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:06,481 INFO L273 TraceCheckUtils]: 97: Hoare triple {15966#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {15967#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:06,482 INFO L273 TraceCheckUtils]: 98: Hoare triple {15967#(<= main_~i~0 23)} assume true; {15967#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:06,482 INFO L273 TraceCheckUtils]: 99: Hoare triple {15967#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15967#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:06,483 INFO L273 TraceCheckUtils]: 100: Hoare triple {15967#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15967#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:06,483 INFO L273 TraceCheckUtils]: 101: Hoare triple {15967#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {15968#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:06,484 INFO L273 TraceCheckUtils]: 102: Hoare triple {15968#(<= main_~i~0 24)} assume true; {15968#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:06,484 INFO L273 TraceCheckUtils]: 103: Hoare triple {15968#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15968#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:06,485 INFO L273 TraceCheckUtils]: 104: Hoare triple {15968#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15968#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:06,486 INFO L273 TraceCheckUtils]: 105: Hoare triple {15968#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {15969#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:06,486 INFO L273 TraceCheckUtils]: 106: Hoare triple {15969#(<= main_~i~0 25)} assume true; {15969#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:06,487 INFO L273 TraceCheckUtils]: 107: Hoare triple {15969#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15969#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:06,487 INFO L273 TraceCheckUtils]: 108: Hoare triple {15969#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15969#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:06,488 INFO L273 TraceCheckUtils]: 109: Hoare triple {15969#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {15970#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:06,488 INFO L273 TraceCheckUtils]: 110: Hoare triple {15970#(<= main_~i~0 26)} assume true; {15970#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:06,489 INFO L273 TraceCheckUtils]: 111: Hoare triple {15970#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15970#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:06,489 INFO L273 TraceCheckUtils]: 112: Hoare triple {15970#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15970#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:06,490 INFO L273 TraceCheckUtils]: 113: Hoare triple {15970#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {15971#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:06,491 INFO L273 TraceCheckUtils]: 114: Hoare triple {15971#(<= main_~i~0 27)} assume true; {15971#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:06,491 INFO L273 TraceCheckUtils]: 115: Hoare triple {15971#(<= main_~i~0 27)} assume !(~i~0 < 100000); {15943#false} is VALID [2018-11-18 22:57:06,491 INFO L273 TraceCheckUtils]: 116: Hoare triple {15943#false} havoc ~x~0;~x~0 := 0; {15943#false} is VALID [2018-11-18 22:57:06,492 INFO L273 TraceCheckUtils]: 117: Hoare triple {15943#false} assume true; {15943#false} is VALID [2018-11-18 22:57:06,492 INFO L273 TraceCheckUtils]: 118: Hoare triple {15943#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15943#false} is VALID [2018-11-18 22:57:06,492 INFO L256 TraceCheckUtils]: 119: Hoare triple {15943#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {15943#false} is VALID [2018-11-18 22:57:06,492 INFO L273 TraceCheckUtils]: 120: Hoare triple {15943#false} ~cond := #in~cond; {15943#false} is VALID [2018-11-18 22:57:06,492 INFO L273 TraceCheckUtils]: 121: Hoare triple {15943#false} assume 0 == ~cond; {15943#false} is VALID [2018-11-18 22:57:06,493 INFO L273 TraceCheckUtils]: 122: Hoare triple {15943#false} assume !false; {15943#false} is VALID [2018-11-18 22:57:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:06,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:06,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:06,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:57:06,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-18 22:57:06,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:06,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:06,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {15942#true} call ULTIMATE.init(); {15942#true} is VALID [2018-11-18 22:57:06,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {15942#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15942#true} is VALID [2018-11-18 22:57:06,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {15942#true} assume true; {15942#true} is VALID [2018-11-18 22:57:06,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15942#true} {15942#true} #57#return; {15942#true} is VALID [2018-11-18 22:57:06,857 INFO L256 TraceCheckUtils]: 4: Hoare triple {15942#true} call #t~ret4 := main(); {15942#true} is VALID [2018-11-18 22:57:06,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {15942#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {15990#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:06,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {15990#(<= main_~i~0 0)} assume true; {15990#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:06,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {15990#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15990#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:06,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {15990#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15990#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:06,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {15990#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {15945#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:06,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {15945#(<= main_~i~0 1)} assume true; {15945#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:06,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {15945#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15945#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:06,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {15945#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15945#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:06,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {15945#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15946#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:06,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {15946#(<= main_~i~0 2)} assume true; {15946#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:06,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {15946#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15946#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:06,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {15946#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15946#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:06,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {15946#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15947#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:06,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {15947#(<= main_~i~0 3)} assume true; {15947#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:06,865 INFO L273 TraceCheckUtils]: 19: Hoare triple {15947#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15947#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:06,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {15947#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15947#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:06,866 INFO L273 TraceCheckUtils]: 21: Hoare triple {15947#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15948#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:06,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {15948#(<= main_~i~0 4)} assume true; {15948#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:06,867 INFO L273 TraceCheckUtils]: 23: Hoare triple {15948#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15948#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:06,867 INFO L273 TraceCheckUtils]: 24: Hoare triple {15948#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15948#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:06,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {15948#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15949#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:06,869 INFO L273 TraceCheckUtils]: 26: Hoare triple {15949#(<= main_~i~0 5)} assume true; {15949#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:06,869 INFO L273 TraceCheckUtils]: 27: Hoare triple {15949#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15949#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:06,869 INFO L273 TraceCheckUtils]: 28: Hoare triple {15949#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15949#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:06,870 INFO L273 TraceCheckUtils]: 29: Hoare triple {15949#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15950#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:06,871 INFO L273 TraceCheckUtils]: 30: Hoare triple {15950#(<= main_~i~0 6)} assume true; {15950#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:06,871 INFO L273 TraceCheckUtils]: 31: Hoare triple {15950#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15950#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:06,872 INFO L273 TraceCheckUtils]: 32: Hoare triple {15950#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15950#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:06,872 INFO L273 TraceCheckUtils]: 33: Hoare triple {15950#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15951#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:06,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {15951#(<= main_~i~0 7)} assume true; {15951#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:06,873 INFO L273 TraceCheckUtils]: 35: Hoare triple {15951#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15951#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:06,874 INFO L273 TraceCheckUtils]: 36: Hoare triple {15951#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15951#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:06,875 INFO L273 TraceCheckUtils]: 37: Hoare triple {15951#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15952#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:06,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {15952#(<= main_~i~0 8)} assume true; {15952#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:06,876 INFO L273 TraceCheckUtils]: 39: Hoare triple {15952#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15952#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:06,876 INFO L273 TraceCheckUtils]: 40: Hoare triple {15952#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15952#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:06,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {15952#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15953#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:06,877 INFO L273 TraceCheckUtils]: 42: Hoare triple {15953#(<= main_~i~0 9)} assume true; {15953#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:06,878 INFO L273 TraceCheckUtils]: 43: Hoare triple {15953#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15953#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:06,878 INFO L273 TraceCheckUtils]: 44: Hoare triple {15953#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15953#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:06,879 INFO L273 TraceCheckUtils]: 45: Hoare triple {15953#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15954#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:06,880 INFO L273 TraceCheckUtils]: 46: Hoare triple {15954#(<= main_~i~0 10)} assume true; {15954#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:06,880 INFO L273 TraceCheckUtils]: 47: Hoare triple {15954#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15954#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:06,881 INFO L273 TraceCheckUtils]: 48: Hoare triple {15954#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15954#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:06,881 INFO L273 TraceCheckUtils]: 49: Hoare triple {15954#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15955#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:06,882 INFO L273 TraceCheckUtils]: 50: Hoare triple {15955#(<= main_~i~0 11)} assume true; {15955#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:06,882 INFO L273 TraceCheckUtils]: 51: Hoare triple {15955#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15955#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:06,883 INFO L273 TraceCheckUtils]: 52: Hoare triple {15955#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15955#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:06,884 INFO L273 TraceCheckUtils]: 53: Hoare triple {15955#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15956#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:06,884 INFO L273 TraceCheckUtils]: 54: Hoare triple {15956#(<= main_~i~0 12)} assume true; {15956#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:06,885 INFO L273 TraceCheckUtils]: 55: Hoare triple {15956#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15956#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:06,885 INFO L273 TraceCheckUtils]: 56: Hoare triple {15956#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15956#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:06,886 INFO L273 TraceCheckUtils]: 57: Hoare triple {15956#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15957#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:06,886 INFO L273 TraceCheckUtils]: 58: Hoare triple {15957#(<= main_~i~0 13)} assume true; {15957#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:06,887 INFO L273 TraceCheckUtils]: 59: Hoare triple {15957#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15957#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:06,887 INFO L273 TraceCheckUtils]: 60: Hoare triple {15957#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15957#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:06,888 INFO L273 TraceCheckUtils]: 61: Hoare triple {15957#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15958#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:06,888 INFO L273 TraceCheckUtils]: 62: Hoare triple {15958#(<= main_~i~0 14)} assume true; {15958#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:06,889 INFO L273 TraceCheckUtils]: 63: Hoare triple {15958#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15958#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:06,889 INFO L273 TraceCheckUtils]: 64: Hoare triple {15958#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15958#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:06,890 INFO L273 TraceCheckUtils]: 65: Hoare triple {15958#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {15959#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:06,891 INFO L273 TraceCheckUtils]: 66: Hoare triple {15959#(<= main_~i~0 15)} assume true; {15959#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:06,891 INFO L273 TraceCheckUtils]: 67: Hoare triple {15959#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15959#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:06,892 INFO L273 TraceCheckUtils]: 68: Hoare triple {15959#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15959#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:06,892 INFO L273 TraceCheckUtils]: 69: Hoare triple {15959#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {15960#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:06,893 INFO L273 TraceCheckUtils]: 70: Hoare triple {15960#(<= main_~i~0 16)} assume true; {15960#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:06,893 INFO L273 TraceCheckUtils]: 71: Hoare triple {15960#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15960#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:06,894 INFO L273 TraceCheckUtils]: 72: Hoare triple {15960#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15960#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:06,895 INFO L273 TraceCheckUtils]: 73: Hoare triple {15960#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {15961#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:06,895 INFO L273 TraceCheckUtils]: 74: Hoare triple {15961#(<= main_~i~0 17)} assume true; {15961#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:06,896 INFO L273 TraceCheckUtils]: 75: Hoare triple {15961#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15961#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:06,896 INFO L273 TraceCheckUtils]: 76: Hoare triple {15961#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15961#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:06,897 INFO L273 TraceCheckUtils]: 77: Hoare triple {15961#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {15962#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:06,897 INFO L273 TraceCheckUtils]: 78: Hoare triple {15962#(<= main_~i~0 18)} assume true; {15962#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:06,898 INFO L273 TraceCheckUtils]: 79: Hoare triple {15962#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15962#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:06,898 INFO L273 TraceCheckUtils]: 80: Hoare triple {15962#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15962#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:06,899 INFO L273 TraceCheckUtils]: 81: Hoare triple {15962#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {15963#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:06,899 INFO L273 TraceCheckUtils]: 82: Hoare triple {15963#(<= main_~i~0 19)} assume true; {15963#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:06,900 INFO L273 TraceCheckUtils]: 83: Hoare triple {15963#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15963#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:06,900 INFO L273 TraceCheckUtils]: 84: Hoare triple {15963#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15963#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:06,901 INFO L273 TraceCheckUtils]: 85: Hoare triple {15963#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {15964#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:06,902 INFO L273 TraceCheckUtils]: 86: Hoare triple {15964#(<= main_~i~0 20)} assume true; {15964#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:06,902 INFO L273 TraceCheckUtils]: 87: Hoare triple {15964#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15964#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:06,903 INFO L273 TraceCheckUtils]: 88: Hoare triple {15964#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15964#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:06,903 INFO L273 TraceCheckUtils]: 89: Hoare triple {15964#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {15965#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:06,904 INFO L273 TraceCheckUtils]: 90: Hoare triple {15965#(<= main_~i~0 21)} assume true; {15965#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:06,904 INFO L273 TraceCheckUtils]: 91: Hoare triple {15965#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15965#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:06,905 INFO L273 TraceCheckUtils]: 92: Hoare triple {15965#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15965#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:06,906 INFO L273 TraceCheckUtils]: 93: Hoare triple {15965#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {15966#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:06,906 INFO L273 TraceCheckUtils]: 94: Hoare triple {15966#(<= main_~i~0 22)} assume true; {15966#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:06,907 INFO L273 TraceCheckUtils]: 95: Hoare triple {15966#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15966#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:06,907 INFO L273 TraceCheckUtils]: 96: Hoare triple {15966#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15966#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:06,908 INFO L273 TraceCheckUtils]: 97: Hoare triple {15966#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {15967#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:06,908 INFO L273 TraceCheckUtils]: 98: Hoare triple {15967#(<= main_~i~0 23)} assume true; {15967#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:06,909 INFO L273 TraceCheckUtils]: 99: Hoare triple {15967#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15967#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:06,909 INFO L273 TraceCheckUtils]: 100: Hoare triple {15967#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15967#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:06,910 INFO L273 TraceCheckUtils]: 101: Hoare triple {15967#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {15968#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:06,911 INFO L273 TraceCheckUtils]: 102: Hoare triple {15968#(<= main_~i~0 24)} assume true; {15968#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:06,911 INFO L273 TraceCheckUtils]: 103: Hoare triple {15968#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15968#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:06,912 INFO L273 TraceCheckUtils]: 104: Hoare triple {15968#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15968#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:06,912 INFO L273 TraceCheckUtils]: 105: Hoare triple {15968#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {15969#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:06,913 INFO L273 TraceCheckUtils]: 106: Hoare triple {15969#(<= main_~i~0 25)} assume true; {15969#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:06,913 INFO L273 TraceCheckUtils]: 107: Hoare triple {15969#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15969#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:06,914 INFO L273 TraceCheckUtils]: 108: Hoare triple {15969#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15969#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:06,914 INFO L273 TraceCheckUtils]: 109: Hoare triple {15969#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {15970#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:06,915 INFO L273 TraceCheckUtils]: 110: Hoare triple {15970#(<= main_~i~0 26)} assume true; {15970#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:06,915 INFO L273 TraceCheckUtils]: 111: Hoare triple {15970#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15970#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:06,916 INFO L273 TraceCheckUtils]: 112: Hoare triple {15970#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15970#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:06,917 INFO L273 TraceCheckUtils]: 113: Hoare triple {15970#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {15971#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:06,917 INFO L273 TraceCheckUtils]: 114: Hoare triple {15971#(<= main_~i~0 27)} assume true; {15971#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:06,918 INFO L273 TraceCheckUtils]: 115: Hoare triple {15971#(<= main_~i~0 27)} assume !(~i~0 < 100000); {15943#false} is VALID [2018-11-18 22:57:06,918 INFO L273 TraceCheckUtils]: 116: Hoare triple {15943#false} havoc ~x~0;~x~0 := 0; {15943#false} is VALID [2018-11-18 22:57:06,918 INFO L273 TraceCheckUtils]: 117: Hoare triple {15943#false} assume true; {15943#false} is VALID [2018-11-18 22:57:06,918 INFO L273 TraceCheckUtils]: 118: Hoare triple {15943#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15943#false} is VALID [2018-11-18 22:57:06,919 INFO L256 TraceCheckUtils]: 119: Hoare triple {15943#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {15943#false} is VALID [2018-11-18 22:57:06,919 INFO L273 TraceCheckUtils]: 120: Hoare triple {15943#false} ~cond := #in~cond; {15943#false} is VALID [2018-11-18 22:57:06,919 INFO L273 TraceCheckUtils]: 121: Hoare triple {15943#false} assume 0 == ~cond; {15943#false} is VALID [2018-11-18 22:57:06,919 INFO L273 TraceCheckUtils]: 122: Hoare triple {15943#false} assume !false; {15943#false} is VALID [2018-11-18 22:57:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:06,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:06,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-18 22:57:06,950 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2018-11-18 22:57:06,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:06,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-18 22:57:07,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:07,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 22:57:07,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 22:57:07,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-18 22:57:07,066 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand 31 states. [2018-11-18 22:57:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:07,837 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2018-11-18 22:57:07,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 22:57:07,838 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2018-11-18 22:57:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:57:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 177 transitions. [2018-11-18 22:57:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:57:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 177 transitions. [2018-11-18 22:57:07,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 177 transitions. [2018-11-18 22:57:07,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:07,999 INFO L225 Difference]: With dead ends: 146 [2018-11-18 22:57:08,000 INFO L226 Difference]: Without dead ends: 134 [2018-11-18 22:57:08,001 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-18 22:57:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-18 22:57:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-11-18 22:57:08,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:08,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 132 states. [2018-11-18 22:57:08,025 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 132 states. [2018-11-18 22:57:08,025 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 132 states. [2018-11-18 22:57:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:08,028 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-11-18 22:57:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2018-11-18 22:57:08,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:08,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:08,028 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 134 states. [2018-11-18 22:57:08,029 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 134 states. [2018-11-18 22:57:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:08,031 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-11-18 22:57:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2018-11-18 22:57:08,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:08,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:08,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:08,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-18 22:57:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2018-11-18 22:57:08,033 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 123 [2018-11-18 22:57:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:08,033 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2018-11-18 22:57:08,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 22:57:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2018-11-18 22:57:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 22:57:08,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:08,034 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:08,035 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:08,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:08,035 INFO L82 PathProgramCache]: Analyzing trace with hash -876229910, now seen corresponding path program 28 times [2018-11-18 22:57:08,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:08,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:08,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:08,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:08,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:08,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {16962#true} call ULTIMATE.init(); {16962#true} is VALID [2018-11-18 22:57:08,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {16962#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16962#true} is VALID [2018-11-18 22:57:08,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {16962#true} assume true; {16962#true} is VALID [2018-11-18 22:57:08,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16962#true} {16962#true} #57#return; {16962#true} is VALID [2018-11-18 22:57:08,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {16962#true} call #t~ret4 := main(); {16962#true} is VALID [2018-11-18 22:57:08,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {16962#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {16964#(= main_~i~0 0)} is VALID [2018-11-18 22:57:08,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {16964#(= main_~i~0 0)} assume true; {16964#(= main_~i~0 0)} is VALID [2018-11-18 22:57:08,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {16964#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16964#(= main_~i~0 0)} is VALID [2018-11-18 22:57:08,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {16964#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16964#(= main_~i~0 0)} is VALID [2018-11-18 22:57:08,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {16964#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {16965#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:08,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {16965#(<= main_~i~0 1)} assume true; {16965#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:08,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {16965#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16965#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:08,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {16965#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16965#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:08,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {16965#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {16966#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:08,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {16966#(<= main_~i~0 2)} assume true; {16966#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:08,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {16966#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16966#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:08,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {16966#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16966#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:08,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {16966#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {16967#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:08,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {16967#(<= main_~i~0 3)} assume true; {16967#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:08,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {16967#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16967#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:08,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {16967#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16967#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:08,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {16967#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {16968#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:08,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {16968#(<= main_~i~0 4)} assume true; {16968#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:08,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {16968#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16968#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:08,649 INFO L273 TraceCheckUtils]: 24: Hoare triple {16968#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16968#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:08,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {16968#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {16969#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:08,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {16969#(<= main_~i~0 5)} assume true; {16969#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:08,651 INFO L273 TraceCheckUtils]: 27: Hoare triple {16969#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16969#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:08,652 INFO L273 TraceCheckUtils]: 28: Hoare triple {16969#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16969#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:08,652 INFO L273 TraceCheckUtils]: 29: Hoare triple {16969#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {16970#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:08,653 INFO L273 TraceCheckUtils]: 30: Hoare triple {16970#(<= main_~i~0 6)} assume true; {16970#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:08,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {16970#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16970#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:08,654 INFO L273 TraceCheckUtils]: 32: Hoare triple {16970#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16970#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:08,655 INFO L273 TraceCheckUtils]: 33: Hoare triple {16970#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {16971#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:08,655 INFO L273 TraceCheckUtils]: 34: Hoare triple {16971#(<= main_~i~0 7)} assume true; {16971#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:08,656 INFO L273 TraceCheckUtils]: 35: Hoare triple {16971#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16971#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:08,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {16971#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16971#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:08,657 INFO L273 TraceCheckUtils]: 37: Hoare triple {16971#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {16972#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:08,658 INFO L273 TraceCheckUtils]: 38: Hoare triple {16972#(<= main_~i~0 8)} assume true; {16972#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:08,659 INFO L273 TraceCheckUtils]: 39: Hoare triple {16972#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16972#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:08,659 INFO L273 TraceCheckUtils]: 40: Hoare triple {16972#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16972#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:08,660 INFO L273 TraceCheckUtils]: 41: Hoare triple {16972#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {16973#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:08,660 INFO L273 TraceCheckUtils]: 42: Hoare triple {16973#(<= main_~i~0 9)} assume true; {16973#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:08,661 INFO L273 TraceCheckUtils]: 43: Hoare triple {16973#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16973#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:08,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {16973#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16973#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:08,662 INFO L273 TraceCheckUtils]: 45: Hoare triple {16973#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {16974#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:08,663 INFO L273 TraceCheckUtils]: 46: Hoare triple {16974#(<= main_~i~0 10)} assume true; {16974#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:08,663 INFO L273 TraceCheckUtils]: 47: Hoare triple {16974#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16974#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:08,664 INFO L273 TraceCheckUtils]: 48: Hoare triple {16974#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16974#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:08,665 INFO L273 TraceCheckUtils]: 49: Hoare triple {16974#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {16975#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:08,665 INFO L273 TraceCheckUtils]: 50: Hoare triple {16975#(<= main_~i~0 11)} assume true; {16975#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:08,666 INFO L273 TraceCheckUtils]: 51: Hoare triple {16975#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16975#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:08,666 INFO L273 TraceCheckUtils]: 52: Hoare triple {16975#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16975#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:08,667 INFO L273 TraceCheckUtils]: 53: Hoare triple {16975#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {16976#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:08,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {16976#(<= main_~i~0 12)} assume true; {16976#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:08,668 INFO L273 TraceCheckUtils]: 55: Hoare triple {16976#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16976#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:08,669 INFO L273 TraceCheckUtils]: 56: Hoare triple {16976#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16976#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:08,670 INFO L273 TraceCheckUtils]: 57: Hoare triple {16976#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {16977#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:08,670 INFO L273 TraceCheckUtils]: 58: Hoare triple {16977#(<= main_~i~0 13)} assume true; {16977#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:08,671 INFO L273 TraceCheckUtils]: 59: Hoare triple {16977#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16977#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:08,671 INFO L273 TraceCheckUtils]: 60: Hoare triple {16977#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16977#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:08,672 INFO L273 TraceCheckUtils]: 61: Hoare triple {16977#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {16978#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:08,673 INFO L273 TraceCheckUtils]: 62: Hoare triple {16978#(<= main_~i~0 14)} assume true; {16978#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:08,673 INFO L273 TraceCheckUtils]: 63: Hoare triple {16978#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16978#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:08,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {16978#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16978#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:08,675 INFO L273 TraceCheckUtils]: 65: Hoare triple {16978#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {16979#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:08,675 INFO L273 TraceCheckUtils]: 66: Hoare triple {16979#(<= main_~i~0 15)} assume true; {16979#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:08,676 INFO L273 TraceCheckUtils]: 67: Hoare triple {16979#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16979#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:08,676 INFO L273 TraceCheckUtils]: 68: Hoare triple {16979#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16979#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:08,677 INFO L273 TraceCheckUtils]: 69: Hoare triple {16979#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {16980#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:08,678 INFO L273 TraceCheckUtils]: 70: Hoare triple {16980#(<= main_~i~0 16)} assume true; {16980#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:08,678 INFO L273 TraceCheckUtils]: 71: Hoare triple {16980#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16980#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:08,679 INFO L273 TraceCheckUtils]: 72: Hoare triple {16980#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16980#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:08,680 INFO L273 TraceCheckUtils]: 73: Hoare triple {16980#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {16981#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:08,680 INFO L273 TraceCheckUtils]: 74: Hoare triple {16981#(<= main_~i~0 17)} assume true; {16981#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:08,681 INFO L273 TraceCheckUtils]: 75: Hoare triple {16981#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16981#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:08,681 INFO L273 TraceCheckUtils]: 76: Hoare triple {16981#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16981#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:08,682 INFO L273 TraceCheckUtils]: 77: Hoare triple {16981#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {16982#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:08,683 INFO L273 TraceCheckUtils]: 78: Hoare triple {16982#(<= main_~i~0 18)} assume true; {16982#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:08,683 INFO L273 TraceCheckUtils]: 79: Hoare triple {16982#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16982#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:08,684 INFO L273 TraceCheckUtils]: 80: Hoare triple {16982#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16982#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:08,684 INFO L273 TraceCheckUtils]: 81: Hoare triple {16982#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {16983#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:08,685 INFO L273 TraceCheckUtils]: 82: Hoare triple {16983#(<= main_~i~0 19)} assume true; {16983#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:08,686 INFO L273 TraceCheckUtils]: 83: Hoare triple {16983#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16983#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:08,686 INFO L273 TraceCheckUtils]: 84: Hoare triple {16983#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16983#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:08,687 INFO L273 TraceCheckUtils]: 85: Hoare triple {16983#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {16984#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:08,688 INFO L273 TraceCheckUtils]: 86: Hoare triple {16984#(<= main_~i~0 20)} assume true; {16984#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:08,688 INFO L273 TraceCheckUtils]: 87: Hoare triple {16984#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16984#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:08,689 INFO L273 TraceCheckUtils]: 88: Hoare triple {16984#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16984#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:08,690 INFO L273 TraceCheckUtils]: 89: Hoare triple {16984#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {16985#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:08,690 INFO L273 TraceCheckUtils]: 90: Hoare triple {16985#(<= main_~i~0 21)} assume true; {16985#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:08,691 INFO L273 TraceCheckUtils]: 91: Hoare triple {16985#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16985#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:08,691 INFO L273 TraceCheckUtils]: 92: Hoare triple {16985#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16985#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:08,692 INFO L273 TraceCheckUtils]: 93: Hoare triple {16985#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {16986#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:08,693 INFO L273 TraceCheckUtils]: 94: Hoare triple {16986#(<= main_~i~0 22)} assume true; {16986#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:08,693 INFO L273 TraceCheckUtils]: 95: Hoare triple {16986#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16986#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:08,694 INFO L273 TraceCheckUtils]: 96: Hoare triple {16986#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16986#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:08,694 INFO L273 TraceCheckUtils]: 97: Hoare triple {16986#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {16987#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:08,695 INFO L273 TraceCheckUtils]: 98: Hoare triple {16987#(<= main_~i~0 23)} assume true; {16987#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:08,696 INFO L273 TraceCheckUtils]: 99: Hoare triple {16987#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16987#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:08,696 INFO L273 TraceCheckUtils]: 100: Hoare triple {16987#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16987#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:08,697 INFO L273 TraceCheckUtils]: 101: Hoare triple {16987#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {16988#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:08,697 INFO L273 TraceCheckUtils]: 102: Hoare triple {16988#(<= main_~i~0 24)} assume true; {16988#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:08,698 INFO L273 TraceCheckUtils]: 103: Hoare triple {16988#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16988#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:08,699 INFO L273 TraceCheckUtils]: 104: Hoare triple {16988#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16988#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:08,699 INFO L273 TraceCheckUtils]: 105: Hoare triple {16988#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {16989#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:08,700 INFO L273 TraceCheckUtils]: 106: Hoare triple {16989#(<= main_~i~0 25)} assume true; {16989#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:08,701 INFO L273 TraceCheckUtils]: 107: Hoare triple {16989#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16989#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:08,701 INFO L273 TraceCheckUtils]: 108: Hoare triple {16989#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16989#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:08,702 INFO L273 TraceCheckUtils]: 109: Hoare triple {16989#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {16990#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:08,702 INFO L273 TraceCheckUtils]: 110: Hoare triple {16990#(<= main_~i~0 26)} assume true; {16990#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:08,703 INFO L273 TraceCheckUtils]: 111: Hoare triple {16990#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16990#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:08,704 INFO L273 TraceCheckUtils]: 112: Hoare triple {16990#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16990#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:08,704 INFO L273 TraceCheckUtils]: 113: Hoare triple {16990#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {16991#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:08,705 INFO L273 TraceCheckUtils]: 114: Hoare triple {16991#(<= main_~i~0 27)} assume true; {16991#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:08,705 INFO L273 TraceCheckUtils]: 115: Hoare triple {16991#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16991#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:08,706 INFO L273 TraceCheckUtils]: 116: Hoare triple {16991#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16991#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:08,707 INFO L273 TraceCheckUtils]: 117: Hoare triple {16991#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {16992#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:08,707 INFO L273 TraceCheckUtils]: 118: Hoare triple {16992#(<= main_~i~0 28)} assume true; {16992#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:08,708 INFO L273 TraceCheckUtils]: 119: Hoare triple {16992#(<= main_~i~0 28)} assume !(~i~0 < 100000); {16963#false} is VALID [2018-11-18 22:57:08,708 INFO L273 TraceCheckUtils]: 120: Hoare triple {16963#false} havoc ~x~0;~x~0 := 0; {16963#false} is VALID [2018-11-18 22:57:08,709 INFO L273 TraceCheckUtils]: 121: Hoare triple {16963#false} assume true; {16963#false} is VALID [2018-11-18 22:57:08,709 INFO L273 TraceCheckUtils]: 122: Hoare triple {16963#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16963#false} is VALID [2018-11-18 22:57:08,709 INFO L256 TraceCheckUtils]: 123: Hoare triple {16963#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {16963#false} is VALID [2018-11-18 22:57:08,709 INFO L273 TraceCheckUtils]: 124: Hoare triple {16963#false} ~cond := #in~cond; {16963#false} is VALID [2018-11-18 22:57:08,710 INFO L273 TraceCheckUtils]: 125: Hoare triple {16963#false} assume 0 == ~cond; {16963#false} is VALID [2018-11-18 22:57:08,710 INFO L273 TraceCheckUtils]: 126: Hoare triple {16963#false} assume !false; {16963#false} is VALID [2018-11-18 22:57:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:08,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:08,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:08,758 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:57:08,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:57:08,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:08,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:09,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {16962#true} call ULTIMATE.init(); {16962#true} is VALID [2018-11-18 22:57:09,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {16962#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16962#true} is VALID [2018-11-18 22:57:09,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {16962#true} assume true; {16962#true} is VALID [2018-11-18 22:57:09,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16962#true} {16962#true} #57#return; {16962#true} is VALID [2018-11-18 22:57:09,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {16962#true} call #t~ret4 := main(); {16962#true} is VALID [2018-11-18 22:57:09,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {16962#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {17011#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:09,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {17011#(<= main_~i~0 0)} assume true; {17011#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:09,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {17011#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17011#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:09,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {17011#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17011#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:09,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {17011#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {16965#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:09,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {16965#(<= main_~i~0 1)} assume true; {16965#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:09,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {16965#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16965#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:09,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {16965#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16965#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:09,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {16965#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {16966#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:09,141 INFO L273 TraceCheckUtils]: 14: Hoare triple {16966#(<= main_~i~0 2)} assume true; {16966#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:09,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {16966#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16966#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:09,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {16966#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16966#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:09,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {16966#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {16967#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:09,143 INFO L273 TraceCheckUtils]: 18: Hoare triple {16967#(<= main_~i~0 3)} assume true; {16967#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:09,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {16967#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16967#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:09,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {16967#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16967#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:09,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {16967#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {16968#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:09,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {16968#(<= main_~i~0 4)} assume true; {16968#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:09,146 INFO L273 TraceCheckUtils]: 23: Hoare triple {16968#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16968#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:09,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {16968#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16968#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:09,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {16968#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {16969#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:09,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {16969#(<= main_~i~0 5)} assume true; {16969#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:09,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {16969#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16969#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:09,148 INFO L273 TraceCheckUtils]: 28: Hoare triple {16969#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16969#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:09,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {16969#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {16970#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:09,149 INFO L273 TraceCheckUtils]: 30: Hoare triple {16970#(<= main_~i~0 6)} assume true; {16970#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:09,150 INFO L273 TraceCheckUtils]: 31: Hoare triple {16970#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16970#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:09,150 INFO L273 TraceCheckUtils]: 32: Hoare triple {16970#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16970#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:09,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {16970#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {16971#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:09,151 INFO L273 TraceCheckUtils]: 34: Hoare triple {16971#(<= main_~i~0 7)} assume true; {16971#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:09,152 INFO L273 TraceCheckUtils]: 35: Hoare triple {16971#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16971#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:09,152 INFO L273 TraceCheckUtils]: 36: Hoare triple {16971#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16971#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:09,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {16971#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {16972#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:09,153 INFO L273 TraceCheckUtils]: 38: Hoare triple {16972#(<= main_~i~0 8)} assume true; {16972#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:09,154 INFO L273 TraceCheckUtils]: 39: Hoare triple {16972#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16972#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:09,154 INFO L273 TraceCheckUtils]: 40: Hoare triple {16972#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16972#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:09,155 INFO L273 TraceCheckUtils]: 41: Hoare triple {16972#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {16973#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:09,155 INFO L273 TraceCheckUtils]: 42: Hoare triple {16973#(<= main_~i~0 9)} assume true; {16973#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:09,156 INFO L273 TraceCheckUtils]: 43: Hoare triple {16973#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16973#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:09,156 INFO L273 TraceCheckUtils]: 44: Hoare triple {16973#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16973#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:09,157 INFO L273 TraceCheckUtils]: 45: Hoare triple {16973#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {16974#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:09,158 INFO L273 TraceCheckUtils]: 46: Hoare triple {16974#(<= main_~i~0 10)} assume true; {16974#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:09,158 INFO L273 TraceCheckUtils]: 47: Hoare triple {16974#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16974#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:09,159 INFO L273 TraceCheckUtils]: 48: Hoare triple {16974#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16974#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:09,159 INFO L273 TraceCheckUtils]: 49: Hoare triple {16974#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {16975#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:09,160 INFO L273 TraceCheckUtils]: 50: Hoare triple {16975#(<= main_~i~0 11)} assume true; {16975#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:09,160 INFO L273 TraceCheckUtils]: 51: Hoare triple {16975#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16975#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:09,161 INFO L273 TraceCheckUtils]: 52: Hoare triple {16975#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16975#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:09,161 INFO L273 TraceCheckUtils]: 53: Hoare triple {16975#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {16976#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:09,162 INFO L273 TraceCheckUtils]: 54: Hoare triple {16976#(<= main_~i~0 12)} assume true; {16976#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:09,162 INFO L273 TraceCheckUtils]: 55: Hoare triple {16976#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16976#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:09,163 INFO L273 TraceCheckUtils]: 56: Hoare triple {16976#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16976#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:09,163 INFO L273 TraceCheckUtils]: 57: Hoare triple {16976#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {16977#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:09,164 INFO L273 TraceCheckUtils]: 58: Hoare triple {16977#(<= main_~i~0 13)} assume true; {16977#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:09,164 INFO L273 TraceCheckUtils]: 59: Hoare triple {16977#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16977#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:09,165 INFO L273 TraceCheckUtils]: 60: Hoare triple {16977#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16977#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:09,165 INFO L273 TraceCheckUtils]: 61: Hoare triple {16977#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {16978#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:09,166 INFO L273 TraceCheckUtils]: 62: Hoare triple {16978#(<= main_~i~0 14)} assume true; {16978#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:09,166 INFO L273 TraceCheckUtils]: 63: Hoare triple {16978#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16978#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:09,167 INFO L273 TraceCheckUtils]: 64: Hoare triple {16978#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16978#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:09,167 INFO L273 TraceCheckUtils]: 65: Hoare triple {16978#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {16979#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:09,168 INFO L273 TraceCheckUtils]: 66: Hoare triple {16979#(<= main_~i~0 15)} assume true; {16979#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:09,168 INFO L273 TraceCheckUtils]: 67: Hoare triple {16979#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16979#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:09,169 INFO L273 TraceCheckUtils]: 68: Hoare triple {16979#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16979#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:09,169 INFO L273 TraceCheckUtils]: 69: Hoare triple {16979#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {16980#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:09,170 INFO L273 TraceCheckUtils]: 70: Hoare triple {16980#(<= main_~i~0 16)} assume true; {16980#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:09,170 INFO L273 TraceCheckUtils]: 71: Hoare triple {16980#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16980#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:09,171 INFO L273 TraceCheckUtils]: 72: Hoare triple {16980#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16980#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:09,172 INFO L273 TraceCheckUtils]: 73: Hoare triple {16980#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {16981#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:09,172 INFO L273 TraceCheckUtils]: 74: Hoare triple {16981#(<= main_~i~0 17)} assume true; {16981#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:09,172 INFO L273 TraceCheckUtils]: 75: Hoare triple {16981#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16981#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:09,173 INFO L273 TraceCheckUtils]: 76: Hoare triple {16981#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16981#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:09,174 INFO L273 TraceCheckUtils]: 77: Hoare triple {16981#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {16982#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:09,174 INFO L273 TraceCheckUtils]: 78: Hoare triple {16982#(<= main_~i~0 18)} assume true; {16982#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:09,175 INFO L273 TraceCheckUtils]: 79: Hoare triple {16982#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16982#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:09,175 INFO L273 TraceCheckUtils]: 80: Hoare triple {16982#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16982#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:09,176 INFO L273 TraceCheckUtils]: 81: Hoare triple {16982#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {16983#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:09,176 INFO L273 TraceCheckUtils]: 82: Hoare triple {16983#(<= main_~i~0 19)} assume true; {16983#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:09,177 INFO L273 TraceCheckUtils]: 83: Hoare triple {16983#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16983#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:09,177 INFO L273 TraceCheckUtils]: 84: Hoare triple {16983#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16983#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:09,178 INFO L273 TraceCheckUtils]: 85: Hoare triple {16983#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {16984#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:09,178 INFO L273 TraceCheckUtils]: 86: Hoare triple {16984#(<= main_~i~0 20)} assume true; {16984#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:09,179 INFO L273 TraceCheckUtils]: 87: Hoare triple {16984#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16984#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:09,179 INFO L273 TraceCheckUtils]: 88: Hoare triple {16984#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16984#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:09,180 INFO L273 TraceCheckUtils]: 89: Hoare triple {16984#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {16985#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:09,180 INFO L273 TraceCheckUtils]: 90: Hoare triple {16985#(<= main_~i~0 21)} assume true; {16985#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:09,181 INFO L273 TraceCheckUtils]: 91: Hoare triple {16985#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16985#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:09,181 INFO L273 TraceCheckUtils]: 92: Hoare triple {16985#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16985#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:09,182 INFO L273 TraceCheckUtils]: 93: Hoare triple {16985#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {16986#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:09,183 INFO L273 TraceCheckUtils]: 94: Hoare triple {16986#(<= main_~i~0 22)} assume true; {16986#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:09,183 INFO L273 TraceCheckUtils]: 95: Hoare triple {16986#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16986#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:09,184 INFO L273 TraceCheckUtils]: 96: Hoare triple {16986#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16986#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:09,184 INFO L273 TraceCheckUtils]: 97: Hoare triple {16986#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {16987#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:09,185 INFO L273 TraceCheckUtils]: 98: Hoare triple {16987#(<= main_~i~0 23)} assume true; {16987#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:09,185 INFO L273 TraceCheckUtils]: 99: Hoare triple {16987#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16987#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:09,186 INFO L273 TraceCheckUtils]: 100: Hoare triple {16987#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16987#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:09,187 INFO L273 TraceCheckUtils]: 101: Hoare triple {16987#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {16988#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:09,187 INFO L273 TraceCheckUtils]: 102: Hoare triple {16988#(<= main_~i~0 24)} assume true; {16988#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:09,188 INFO L273 TraceCheckUtils]: 103: Hoare triple {16988#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16988#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:09,188 INFO L273 TraceCheckUtils]: 104: Hoare triple {16988#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16988#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:09,189 INFO L273 TraceCheckUtils]: 105: Hoare triple {16988#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {16989#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:09,189 INFO L273 TraceCheckUtils]: 106: Hoare triple {16989#(<= main_~i~0 25)} assume true; {16989#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:09,190 INFO L273 TraceCheckUtils]: 107: Hoare triple {16989#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16989#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:09,190 INFO L273 TraceCheckUtils]: 108: Hoare triple {16989#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16989#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:09,191 INFO L273 TraceCheckUtils]: 109: Hoare triple {16989#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {16990#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:09,192 INFO L273 TraceCheckUtils]: 110: Hoare triple {16990#(<= main_~i~0 26)} assume true; {16990#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:09,192 INFO L273 TraceCheckUtils]: 111: Hoare triple {16990#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16990#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:09,193 INFO L273 TraceCheckUtils]: 112: Hoare triple {16990#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16990#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:09,193 INFO L273 TraceCheckUtils]: 113: Hoare triple {16990#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {16991#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:09,194 INFO L273 TraceCheckUtils]: 114: Hoare triple {16991#(<= main_~i~0 27)} assume true; {16991#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:09,194 INFO L273 TraceCheckUtils]: 115: Hoare triple {16991#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16991#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:09,195 INFO L273 TraceCheckUtils]: 116: Hoare triple {16991#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16991#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:09,195 INFO L273 TraceCheckUtils]: 117: Hoare triple {16991#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {16992#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:09,196 INFO L273 TraceCheckUtils]: 118: Hoare triple {16992#(<= main_~i~0 28)} assume true; {16992#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:09,197 INFO L273 TraceCheckUtils]: 119: Hoare triple {16992#(<= main_~i~0 28)} assume !(~i~0 < 100000); {16963#false} is VALID [2018-11-18 22:57:09,197 INFO L273 TraceCheckUtils]: 120: Hoare triple {16963#false} havoc ~x~0;~x~0 := 0; {16963#false} is VALID [2018-11-18 22:57:09,197 INFO L273 TraceCheckUtils]: 121: Hoare triple {16963#false} assume true; {16963#false} is VALID [2018-11-18 22:57:09,197 INFO L273 TraceCheckUtils]: 122: Hoare triple {16963#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16963#false} is VALID [2018-11-18 22:57:09,197 INFO L256 TraceCheckUtils]: 123: Hoare triple {16963#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {16963#false} is VALID [2018-11-18 22:57:09,198 INFO L273 TraceCheckUtils]: 124: Hoare triple {16963#false} ~cond := #in~cond; {16963#false} is VALID [2018-11-18 22:57:09,198 INFO L273 TraceCheckUtils]: 125: Hoare triple {16963#false} assume 0 == ~cond; {16963#false} is VALID [2018-11-18 22:57:09,198 INFO L273 TraceCheckUtils]: 126: Hoare triple {16963#false} assume !false; {16963#false} is VALID [2018-11-18 22:57:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:09,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:09,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-18 22:57:09,230 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2018-11-18 22:57:09,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:09,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-18 22:57:09,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:09,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 22:57:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 22:57:09,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-18 22:57:09,344 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 32 states. [2018-11-18 22:57:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:10,123 INFO L93 Difference]: Finished difference Result 150 states and 182 transitions. [2018-11-18 22:57:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 22:57:10,123 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2018-11-18 22:57:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:57:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 182 transitions. [2018-11-18 22:57:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:57:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 182 transitions. [2018-11-18 22:57:10,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 182 transitions. [2018-11-18 22:57:10,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:10,313 INFO L225 Difference]: With dead ends: 150 [2018-11-18 22:57:10,313 INFO L226 Difference]: Without dead ends: 138 [2018-11-18 22:57:10,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-18 22:57:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-18 22:57:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-18 22:57:10,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:10,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2018-11-18 22:57:10,340 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2018-11-18 22:57:10,340 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2018-11-18 22:57:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:10,343 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2018-11-18 22:57:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2018-11-18 22:57:10,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:10,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:10,343 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2018-11-18 22:57:10,344 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2018-11-18 22:57:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:10,346 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2018-11-18 22:57:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2018-11-18 22:57:10,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:10,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:10,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:10,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 22:57:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 166 transitions. [2018-11-18 22:57:10,349 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 166 transitions. Word has length 127 [2018-11-18 22:57:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:10,349 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 166 transitions. [2018-11-18 22:57:10,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 22:57:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 166 transitions. [2018-11-18 22:57:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 22:57:10,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:10,351 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:10,351 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:10,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:10,351 INFO L82 PathProgramCache]: Analyzing trace with hash 617931328, now seen corresponding path program 29 times [2018-11-18 22:57:10,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:10,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:10,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:10,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:10,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:11,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {18013#true} call ULTIMATE.init(); {18013#true} is VALID [2018-11-18 22:57:11,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {18013#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18013#true} is VALID [2018-11-18 22:57:11,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {18013#true} assume true; {18013#true} is VALID [2018-11-18 22:57:11,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18013#true} {18013#true} #57#return; {18013#true} is VALID [2018-11-18 22:57:11,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {18013#true} call #t~ret4 := main(); {18013#true} is VALID [2018-11-18 22:57:11,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {18013#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {18015#(= main_~i~0 0)} is VALID [2018-11-18 22:57:11,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {18015#(= main_~i~0 0)} assume true; {18015#(= main_~i~0 0)} is VALID [2018-11-18 22:57:11,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {18015#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18015#(= main_~i~0 0)} is VALID [2018-11-18 22:57:11,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {18015#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18015#(= main_~i~0 0)} is VALID [2018-11-18 22:57:11,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {18015#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {18016#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:11,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {18016#(<= main_~i~0 1)} assume true; {18016#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:11,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {18016#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18016#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:11,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {18016#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18016#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:11,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {18016#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {18017#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:11,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {18017#(<= main_~i~0 2)} assume true; {18017#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:11,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {18017#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18017#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:11,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {18017#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18017#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:11,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {18017#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {18018#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:11,301 INFO L273 TraceCheckUtils]: 18: Hoare triple {18018#(<= main_~i~0 3)} assume true; {18018#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:11,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {18018#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18018#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:11,302 INFO L273 TraceCheckUtils]: 20: Hoare triple {18018#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18018#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:11,303 INFO L273 TraceCheckUtils]: 21: Hoare triple {18018#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {18019#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:11,303 INFO L273 TraceCheckUtils]: 22: Hoare triple {18019#(<= main_~i~0 4)} assume true; {18019#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:11,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {18019#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18019#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:11,304 INFO L273 TraceCheckUtils]: 24: Hoare triple {18019#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18019#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:11,305 INFO L273 TraceCheckUtils]: 25: Hoare triple {18019#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {18020#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:11,306 INFO L273 TraceCheckUtils]: 26: Hoare triple {18020#(<= main_~i~0 5)} assume true; {18020#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:11,306 INFO L273 TraceCheckUtils]: 27: Hoare triple {18020#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18020#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:11,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {18020#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18020#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:11,307 INFO L273 TraceCheckUtils]: 29: Hoare triple {18020#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {18021#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:11,308 INFO L273 TraceCheckUtils]: 30: Hoare triple {18021#(<= main_~i~0 6)} assume true; {18021#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:11,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {18021#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18021#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:11,309 INFO L273 TraceCheckUtils]: 32: Hoare triple {18021#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18021#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:11,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {18021#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {18022#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:11,310 INFO L273 TraceCheckUtils]: 34: Hoare triple {18022#(<= main_~i~0 7)} assume true; {18022#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:11,310 INFO L273 TraceCheckUtils]: 35: Hoare triple {18022#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18022#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:11,311 INFO L273 TraceCheckUtils]: 36: Hoare triple {18022#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18022#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:11,311 INFO L273 TraceCheckUtils]: 37: Hoare triple {18022#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {18023#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:11,312 INFO L273 TraceCheckUtils]: 38: Hoare triple {18023#(<= main_~i~0 8)} assume true; {18023#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:11,312 INFO L273 TraceCheckUtils]: 39: Hoare triple {18023#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18023#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:11,313 INFO L273 TraceCheckUtils]: 40: Hoare triple {18023#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18023#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:11,313 INFO L273 TraceCheckUtils]: 41: Hoare triple {18023#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {18024#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:11,314 INFO L273 TraceCheckUtils]: 42: Hoare triple {18024#(<= main_~i~0 9)} assume true; {18024#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:11,314 INFO L273 TraceCheckUtils]: 43: Hoare triple {18024#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18024#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:11,315 INFO L273 TraceCheckUtils]: 44: Hoare triple {18024#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18024#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:11,315 INFO L273 TraceCheckUtils]: 45: Hoare triple {18024#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {18025#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:11,316 INFO L273 TraceCheckUtils]: 46: Hoare triple {18025#(<= main_~i~0 10)} assume true; {18025#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:11,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {18025#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18025#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:11,317 INFO L273 TraceCheckUtils]: 48: Hoare triple {18025#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18025#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:11,317 INFO L273 TraceCheckUtils]: 49: Hoare triple {18025#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {18026#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:11,318 INFO L273 TraceCheckUtils]: 50: Hoare triple {18026#(<= main_~i~0 11)} assume true; {18026#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:11,318 INFO L273 TraceCheckUtils]: 51: Hoare triple {18026#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18026#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:11,319 INFO L273 TraceCheckUtils]: 52: Hoare triple {18026#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18026#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:11,320 INFO L273 TraceCheckUtils]: 53: Hoare triple {18026#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {18027#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:11,320 INFO L273 TraceCheckUtils]: 54: Hoare triple {18027#(<= main_~i~0 12)} assume true; {18027#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:11,320 INFO L273 TraceCheckUtils]: 55: Hoare triple {18027#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18027#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:11,321 INFO L273 TraceCheckUtils]: 56: Hoare triple {18027#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18027#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:11,322 INFO L273 TraceCheckUtils]: 57: Hoare triple {18027#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {18028#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:11,322 INFO L273 TraceCheckUtils]: 58: Hoare triple {18028#(<= main_~i~0 13)} assume true; {18028#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:11,323 INFO L273 TraceCheckUtils]: 59: Hoare triple {18028#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18028#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:11,323 INFO L273 TraceCheckUtils]: 60: Hoare triple {18028#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18028#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:11,324 INFO L273 TraceCheckUtils]: 61: Hoare triple {18028#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {18029#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:11,324 INFO L273 TraceCheckUtils]: 62: Hoare triple {18029#(<= main_~i~0 14)} assume true; {18029#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:11,325 INFO L273 TraceCheckUtils]: 63: Hoare triple {18029#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18029#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:11,325 INFO L273 TraceCheckUtils]: 64: Hoare triple {18029#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18029#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:11,326 INFO L273 TraceCheckUtils]: 65: Hoare triple {18029#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {18030#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:11,326 INFO L273 TraceCheckUtils]: 66: Hoare triple {18030#(<= main_~i~0 15)} assume true; {18030#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:11,327 INFO L273 TraceCheckUtils]: 67: Hoare triple {18030#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18030#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:11,327 INFO L273 TraceCheckUtils]: 68: Hoare triple {18030#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18030#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:11,328 INFO L273 TraceCheckUtils]: 69: Hoare triple {18030#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {18031#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:11,328 INFO L273 TraceCheckUtils]: 70: Hoare triple {18031#(<= main_~i~0 16)} assume true; {18031#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:11,329 INFO L273 TraceCheckUtils]: 71: Hoare triple {18031#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18031#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:11,329 INFO L273 TraceCheckUtils]: 72: Hoare triple {18031#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18031#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:11,330 INFO L273 TraceCheckUtils]: 73: Hoare triple {18031#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {18032#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:11,330 INFO L273 TraceCheckUtils]: 74: Hoare triple {18032#(<= main_~i~0 17)} assume true; {18032#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:11,331 INFO L273 TraceCheckUtils]: 75: Hoare triple {18032#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18032#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:11,331 INFO L273 TraceCheckUtils]: 76: Hoare triple {18032#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18032#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:11,332 INFO L273 TraceCheckUtils]: 77: Hoare triple {18032#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {18033#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:11,332 INFO L273 TraceCheckUtils]: 78: Hoare triple {18033#(<= main_~i~0 18)} assume true; {18033#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:11,333 INFO L273 TraceCheckUtils]: 79: Hoare triple {18033#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18033#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:11,333 INFO L273 TraceCheckUtils]: 80: Hoare triple {18033#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18033#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:11,334 INFO L273 TraceCheckUtils]: 81: Hoare triple {18033#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {18034#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:11,335 INFO L273 TraceCheckUtils]: 82: Hoare triple {18034#(<= main_~i~0 19)} assume true; {18034#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:11,335 INFO L273 TraceCheckUtils]: 83: Hoare triple {18034#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18034#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:11,335 INFO L273 TraceCheckUtils]: 84: Hoare triple {18034#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18034#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:11,336 INFO L273 TraceCheckUtils]: 85: Hoare triple {18034#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {18035#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:11,337 INFO L273 TraceCheckUtils]: 86: Hoare triple {18035#(<= main_~i~0 20)} assume true; {18035#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:11,337 INFO L273 TraceCheckUtils]: 87: Hoare triple {18035#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18035#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:11,338 INFO L273 TraceCheckUtils]: 88: Hoare triple {18035#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18035#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:11,338 INFO L273 TraceCheckUtils]: 89: Hoare triple {18035#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {18036#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:11,339 INFO L273 TraceCheckUtils]: 90: Hoare triple {18036#(<= main_~i~0 21)} assume true; {18036#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:11,339 INFO L273 TraceCheckUtils]: 91: Hoare triple {18036#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18036#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:11,340 INFO L273 TraceCheckUtils]: 92: Hoare triple {18036#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18036#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:11,340 INFO L273 TraceCheckUtils]: 93: Hoare triple {18036#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {18037#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:11,341 INFO L273 TraceCheckUtils]: 94: Hoare triple {18037#(<= main_~i~0 22)} assume true; {18037#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:11,341 INFO L273 TraceCheckUtils]: 95: Hoare triple {18037#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18037#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:11,342 INFO L273 TraceCheckUtils]: 96: Hoare triple {18037#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18037#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:11,342 INFO L273 TraceCheckUtils]: 97: Hoare triple {18037#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {18038#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:11,343 INFO L273 TraceCheckUtils]: 98: Hoare triple {18038#(<= main_~i~0 23)} assume true; {18038#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:11,343 INFO L273 TraceCheckUtils]: 99: Hoare triple {18038#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18038#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:11,344 INFO L273 TraceCheckUtils]: 100: Hoare triple {18038#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18038#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:11,344 INFO L273 TraceCheckUtils]: 101: Hoare triple {18038#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {18039#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:11,345 INFO L273 TraceCheckUtils]: 102: Hoare triple {18039#(<= main_~i~0 24)} assume true; {18039#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:11,345 INFO L273 TraceCheckUtils]: 103: Hoare triple {18039#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18039#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:11,346 INFO L273 TraceCheckUtils]: 104: Hoare triple {18039#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18039#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:11,347 INFO L273 TraceCheckUtils]: 105: Hoare triple {18039#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {18040#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:11,347 INFO L273 TraceCheckUtils]: 106: Hoare triple {18040#(<= main_~i~0 25)} assume true; {18040#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:11,348 INFO L273 TraceCheckUtils]: 107: Hoare triple {18040#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18040#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:11,348 INFO L273 TraceCheckUtils]: 108: Hoare triple {18040#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18040#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:11,349 INFO L273 TraceCheckUtils]: 109: Hoare triple {18040#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {18041#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:11,349 INFO L273 TraceCheckUtils]: 110: Hoare triple {18041#(<= main_~i~0 26)} assume true; {18041#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:11,350 INFO L273 TraceCheckUtils]: 111: Hoare triple {18041#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18041#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:11,373 INFO L273 TraceCheckUtils]: 112: Hoare triple {18041#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18041#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:11,382 INFO L273 TraceCheckUtils]: 113: Hoare triple {18041#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {18042#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:11,382 INFO L273 TraceCheckUtils]: 114: Hoare triple {18042#(<= main_~i~0 27)} assume true; {18042#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:11,383 INFO L273 TraceCheckUtils]: 115: Hoare triple {18042#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18042#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:11,383 INFO L273 TraceCheckUtils]: 116: Hoare triple {18042#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18042#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:11,383 INFO L273 TraceCheckUtils]: 117: Hoare triple {18042#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {18043#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:11,384 INFO L273 TraceCheckUtils]: 118: Hoare triple {18043#(<= main_~i~0 28)} assume true; {18043#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:11,384 INFO L273 TraceCheckUtils]: 119: Hoare triple {18043#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18043#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:11,384 INFO L273 TraceCheckUtils]: 120: Hoare triple {18043#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18043#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:11,385 INFO L273 TraceCheckUtils]: 121: Hoare triple {18043#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {18044#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:11,385 INFO L273 TraceCheckUtils]: 122: Hoare triple {18044#(<= main_~i~0 29)} assume true; {18044#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:11,385 INFO L273 TraceCheckUtils]: 123: Hoare triple {18044#(<= main_~i~0 29)} assume !(~i~0 < 100000); {18014#false} is VALID [2018-11-18 22:57:11,386 INFO L273 TraceCheckUtils]: 124: Hoare triple {18014#false} havoc ~x~0;~x~0 := 0; {18014#false} is VALID [2018-11-18 22:57:11,386 INFO L273 TraceCheckUtils]: 125: Hoare triple {18014#false} assume true; {18014#false} is VALID [2018-11-18 22:57:11,386 INFO L273 TraceCheckUtils]: 126: Hoare triple {18014#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {18014#false} is VALID [2018-11-18 22:57:11,386 INFO L256 TraceCheckUtils]: 127: Hoare triple {18014#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {18014#false} is VALID [2018-11-18 22:57:11,386 INFO L273 TraceCheckUtils]: 128: Hoare triple {18014#false} ~cond := #in~cond; {18014#false} is VALID [2018-11-18 22:57:11,386 INFO L273 TraceCheckUtils]: 129: Hoare triple {18014#false} assume 0 == ~cond; {18014#false} is VALID [2018-11-18 22:57:11,386 INFO L273 TraceCheckUtils]: 130: Hoare triple {18014#false} assume !false; {18014#false} is VALID [2018-11-18 22:57:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:11,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:11,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:11,409 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:57:11,494 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-18 22:57:11,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:11,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:12,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {18013#true} call ULTIMATE.init(); {18013#true} is VALID [2018-11-18 22:57:12,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {18013#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18013#true} is VALID [2018-11-18 22:57:12,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {18013#true} assume true; {18013#true} is VALID [2018-11-18 22:57:12,664 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18013#true} {18013#true} #57#return; {18013#true} is VALID [2018-11-18 22:57:12,664 INFO L256 TraceCheckUtils]: 4: Hoare triple {18013#true} call #t~ret4 := main(); {18013#true} is VALID [2018-11-18 22:57:12,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {18013#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {18063#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:12,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {18063#(<= main_~i~0 0)} assume true; {18063#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:12,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {18063#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18063#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:12,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {18063#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18063#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:12,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {18063#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {18016#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:12,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {18016#(<= main_~i~0 1)} assume true; {18016#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:12,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {18016#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18016#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:12,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {18016#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18016#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:12,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {18016#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {18017#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:12,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {18017#(<= main_~i~0 2)} assume true; {18017#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:12,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {18017#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18017#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:12,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {18017#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18017#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:12,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {18017#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {18018#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:12,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {18018#(<= main_~i~0 3)} assume true; {18018#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:12,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {18018#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18018#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:12,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {18018#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18018#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:12,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {18018#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {18019#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:12,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {18019#(<= main_~i~0 4)} assume true; {18019#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:12,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {18019#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18019#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:12,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {18019#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18019#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:12,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {18019#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {18020#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:12,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {18020#(<= main_~i~0 5)} assume true; {18020#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:12,675 INFO L273 TraceCheckUtils]: 27: Hoare triple {18020#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18020#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:12,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {18020#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18020#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:12,676 INFO L273 TraceCheckUtils]: 29: Hoare triple {18020#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {18021#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:12,676 INFO L273 TraceCheckUtils]: 30: Hoare triple {18021#(<= main_~i~0 6)} assume true; {18021#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:12,677 INFO L273 TraceCheckUtils]: 31: Hoare triple {18021#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18021#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:12,677 INFO L273 TraceCheckUtils]: 32: Hoare triple {18021#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18021#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:12,678 INFO L273 TraceCheckUtils]: 33: Hoare triple {18021#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {18022#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:12,678 INFO L273 TraceCheckUtils]: 34: Hoare triple {18022#(<= main_~i~0 7)} assume true; {18022#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:12,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {18022#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18022#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:12,679 INFO L273 TraceCheckUtils]: 36: Hoare triple {18022#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18022#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:12,680 INFO L273 TraceCheckUtils]: 37: Hoare triple {18022#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {18023#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:12,681 INFO L273 TraceCheckUtils]: 38: Hoare triple {18023#(<= main_~i~0 8)} assume true; {18023#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:12,681 INFO L273 TraceCheckUtils]: 39: Hoare triple {18023#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18023#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:12,681 INFO L273 TraceCheckUtils]: 40: Hoare triple {18023#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18023#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:12,682 INFO L273 TraceCheckUtils]: 41: Hoare triple {18023#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {18024#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:12,683 INFO L273 TraceCheckUtils]: 42: Hoare triple {18024#(<= main_~i~0 9)} assume true; {18024#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:12,683 INFO L273 TraceCheckUtils]: 43: Hoare triple {18024#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18024#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:12,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {18024#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18024#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:12,684 INFO L273 TraceCheckUtils]: 45: Hoare triple {18024#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {18025#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:12,685 INFO L273 TraceCheckUtils]: 46: Hoare triple {18025#(<= main_~i~0 10)} assume true; {18025#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:12,685 INFO L273 TraceCheckUtils]: 47: Hoare triple {18025#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18025#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:12,686 INFO L273 TraceCheckUtils]: 48: Hoare triple {18025#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18025#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:12,686 INFO L273 TraceCheckUtils]: 49: Hoare triple {18025#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {18026#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:12,687 INFO L273 TraceCheckUtils]: 50: Hoare triple {18026#(<= main_~i~0 11)} assume true; {18026#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:12,687 INFO L273 TraceCheckUtils]: 51: Hoare triple {18026#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18026#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:12,688 INFO L273 TraceCheckUtils]: 52: Hoare triple {18026#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18026#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:12,688 INFO L273 TraceCheckUtils]: 53: Hoare triple {18026#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {18027#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:12,689 INFO L273 TraceCheckUtils]: 54: Hoare triple {18027#(<= main_~i~0 12)} assume true; {18027#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:12,689 INFO L273 TraceCheckUtils]: 55: Hoare triple {18027#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18027#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:12,690 INFO L273 TraceCheckUtils]: 56: Hoare triple {18027#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18027#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:12,690 INFO L273 TraceCheckUtils]: 57: Hoare triple {18027#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {18028#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:12,691 INFO L273 TraceCheckUtils]: 58: Hoare triple {18028#(<= main_~i~0 13)} assume true; {18028#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:12,691 INFO L273 TraceCheckUtils]: 59: Hoare triple {18028#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18028#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:12,692 INFO L273 TraceCheckUtils]: 60: Hoare triple {18028#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18028#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:12,693 INFO L273 TraceCheckUtils]: 61: Hoare triple {18028#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {18029#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:12,693 INFO L273 TraceCheckUtils]: 62: Hoare triple {18029#(<= main_~i~0 14)} assume true; {18029#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:12,693 INFO L273 TraceCheckUtils]: 63: Hoare triple {18029#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18029#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:12,694 INFO L273 TraceCheckUtils]: 64: Hoare triple {18029#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18029#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:12,695 INFO L273 TraceCheckUtils]: 65: Hoare triple {18029#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {18030#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:12,695 INFO L273 TraceCheckUtils]: 66: Hoare triple {18030#(<= main_~i~0 15)} assume true; {18030#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:12,696 INFO L273 TraceCheckUtils]: 67: Hoare triple {18030#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18030#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:12,696 INFO L273 TraceCheckUtils]: 68: Hoare triple {18030#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18030#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:12,697 INFO L273 TraceCheckUtils]: 69: Hoare triple {18030#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {18031#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:12,697 INFO L273 TraceCheckUtils]: 70: Hoare triple {18031#(<= main_~i~0 16)} assume true; {18031#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:12,698 INFO L273 TraceCheckUtils]: 71: Hoare triple {18031#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18031#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:12,698 INFO L273 TraceCheckUtils]: 72: Hoare triple {18031#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18031#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:12,699 INFO L273 TraceCheckUtils]: 73: Hoare triple {18031#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {18032#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:12,699 INFO L273 TraceCheckUtils]: 74: Hoare triple {18032#(<= main_~i~0 17)} assume true; {18032#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:12,700 INFO L273 TraceCheckUtils]: 75: Hoare triple {18032#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18032#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:12,700 INFO L273 TraceCheckUtils]: 76: Hoare triple {18032#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18032#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:12,701 INFO L273 TraceCheckUtils]: 77: Hoare triple {18032#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {18033#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:12,701 INFO L273 TraceCheckUtils]: 78: Hoare triple {18033#(<= main_~i~0 18)} assume true; {18033#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:12,702 INFO L273 TraceCheckUtils]: 79: Hoare triple {18033#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18033#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:12,702 INFO L273 TraceCheckUtils]: 80: Hoare triple {18033#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18033#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:12,703 INFO L273 TraceCheckUtils]: 81: Hoare triple {18033#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {18034#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:12,703 INFO L273 TraceCheckUtils]: 82: Hoare triple {18034#(<= main_~i~0 19)} assume true; {18034#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:12,704 INFO L273 TraceCheckUtils]: 83: Hoare triple {18034#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18034#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:12,704 INFO L273 TraceCheckUtils]: 84: Hoare triple {18034#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18034#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:12,705 INFO L273 TraceCheckUtils]: 85: Hoare triple {18034#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {18035#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:12,705 INFO L273 TraceCheckUtils]: 86: Hoare triple {18035#(<= main_~i~0 20)} assume true; {18035#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:12,706 INFO L273 TraceCheckUtils]: 87: Hoare triple {18035#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18035#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:12,706 INFO L273 TraceCheckUtils]: 88: Hoare triple {18035#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18035#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:12,707 INFO L273 TraceCheckUtils]: 89: Hoare triple {18035#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {18036#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:12,708 INFO L273 TraceCheckUtils]: 90: Hoare triple {18036#(<= main_~i~0 21)} assume true; {18036#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:12,708 INFO L273 TraceCheckUtils]: 91: Hoare triple {18036#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18036#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:12,708 INFO L273 TraceCheckUtils]: 92: Hoare triple {18036#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18036#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:12,709 INFO L273 TraceCheckUtils]: 93: Hoare triple {18036#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {18037#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:12,710 INFO L273 TraceCheckUtils]: 94: Hoare triple {18037#(<= main_~i~0 22)} assume true; {18037#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:12,710 INFO L273 TraceCheckUtils]: 95: Hoare triple {18037#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18037#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:12,711 INFO L273 TraceCheckUtils]: 96: Hoare triple {18037#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18037#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:12,711 INFO L273 TraceCheckUtils]: 97: Hoare triple {18037#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {18038#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:12,712 INFO L273 TraceCheckUtils]: 98: Hoare triple {18038#(<= main_~i~0 23)} assume true; {18038#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:12,712 INFO L273 TraceCheckUtils]: 99: Hoare triple {18038#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18038#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:12,713 INFO L273 TraceCheckUtils]: 100: Hoare triple {18038#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18038#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:12,715 INFO L273 TraceCheckUtils]: 101: Hoare triple {18038#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {18039#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:12,716 INFO L273 TraceCheckUtils]: 102: Hoare triple {18039#(<= main_~i~0 24)} assume true; {18039#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:12,716 INFO L273 TraceCheckUtils]: 103: Hoare triple {18039#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18039#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:12,716 INFO L273 TraceCheckUtils]: 104: Hoare triple {18039#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18039#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:12,717 INFO L273 TraceCheckUtils]: 105: Hoare triple {18039#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {18040#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:12,717 INFO L273 TraceCheckUtils]: 106: Hoare triple {18040#(<= main_~i~0 25)} assume true; {18040#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:12,717 INFO L273 TraceCheckUtils]: 107: Hoare triple {18040#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18040#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:12,718 INFO L273 TraceCheckUtils]: 108: Hoare triple {18040#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18040#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:12,718 INFO L273 TraceCheckUtils]: 109: Hoare triple {18040#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {18041#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:12,719 INFO L273 TraceCheckUtils]: 110: Hoare triple {18041#(<= main_~i~0 26)} assume true; {18041#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:12,719 INFO L273 TraceCheckUtils]: 111: Hoare triple {18041#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18041#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:12,720 INFO L273 TraceCheckUtils]: 112: Hoare triple {18041#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18041#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:12,720 INFO L273 TraceCheckUtils]: 113: Hoare triple {18041#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {18042#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:12,721 INFO L273 TraceCheckUtils]: 114: Hoare triple {18042#(<= main_~i~0 27)} assume true; {18042#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:12,721 INFO L273 TraceCheckUtils]: 115: Hoare triple {18042#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18042#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:12,722 INFO L273 TraceCheckUtils]: 116: Hoare triple {18042#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18042#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:12,722 INFO L273 TraceCheckUtils]: 117: Hoare triple {18042#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {18043#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:12,723 INFO L273 TraceCheckUtils]: 118: Hoare triple {18043#(<= main_~i~0 28)} assume true; {18043#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:12,723 INFO L273 TraceCheckUtils]: 119: Hoare triple {18043#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18043#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:12,724 INFO L273 TraceCheckUtils]: 120: Hoare triple {18043#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18043#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:12,725 INFO L273 TraceCheckUtils]: 121: Hoare triple {18043#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {18044#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:12,725 INFO L273 TraceCheckUtils]: 122: Hoare triple {18044#(<= main_~i~0 29)} assume true; {18044#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:12,726 INFO L273 TraceCheckUtils]: 123: Hoare triple {18044#(<= main_~i~0 29)} assume !(~i~0 < 100000); {18014#false} is VALID [2018-11-18 22:57:12,726 INFO L273 TraceCheckUtils]: 124: Hoare triple {18014#false} havoc ~x~0;~x~0 := 0; {18014#false} is VALID [2018-11-18 22:57:12,726 INFO L273 TraceCheckUtils]: 125: Hoare triple {18014#false} assume true; {18014#false} is VALID [2018-11-18 22:57:12,726 INFO L273 TraceCheckUtils]: 126: Hoare triple {18014#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {18014#false} is VALID [2018-11-18 22:57:12,726 INFO L256 TraceCheckUtils]: 127: Hoare triple {18014#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {18014#false} is VALID [2018-11-18 22:57:12,727 INFO L273 TraceCheckUtils]: 128: Hoare triple {18014#false} ~cond := #in~cond; {18014#false} is VALID [2018-11-18 22:57:12,727 INFO L273 TraceCheckUtils]: 129: Hoare triple {18014#false} assume 0 == ~cond; {18014#false} is VALID [2018-11-18 22:57:12,727 INFO L273 TraceCheckUtils]: 130: Hoare triple {18014#false} assume !false; {18014#false} is VALID [2018-11-18 22:57:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:12,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:12,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-18 22:57:12,759 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2018-11-18 22:57:12,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:12,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-18 22:57:12,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:12,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-18 22:57:12,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-18 22:57:12,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 22:57:12,877 INFO L87 Difference]: Start difference. First operand 136 states and 166 transitions. Second operand 33 states. [2018-11-18 22:57:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:13,603 INFO L93 Difference]: Finished difference Result 154 states and 187 transitions. [2018-11-18 22:57:13,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 22:57:13,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2018-11-18 22:57:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 22:57:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 187 transitions. [2018-11-18 22:57:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 22:57:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 187 transitions. [2018-11-18 22:57:13,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 187 transitions. [2018-11-18 22:57:13,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:13,765 INFO L225 Difference]: With dead ends: 154 [2018-11-18 22:57:13,765 INFO L226 Difference]: Without dead ends: 142 [2018-11-18 22:57:13,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 22:57:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-18 22:57:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-18 22:57:13,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:13,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2018-11-18 22:57:13,864 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2018-11-18 22:57:13,864 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2018-11-18 22:57:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:13,866 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2018-11-18 22:57:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2018-11-18 22:57:13,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:13,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:13,867 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2018-11-18 22:57:13,867 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2018-11-18 22:57:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:13,869 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2018-11-18 22:57:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2018-11-18 22:57:13,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:13,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:13,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:13,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 22:57:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 171 transitions. [2018-11-18 22:57:13,871 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 171 transitions. Word has length 131 [2018-11-18 22:57:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:13,871 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 171 transitions. [2018-11-18 22:57:13,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-18 22:57:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 171 transitions. [2018-11-18 22:57:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 22:57:13,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:13,872 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:13,872 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:13,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1489215850, now seen corresponding path program 30 times [2018-11-18 22:57:13,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:13,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:13,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:14,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {19095#true} call ULTIMATE.init(); {19095#true} is VALID [2018-11-18 22:57:14,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {19095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19095#true} is VALID [2018-11-18 22:57:14,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {19095#true} assume true; {19095#true} is VALID [2018-11-18 22:57:14,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19095#true} {19095#true} #57#return; {19095#true} is VALID [2018-11-18 22:57:14,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {19095#true} call #t~ret4 := main(); {19095#true} is VALID [2018-11-18 22:57:14,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {19095#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {19097#(= main_~i~0 0)} is VALID [2018-11-18 22:57:14,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {19097#(= main_~i~0 0)} assume true; {19097#(= main_~i~0 0)} is VALID [2018-11-18 22:57:14,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {19097#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19097#(= main_~i~0 0)} is VALID [2018-11-18 22:57:14,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {19097#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19097#(= main_~i~0 0)} is VALID [2018-11-18 22:57:14,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {19097#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {19098#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:14,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {19098#(<= main_~i~0 1)} assume true; {19098#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:14,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {19098#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19098#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:14,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {19098#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19098#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:14,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {19098#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {19099#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:14,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {19099#(<= main_~i~0 2)} assume true; {19099#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:14,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {19099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19099#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:14,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {19099#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19099#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:14,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {19099#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {19100#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:14,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {19100#(<= main_~i~0 3)} assume true; {19100#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:14,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {19100#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19100#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:14,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {19100#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19100#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:14,553 INFO L273 TraceCheckUtils]: 21: Hoare triple {19100#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {19101#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:14,554 INFO L273 TraceCheckUtils]: 22: Hoare triple {19101#(<= main_~i~0 4)} assume true; {19101#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:14,554 INFO L273 TraceCheckUtils]: 23: Hoare triple {19101#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19101#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:14,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {19101#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19101#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:14,556 INFO L273 TraceCheckUtils]: 25: Hoare triple {19101#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {19102#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:14,557 INFO L273 TraceCheckUtils]: 26: Hoare triple {19102#(<= main_~i~0 5)} assume true; {19102#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:14,557 INFO L273 TraceCheckUtils]: 27: Hoare triple {19102#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19102#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:14,558 INFO L273 TraceCheckUtils]: 28: Hoare triple {19102#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19102#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:14,558 INFO L273 TraceCheckUtils]: 29: Hoare triple {19102#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {19103#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:14,559 INFO L273 TraceCheckUtils]: 30: Hoare triple {19103#(<= main_~i~0 6)} assume true; {19103#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:14,559 INFO L273 TraceCheckUtils]: 31: Hoare triple {19103#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19103#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:14,560 INFO L273 TraceCheckUtils]: 32: Hoare triple {19103#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19103#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:14,561 INFO L273 TraceCheckUtils]: 33: Hoare triple {19103#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {19104#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:14,561 INFO L273 TraceCheckUtils]: 34: Hoare triple {19104#(<= main_~i~0 7)} assume true; {19104#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:14,562 INFO L273 TraceCheckUtils]: 35: Hoare triple {19104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19104#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:14,562 INFO L273 TraceCheckUtils]: 36: Hoare triple {19104#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19104#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:14,563 INFO L273 TraceCheckUtils]: 37: Hoare triple {19104#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {19105#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:14,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {19105#(<= main_~i~0 8)} assume true; {19105#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:14,564 INFO L273 TraceCheckUtils]: 39: Hoare triple {19105#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19105#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:14,564 INFO L273 TraceCheckUtils]: 40: Hoare triple {19105#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19105#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:14,565 INFO L273 TraceCheckUtils]: 41: Hoare triple {19105#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {19106#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:14,566 INFO L273 TraceCheckUtils]: 42: Hoare triple {19106#(<= main_~i~0 9)} assume true; {19106#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:14,566 INFO L273 TraceCheckUtils]: 43: Hoare triple {19106#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19106#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:14,567 INFO L273 TraceCheckUtils]: 44: Hoare triple {19106#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19106#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:14,567 INFO L273 TraceCheckUtils]: 45: Hoare triple {19106#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {19107#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:14,568 INFO L273 TraceCheckUtils]: 46: Hoare triple {19107#(<= main_~i~0 10)} assume true; {19107#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:14,568 INFO L273 TraceCheckUtils]: 47: Hoare triple {19107#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19107#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:14,569 INFO L273 TraceCheckUtils]: 48: Hoare triple {19107#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19107#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:14,569 INFO L273 TraceCheckUtils]: 49: Hoare triple {19107#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {19108#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:14,570 INFO L273 TraceCheckUtils]: 50: Hoare triple {19108#(<= main_~i~0 11)} assume true; {19108#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:14,570 INFO L273 TraceCheckUtils]: 51: Hoare triple {19108#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19108#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:14,571 INFO L273 TraceCheckUtils]: 52: Hoare triple {19108#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19108#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:14,572 INFO L273 TraceCheckUtils]: 53: Hoare triple {19108#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {19109#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:14,572 INFO L273 TraceCheckUtils]: 54: Hoare triple {19109#(<= main_~i~0 12)} assume true; {19109#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:14,573 INFO L273 TraceCheckUtils]: 55: Hoare triple {19109#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19109#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:14,573 INFO L273 TraceCheckUtils]: 56: Hoare triple {19109#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19109#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:14,574 INFO L273 TraceCheckUtils]: 57: Hoare triple {19109#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {19110#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:14,574 INFO L273 TraceCheckUtils]: 58: Hoare triple {19110#(<= main_~i~0 13)} assume true; {19110#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:14,575 INFO L273 TraceCheckUtils]: 59: Hoare triple {19110#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19110#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:14,575 INFO L273 TraceCheckUtils]: 60: Hoare triple {19110#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19110#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:14,576 INFO L273 TraceCheckUtils]: 61: Hoare triple {19110#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {19111#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:14,577 INFO L273 TraceCheckUtils]: 62: Hoare triple {19111#(<= main_~i~0 14)} assume true; {19111#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:14,577 INFO L273 TraceCheckUtils]: 63: Hoare triple {19111#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19111#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:14,578 INFO L273 TraceCheckUtils]: 64: Hoare triple {19111#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19111#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:14,578 INFO L273 TraceCheckUtils]: 65: Hoare triple {19111#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {19112#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:14,579 INFO L273 TraceCheckUtils]: 66: Hoare triple {19112#(<= main_~i~0 15)} assume true; {19112#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:14,579 INFO L273 TraceCheckUtils]: 67: Hoare triple {19112#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19112#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:14,580 INFO L273 TraceCheckUtils]: 68: Hoare triple {19112#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19112#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:14,580 INFO L273 TraceCheckUtils]: 69: Hoare triple {19112#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {19113#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:14,581 INFO L273 TraceCheckUtils]: 70: Hoare triple {19113#(<= main_~i~0 16)} assume true; {19113#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:14,581 INFO L273 TraceCheckUtils]: 71: Hoare triple {19113#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19113#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:14,582 INFO L273 TraceCheckUtils]: 72: Hoare triple {19113#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19113#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:14,582 INFO L273 TraceCheckUtils]: 73: Hoare triple {19113#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {19114#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:14,583 INFO L273 TraceCheckUtils]: 74: Hoare triple {19114#(<= main_~i~0 17)} assume true; {19114#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:14,583 INFO L273 TraceCheckUtils]: 75: Hoare triple {19114#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19114#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:14,584 INFO L273 TraceCheckUtils]: 76: Hoare triple {19114#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19114#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:14,585 INFO L273 TraceCheckUtils]: 77: Hoare triple {19114#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {19115#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:14,585 INFO L273 TraceCheckUtils]: 78: Hoare triple {19115#(<= main_~i~0 18)} assume true; {19115#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:14,585 INFO L273 TraceCheckUtils]: 79: Hoare triple {19115#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19115#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:14,586 INFO L273 TraceCheckUtils]: 80: Hoare triple {19115#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19115#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:14,587 INFO L273 TraceCheckUtils]: 81: Hoare triple {19115#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {19116#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:14,587 INFO L273 TraceCheckUtils]: 82: Hoare triple {19116#(<= main_~i~0 19)} assume true; {19116#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:14,588 INFO L273 TraceCheckUtils]: 83: Hoare triple {19116#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19116#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:14,588 INFO L273 TraceCheckUtils]: 84: Hoare triple {19116#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19116#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:14,589 INFO L273 TraceCheckUtils]: 85: Hoare triple {19116#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {19117#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:14,589 INFO L273 TraceCheckUtils]: 86: Hoare triple {19117#(<= main_~i~0 20)} assume true; {19117#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:14,590 INFO L273 TraceCheckUtils]: 87: Hoare triple {19117#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19117#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:14,590 INFO L273 TraceCheckUtils]: 88: Hoare triple {19117#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19117#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:14,591 INFO L273 TraceCheckUtils]: 89: Hoare triple {19117#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {19118#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:14,591 INFO L273 TraceCheckUtils]: 90: Hoare triple {19118#(<= main_~i~0 21)} assume true; {19118#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:14,592 INFO L273 TraceCheckUtils]: 91: Hoare triple {19118#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19118#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:14,592 INFO L273 TraceCheckUtils]: 92: Hoare triple {19118#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19118#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:14,593 INFO L273 TraceCheckUtils]: 93: Hoare triple {19118#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {19119#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:14,593 INFO L273 TraceCheckUtils]: 94: Hoare triple {19119#(<= main_~i~0 22)} assume true; {19119#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:14,594 INFO L273 TraceCheckUtils]: 95: Hoare triple {19119#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19119#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:14,594 INFO L273 TraceCheckUtils]: 96: Hoare triple {19119#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19119#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:14,595 INFO L273 TraceCheckUtils]: 97: Hoare triple {19119#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {19120#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:14,595 INFO L273 TraceCheckUtils]: 98: Hoare triple {19120#(<= main_~i~0 23)} assume true; {19120#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:14,596 INFO L273 TraceCheckUtils]: 99: Hoare triple {19120#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19120#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:14,596 INFO L273 TraceCheckUtils]: 100: Hoare triple {19120#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19120#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:14,597 INFO L273 TraceCheckUtils]: 101: Hoare triple {19120#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {19121#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:14,598 INFO L273 TraceCheckUtils]: 102: Hoare triple {19121#(<= main_~i~0 24)} assume true; {19121#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:14,598 INFO L273 TraceCheckUtils]: 103: Hoare triple {19121#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19121#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:14,598 INFO L273 TraceCheckUtils]: 104: Hoare triple {19121#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19121#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:14,599 INFO L273 TraceCheckUtils]: 105: Hoare triple {19121#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {19122#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:14,600 INFO L273 TraceCheckUtils]: 106: Hoare triple {19122#(<= main_~i~0 25)} assume true; {19122#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:14,600 INFO L273 TraceCheckUtils]: 107: Hoare triple {19122#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19122#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:14,601 INFO L273 TraceCheckUtils]: 108: Hoare triple {19122#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19122#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:14,601 INFO L273 TraceCheckUtils]: 109: Hoare triple {19122#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {19123#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:14,602 INFO L273 TraceCheckUtils]: 110: Hoare triple {19123#(<= main_~i~0 26)} assume true; {19123#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:14,602 INFO L273 TraceCheckUtils]: 111: Hoare triple {19123#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19123#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:14,603 INFO L273 TraceCheckUtils]: 112: Hoare triple {19123#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19123#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:14,603 INFO L273 TraceCheckUtils]: 113: Hoare triple {19123#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {19124#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:14,604 INFO L273 TraceCheckUtils]: 114: Hoare triple {19124#(<= main_~i~0 27)} assume true; {19124#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:14,604 INFO L273 TraceCheckUtils]: 115: Hoare triple {19124#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19124#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:14,605 INFO L273 TraceCheckUtils]: 116: Hoare triple {19124#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19124#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:14,605 INFO L273 TraceCheckUtils]: 117: Hoare triple {19124#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {19125#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:14,606 INFO L273 TraceCheckUtils]: 118: Hoare triple {19125#(<= main_~i~0 28)} assume true; {19125#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:14,606 INFO L273 TraceCheckUtils]: 119: Hoare triple {19125#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19125#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:14,607 INFO L273 TraceCheckUtils]: 120: Hoare triple {19125#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19125#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:14,607 INFO L273 TraceCheckUtils]: 121: Hoare triple {19125#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {19126#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:14,608 INFO L273 TraceCheckUtils]: 122: Hoare triple {19126#(<= main_~i~0 29)} assume true; {19126#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:14,608 INFO L273 TraceCheckUtils]: 123: Hoare triple {19126#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19126#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:14,609 INFO L273 TraceCheckUtils]: 124: Hoare triple {19126#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19126#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:14,609 INFO L273 TraceCheckUtils]: 125: Hoare triple {19126#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {19127#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:14,610 INFO L273 TraceCheckUtils]: 126: Hoare triple {19127#(<= main_~i~0 30)} assume true; {19127#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:14,611 INFO L273 TraceCheckUtils]: 127: Hoare triple {19127#(<= main_~i~0 30)} assume !(~i~0 < 100000); {19096#false} is VALID [2018-11-18 22:57:14,611 INFO L273 TraceCheckUtils]: 128: Hoare triple {19096#false} havoc ~x~0;~x~0 := 0; {19096#false} is VALID [2018-11-18 22:57:14,611 INFO L273 TraceCheckUtils]: 129: Hoare triple {19096#false} assume true; {19096#false} is VALID [2018-11-18 22:57:14,611 INFO L273 TraceCheckUtils]: 130: Hoare triple {19096#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {19096#false} is VALID [2018-11-18 22:57:14,611 INFO L256 TraceCheckUtils]: 131: Hoare triple {19096#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {19096#false} is VALID [2018-11-18 22:57:14,611 INFO L273 TraceCheckUtils]: 132: Hoare triple {19096#false} ~cond := #in~cond; {19096#false} is VALID [2018-11-18 22:57:14,612 INFO L273 TraceCheckUtils]: 133: Hoare triple {19096#false} assume 0 == ~cond; {19096#false} is VALID [2018-11-18 22:57:14,612 INFO L273 TraceCheckUtils]: 134: Hoare triple {19096#false} assume !false; {19096#false} is VALID [2018-11-18 22:57:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:14,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:14,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:14,634 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:57:14,712 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-18 22:57:14,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:14,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:15,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {19095#true} call ULTIMATE.init(); {19095#true} is VALID [2018-11-18 22:57:15,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {19095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19095#true} is VALID [2018-11-18 22:57:15,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {19095#true} assume true; {19095#true} is VALID [2018-11-18 22:57:15,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19095#true} {19095#true} #57#return; {19095#true} is VALID [2018-11-18 22:57:15,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {19095#true} call #t~ret4 := main(); {19095#true} is VALID [2018-11-18 22:57:15,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {19095#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {19146#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:15,030 INFO L273 TraceCheckUtils]: 6: Hoare triple {19146#(<= main_~i~0 0)} assume true; {19146#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:15,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {19146#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19146#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:15,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {19146#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19146#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:15,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {19146#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {19098#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:15,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {19098#(<= main_~i~0 1)} assume true; {19098#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:15,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {19098#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19098#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:15,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {19098#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19098#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:15,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {19098#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {19099#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:15,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {19099#(<= main_~i~0 2)} assume true; {19099#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:15,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {19099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19099#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:15,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {19099#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19099#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:15,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {19099#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {19100#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:15,037 INFO L273 TraceCheckUtils]: 18: Hoare triple {19100#(<= main_~i~0 3)} assume true; {19100#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:15,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {19100#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19100#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:15,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {19100#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19100#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:15,038 INFO L273 TraceCheckUtils]: 21: Hoare triple {19100#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {19101#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:15,039 INFO L273 TraceCheckUtils]: 22: Hoare triple {19101#(<= main_~i~0 4)} assume true; {19101#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:15,039 INFO L273 TraceCheckUtils]: 23: Hoare triple {19101#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19101#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:15,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {19101#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19101#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:15,041 INFO L273 TraceCheckUtils]: 25: Hoare triple {19101#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {19102#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:15,041 INFO L273 TraceCheckUtils]: 26: Hoare triple {19102#(<= main_~i~0 5)} assume true; {19102#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:15,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {19102#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19102#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:15,042 INFO L273 TraceCheckUtils]: 28: Hoare triple {19102#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19102#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:15,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {19102#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {19103#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:15,043 INFO L273 TraceCheckUtils]: 30: Hoare triple {19103#(<= main_~i~0 6)} assume true; {19103#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:15,044 INFO L273 TraceCheckUtils]: 31: Hoare triple {19103#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19103#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:15,044 INFO L273 TraceCheckUtils]: 32: Hoare triple {19103#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19103#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:15,045 INFO L273 TraceCheckUtils]: 33: Hoare triple {19103#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {19104#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:15,046 INFO L273 TraceCheckUtils]: 34: Hoare triple {19104#(<= main_~i~0 7)} assume true; {19104#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:15,046 INFO L273 TraceCheckUtils]: 35: Hoare triple {19104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19104#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:15,047 INFO L273 TraceCheckUtils]: 36: Hoare triple {19104#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19104#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:15,047 INFO L273 TraceCheckUtils]: 37: Hoare triple {19104#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {19105#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:15,048 INFO L273 TraceCheckUtils]: 38: Hoare triple {19105#(<= main_~i~0 8)} assume true; {19105#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:15,048 INFO L273 TraceCheckUtils]: 39: Hoare triple {19105#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19105#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:15,049 INFO L273 TraceCheckUtils]: 40: Hoare triple {19105#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19105#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:15,049 INFO L273 TraceCheckUtils]: 41: Hoare triple {19105#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {19106#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:15,050 INFO L273 TraceCheckUtils]: 42: Hoare triple {19106#(<= main_~i~0 9)} assume true; {19106#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:15,050 INFO L273 TraceCheckUtils]: 43: Hoare triple {19106#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19106#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:15,051 INFO L273 TraceCheckUtils]: 44: Hoare triple {19106#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19106#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:15,052 INFO L273 TraceCheckUtils]: 45: Hoare triple {19106#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {19107#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:15,052 INFO L273 TraceCheckUtils]: 46: Hoare triple {19107#(<= main_~i~0 10)} assume true; {19107#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:15,053 INFO L273 TraceCheckUtils]: 47: Hoare triple {19107#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19107#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:15,053 INFO L273 TraceCheckUtils]: 48: Hoare triple {19107#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19107#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:15,054 INFO L273 TraceCheckUtils]: 49: Hoare triple {19107#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {19108#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:15,054 INFO L273 TraceCheckUtils]: 50: Hoare triple {19108#(<= main_~i~0 11)} assume true; {19108#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:15,055 INFO L273 TraceCheckUtils]: 51: Hoare triple {19108#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19108#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:15,055 INFO L273 TraceCheckUtils]: 52: Hoare triple {19108#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19108#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:15,056 INFO L273 TraceCheckUtils]: 53: Hoare triple {19108#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {19109#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:15,057 INFO L273 TraceCheckUtils]: 54: Hoare triple {19109#(<= main_~i~0 12)} assume true; {19109#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:15,057 INFO L273 TraceCheckUtils]: 55: Hoare triple {19109#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19109#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:15,058 INFO L273 TraceCheckUtils]: 56: Hoare triple {19109#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19109#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:15,058 INFO L273 TraceCheckUtils]: 57: Hoare triple {19109#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {19110#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:15,059 INFO L273 TraceCheckUtils]: 58: Hoare triple {19110#(<= main_~i~0 13)} assume true; {19110#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:15,059 INFO L273 TraceCheckUtils]: 59: Hoare triple {19110#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19110#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:15,060 INFO L273 TraceCheckUtils]: 60: Hoare triple {19110#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19110#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:15,060 INFO L273 TraceCheckUtils]: 61: Hoare triple {19110#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {19111#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:15,061 INFO L273 TraceCheckUtils]: 62: Hoare triple {19111#(<= main_~i~0 14)} assume true; {19111#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:15,061 INFO L273 TraceCheckUtils]: 63: Hoare triple {19111#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19111#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:15,062 INFO L273 TraceCheckUtils]: 64: Hoare triple {19111#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19111#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:15,063 INFO L273 TraceCheckUtils]: 65: Hoare triple {19111#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {19112#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:15,063 INFO L273 TraceCheckUtils]: 66: Hoare triple {19112#(<= main_~i~0 15)} assume true; {19112#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:15,064 INFO L273 TraceCheckUtils]: 67: Hoare triple {19112#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19112#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:15,064 INFO L273 TraceCheckUtils]: 68: Hoare triple {19112#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19112#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:15,065 INFO L273 TraceCheckUtils]: 69: Hoare triple {19112#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {19113#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:15,065 INFO L273 TraceCheckUtils]: 70: Hoare triple {19113#(<= main_~i~0 16)} assume true; {19113#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:15,066 INFO L273 TraceCheckUtils]: 71: Hoare triple {19113#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19113#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:15,066 INFO L273 TraceCheckUtils]: 72: Hoare triple {19113#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19113#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:15,067 INFO L273 TraceCheckUtils]: 73: Hoare triple {19113#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {19114#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:15,068 INFO L273 TraceCheckUtils]: 74: Hoare triple {19114#(<= main_~i~0 17)} assume true; {19114#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:15,068 INFO L273 TraceCheckUtils]: 75: Hoare triple {19114#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19114#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:15,069 INFO L273 TraceCheckUtils]: 76: Hoare triple {19114#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19114#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:15,069 INFO L273 TraceCheckUtils]: 77: Hoare triple {19114#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {19115#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:15,070 INFO L273 TraceCheckUtils]: 78: Hoare triple {19115#(<= main_~i~0 18)} assume true; {19115#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:15,070 INFO L273 TraceCheckUtils]: 79: Hoare triple {19115#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19115#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:15,071 INFO L273 TraceCheckUtils]: 80: Hoare triple {19115#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19115#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:15,072 INFO L273 TraceCheckUtils]: 81: Hoare triple {19115#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {19116#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:15,072 INFO L273 TraceCheckUtils]: 82: Hoare triple {19116#(<= main_~i~0 19)} assume true; {19116#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:15,073 INFO L273 TraceCheckUtils]: 83: Hoare triple {19116#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19116#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:15,073 INFO L273 TraceCheckUtils]: 84: Hoare triple {19116#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19116#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:15,074 INFO L273 TraceCheckUtils]: 85: Hoare triple {19116#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {19117#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:15,074 INFO L273 TraceCheckUtils]: 86: Hoare triple {19117#(<= main_~i~0 20)} assume true; {19117#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:15,075 INFO L273 TraceCheckUtils]: 87: Hoare triple {19117#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19117#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:15,075 INFO L273 TraceCheckUtils]: 88: Hoare triple {19117#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19117#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:15,076 INFO L273 TraceCheckUtils]: 89: Hoare triple {19117#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {19118#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:15,077 INFO L273 TraceCheckUtils]: 90: Hoare triple {19118#(<= main_~i~0 21)} assume true; {19118#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:15,077 INFO L273 TraceCheckUtils]: 91: Hoare triple {19118#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19118#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:15,078 INFO L273 TraceCheckUtils]: 92: Hoare triple {19118#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19118#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:15,078 INFO L273 TraceCheckUtils]: 93: Hoare triple {19118#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {19119#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:15,079 INFO L273 TraceCheckUtils]: 94: Hoare triple {19119#(<= main_~i~0 22)} assume true; {19119#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:15,079 INFO L273 TraceCheckUtils]: 95: Hoare triple {19119#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19119#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:15,080 INFO L273 TraceCheckUtils]: 96: Hoare triple {19119#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19119#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:15,080 INFO L273 TraceCheckUtils]: 97: Hoare triple {19119#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {19120#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:15,081 INFO L273 TraceCheckUtils]: 98: Hoare triple {19120#(<= main_~i~0 23)} assume true; {19120#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:15,081 INFO L273 TraceCheckUtils]: 99: Hoare triple {19120#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19120#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:15,082 INFO L273 TraceCheckUtils]: 100: Hoare triple {19120#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19120#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:15,083 INFO L273 TraceCheckUtils]: 101: Hoare triple {19120#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {19121#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:15,083 INFO L273 TraceCheckUtils]: 102: Hoare triple {19121#(<= main_~i~0 24)} assume true; {19121#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:15,084 INFO L273 TraceCheckUtils]: 103: Hoare triple {19121#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19121#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:15,084 INFO L273 TraceCheckUtils]: 104: Hoare triple {19121#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19121#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:15,085 INFO L273 TraceCheckUtils]: 105: Hoare triple {19121#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {19122#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:15,085 INFO L273 TraceCheckUtils]: 106: Hoare triple {19122#(<= main_~i~0 25)} assume true; {19122#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:15,086 INFO L273 TraceCheckUtils]: 107: Hoare triple {19122#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19122#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:15,086 INFO L273 TraceCheckUtils]: 108: Hoare triple {19122#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19122#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:15,087 INFO L273 TraceCheckUtils]: 109: Hoare triple {19122#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {19123#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:15,088 INFO L273 TraceCheckUtils]: 110: Hoare triple {19123#(<= main_~i~0 26)} assume true; {19123#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:15,088 INFO L273 TraceCheckUtils]: 111: Hoare triple {19123#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19123#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:15,089 INFO L273 TraceCheckUtils]: 112: Hoare triple {19123#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19123#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:15,089 INFO L273 TraceCheckUtils]: 113: Hoare triple {19123#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {19124#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:15,090 INFO L273 TraceCheckUtils]: 114: Hoare triple {19124#(<= main_~i~0 27)} assume true; {19124#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:15,090 INFO L273 TraceCheckUtils]: 115: Hoare triple {19124#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19124#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:15,091 INFO L273 TraceCheckUtils]: 116: Hoare triple {19124#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19124#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:15,092 INFO L273 TraceCheckUtils]: 117: Hoare triple {19124#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {19125#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:15,092 INFO L273 TraceCheckUtils]: 118: Hoare triple {19125#(<= main_~i~0 28)} assume true; {19125#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:15,093 INFO L273 TraceCheckUtils]: 119: Hoare triple {19125#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19125#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:15,093 INFO L273 TraceCheckUtils]: 120: Hoare triple {19125#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19125#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:15,094 INFO L273 TraceCheckUtils]: 121: Hoare triple {19125#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {19126#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:15,094 INFO L273 TraceCheckUtils]: 122: Hoare triple {19126#(<= main_~i~0 29)} assume true; {19126#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:15,095 INFO L273 TraceCheckUtils]: 123: Hoare triple {19126#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19126#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:15,095 INFO L273 TraceCheckUtils]: 124: Hoare triple {19126#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19126#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:15,096 INFO L273 TraceCheckUtils]: 125: Hoare triple {19126#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {19127#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:15,097 INFO L273 TraceCheckUtils]: 126: Hoare triple {19127#(<= main_~i~0 30)} assume true; {19127#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:15,097 INFO L273 TraceCheckUtils]: 127: Hoare triple {19127#(<= main_~i~0 30)} assume !(~i~0 < 100000); {19096#false} is VALID [2018-11-18 22:57:15,097 INFO L273 TraceCheckUtils]: 128: Hoare triple {19096#false} havoc ~x~0;~x~0 := 0; {19096#false} is VALID [2018-11-18 22:57:15,098 INFO L273 TraceCheckUtils]: 129: Hoare triple {19096#false} assume true; {19096#false} is VALID [2018-11-18 22:57:15,098 INFO L273 TraceCheckUtils]: 130: Hoare triple {19096#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {19096#false} is VALID [2018-11-18 22:57:15,098 INFO L256 TraceCheckUtils]: 131: Hoare triple {19096#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {19096#false} is VALID [2018-11-18 22:57:15,098 INFO L273 TraceCheckUtils]: 132: Hoare triple {19096#false} ~cond := #in~cond; {19096#false} is VALID [2018-11-18 22:57:15,098 INFO L273 TraceCheckUtils]: 133: Hoare triple {19096#false} assume 0 == ~cond; {19096#false} is VALID [2018-11-18 22:57:15,099 INFO L273 TraceCheckUtils]: 134: Hoare triple {19096#false} assume !false; {19096#false} is VALID [2018-11-18 22:57:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:15,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:15,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-18 22:57:15,131 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2018-11-18 22:57:15,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:15,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-18 22:57:15,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:15,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-18 22:57:15,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 22:57:15,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 22:57:15,270 INFO L87 Difference]: Start difference. First operand 140 states and 171 transitions. Second operand 34 states. [2018-11-18 22:57:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:16,174 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2018-11-18 22:57:16,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 22:57:16,175 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2018-11-18 22:57:16,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:57:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 192 transitions. [2018-11-18 22:57:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:57:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 192 transitions. [2018-11-18 22:57:16,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 192 transitions. [2018-11-18 22:57:16,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:16,737 INFO L225 Difference]: With dead ends: 158 [2018-11-18 22:57:16,737 INFO L226 Difference]: Without dead ends: 146 [2018-11-18 22:57:16,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 22:57:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-18 22:57:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-11-18 22:57:16,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:16,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 144 states. [2018-11-18 22:57:16,766 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 144 states. [2018-11-18 22:57:16,766 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 144 states. [2018-11-18 22:57:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:16,769 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2018-11-18 22:57:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2018-11-18 22:57:16,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:16,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:16,770 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 146 states. [2018-11-18 22:57:16,770 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 146 states. [2018-11-18 22:57:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:16,772 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2018-11-18 22:57:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2018-11-18 22:57:16,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:16,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:16,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:16,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 22:57:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 176 transitions. [2018-11-18 22:57:16,775 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 176 transitions. Word has length 135 [2018-11-18 22:57:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:16,775 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 176 transitions. [2018-11-18 22:57:16,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-18 22:57:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2018-11-18 22:57:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 22:57:16,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:16,777 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:16,777 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:16,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:16,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1984020460, now seen corresponding path program 31 times [2018-11-18 22:57:16,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:16,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:16,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:17,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {20208#true} call ULTIMATE.init(); {20208#true} is VALID [2018-11-18 22:57:17,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {20208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20208#true} is VALID [2018-11-18 22:57:17,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {20208#true} assume true; {20208#true} is VALID [2018-11-18 22:57:17,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20208#true} {20208#true} #57#return; {20208#true} is VALID [2018-11-18 22:57:17,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {20208#true} call #t~ret4 := main(); {20208#true} is VALID [2018-11-18 22:57:17,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {20208#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {20210#(= main_~i~0 0)} is VALID [2018-11-18 22:57:17,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {20210#(= main_~i~0 0)} assume true; {20210#(= main_~i~0 0)} is VALID [2018-11-18 22:57:17,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {20210#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20210#(= main_~i~0 0)} is VALID [2018-11-18 22:57:17,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {20210#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20210#(= main_~i~0 0)} is VALID [2018-11-18 22:57:17,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {20210#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {20211#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {20211#(<= main_~i~0 1)} assume true; {20211#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {20211#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20211#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {20211#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20211#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {20211#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {20212#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {20212#(<= main_~i~0 2)} assume true; {20212#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {20212#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20212#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {20212#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20212#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {20212#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {20213#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {20213#(<= main_~i~0 3)} assume true; {20213#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {20213#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20213#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {20213#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20213#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {20213#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {20214#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {20214#(<= main_~i~0 4)} assume true; {20214#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {20214#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20214#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {20214#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20214#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {20214#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {20215#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {20215#(<= main_~i~0 5)} assume true; {20215#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {20215#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20215#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,468 INFO L273 TraceCheckUtils]: 28: Hoare triple {20215#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20215#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {20215#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {20216#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {20216#(<= main_~i~0 6)} assume true; {20216#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,470 INFO L273 TraceCheckUtils]: 31: Hoare triple {20216#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20216#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,471 INFO L273 TraceCheckUtils]: 32: Hoare triple {20216#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20216#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,471 INFO L273 TraceCheckUtils]: 33: Hoare triple {20216#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {20217#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {20217#(<= main_~i~0 7)} assume true; {20217#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,472 INFO L273 TraceCheckUtils]: 35: Hoare triple {20217#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20217#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {20217#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20217#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,473 INFO L273 TraceCheckUtils]: 37: Hoare triple {20217#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {20218#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {20218#(<= main_~i~0 8)} assume true; {20218#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,474 INFO L273 TraceCheckUtils]: 39: Hoare triple {20218#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20218#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,475 INFO L273 TraceCheckUtils]: 40: Hoare triple {20218#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20218#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,475 INFO L273 TraceCheckUtils]: 41: Hoare triple {20218#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {20219#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,476 INFO L273 TraceCheckUtils]: 42: Hoare triple {20219#(<= main_~i~0 9)} assume true; {20219#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,476 INFO L273 TraceCheckUtils]: 43: Hoare triple {20219#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20219#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,477 INFO L273 TraceCheckUtils]: 44: Hoare triple {20219#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20219#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {20219#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {20220#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,478 INFO L273 TraceCheckUtils]: 46: Hoare triple {20220#(<= main_~i~0 10)} assume true; {20220#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,478 INFO L273 TraceCheckUtils]: 47: Hoare triple {20220#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20220#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,479 INFO L273 TraceCheckUtils]: 48: Hoare triple {20220#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20220#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,480 INFO L273 TraceCheckUtils]: 49: Hoare triple {20220#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {20221#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,480 INFO L273 TraceCheckUtils]: 50: Hoare triple {20221#(<= main_~i~0 11)} assume true; {20221#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,480 INFO L273 TraceCheckUtils]: 51: Hoare triple {20221#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20221#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {20221#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20221#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,482 INFO L273 TraceCheckUtils]: 53: Hoare triple {20221#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {20222#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,482 INFO L273 TraceCheckUtils]: 54: Hoare triple {20222#(<= main_~i~0 12)} assume true; {20222#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,483 INFO L273 TraceCheckUtils]: 55: Hoare triple {20222#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20222#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,483 INFO L273 TraceCheckUtils]: 56: Hoare triple {20222#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20222#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,484 INFO L273 TraceCheckUtils]: 57: Hoare triple {20222#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {20223#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,484 INFO L273 TraceCheckUtils]: 58: Hoare triple {20223#(<= main_~i~0 13)} assume true; {20223#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,485 INFO L273 TraceCheckUtils]: 59: Hoare triple {20223#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20223#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,485 INFO L273 TraceCheckUtils]: 60: Hoare triple {20223#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20223#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,486 INFO L273 TraceCheckUtils]: 61: Hoare triple {20223#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {20224#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,486 INFO L273 TraceCheckUtils]: 62: Hoare triple {20224#(<= main_~i~0 14)} assume true; {20224#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,487 INFO L273 TraceCheckUtils]: 63: Hoare triple {20224#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20224#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,487 INFO L273 TraceCheckUtils]: 64: Hoare triple {20224#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20224#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,488 INFO L273 TraceCheckUtils]: 65: Hoare triple {20224#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {20225#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,488 INFO L273 TraceCheckUtils]: 66: Hoare triple {20225#(<= main_~i~0 15)} assume true; {20225#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,489 INFO L273 TraceCheckUtils]: 67: Hoare triple {20225#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20225#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,489 INFO L273 TraceCheckUtils]: 68: Hoare triple {20225#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20225#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,490 INFO L273 TraceCheckUtils]: 69: Hoare triple {20225#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {20226#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,490 INFO L273 TraceCheckUtils]: 70: Hoare triple {20226#(<= main_~i~0 16)} assume true; {20226#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,491 INFO L273 TraceCheckUtils]: 71: Hoare triple {20226#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20226#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,491 INFO L273 TraceCheckUtils]: 72: Hoare triple {20226#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20226#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,492 INFO L273 TraceCheckUtils]: 73: Hoare triple {20226#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {20227#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,492 INFO L273 TraceCheckUtils]: 74: Hoare triple {20227#(<= main_~i~0 17)} assume true; {20227#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,493 INFO L273 TraceCheckUtils]: 75: Hoare triple {20227#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20227#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,493 INFO L273 TraceCheckUtils]: 76: Hoare triple {20227#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20227#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,494 INFO L273 TraceCheckUtils]: 77: Hoare triple {20227#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {20228#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,495 INFO L273 TraceCheckUtils]: 78: Hoare triple {20228#(<= main_~i~0 18)} assume true; {20228#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,495 INFO L273 TraceCheckUtils]: 79: Hoare triple {20228#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20228#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,496 INFO L273 TraceCheckUtils]: 80: Hoare triple {20228#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20228#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,496 INFO L273 TraceCheckUtils]: 81: Hoare triple {20228#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {20229#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,497 INFO L273 TraceCheckUtils]: 82: Hoare triple {20229#(<= main_~i~0 19)} assume true; {20229#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,497 INFO L273 TraceCheckUtils]: 83: Hoare triple {20229#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20229#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,498 INFO L273 TraceCheckUtils]: 84: Hoare triple {20229#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20229#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,498 INFO L273 TraceCheckUtils]: 85: Hoare triple {20229#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {20230#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,499 INFO L273 TraceCheckUtils]: 86: Hoare triple {20230#(<= main_~i~0 20)} assume true; {20230#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,499 INFO L273 TraceCheckUtils]: 87: Hoare triple {20230#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20230#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,500 INFO L273 TraceCheckUtils]: 88: Hoare triple {20230#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20230#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,500 INFO L273 TraceCheckUtils]: 89: Hoare triple {20230#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {20231#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:17,501 INFO L273 TraceCheckUtils]: 90: Hoare triple {20231#(<= main_~i~0 21)} assume true; {20231#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:17,501 INFO L273 TraceCheckUtils]: 91: Hoare triple {20231#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20231#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:17,502 INFO L273 TraceCheckUtils]: 92: Hoare triple {20231#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20231#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:17,502 INFO L273 TraceCheckUtils]: 93: Hoare triple {20231#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {20232#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:17,503 INFO L273 TraceCheckUtils]: 94: Hoare triple {20232#(<= main_~i~0 22)} assume true; {20232#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:17,503 INFO L273 TraceCheckUtils]: 95: Hoare triple {20232#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20232#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:17,504 INFO L273 TraceCheckUtils]: 96: Hoare triple {20232#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20232#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:17,505 INFO L273 TraceCheckUtils]: 97: Hoare triple {20232#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {20233#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:17,505 INFO L273 TraceCheckUtils]: 98: Hoare triple {20233#(<= main_~i~0 23)} assume true; {20233#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:17,505 INFO L273 TraceCheckUtils]: 99: Hoare triple {20233#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20233#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:17,506 INFO L273 TraceCheckUtils]: 100: Hoare triple {20233#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20233#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:17,507 INFO L273 TraceCheckUtils]: 101: Hoare triple {20233#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {20234#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:17,507 INFO L273 TraceCheckUtils]: 102: Hoare triple {20234#(<= main_~i~0 24)} assume true; {20234#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:17,508 INFO L273 TraceCheckUtils]: 103: Hoare triple {20234#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20234#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:17,508 INFO L273 TraceCheckUtils]: 104: Hoare triple {20234#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20234#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:17,509 INFO L273 TraceCheckUtils]: 105: Hoare triple {20234#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {20235#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:17,509 INFO L273 TraceCheckUtils]: 106: Hoare triple {20235#(<= main_~i~0 25)} assume true; {20235#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:17,510 INFO L273 TraceCheckUtils]: 107: Hoare triple {20235#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20235#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:17,510 INFO L273 TraceCheckUtils]: 108: Hoare triple {20235#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20235#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:17,511 INFO L273 TraceCheckUtils]: 109: Hoare triple {20235#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {20236#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:17,511 INFO L273 TraceCheckUtils]: 110: Hoare triple {20236#(<= main_~i~0 26)} assume true; {20236#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:17,512 INFO L273 TraceCheckUtils]: 111: Hoare triple {20236#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20236#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:17,512 INFO L273 TraceCheckUtils]: 112: Hoare triple {20236#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20236#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:17,513 INFO L273 TraceCheckUtils]: 113: Hoare triple {20236#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {20237#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:17,513 INFO L273 TraceCheckUtils]: 114: Hoare triple {20237#(<= main_~i~0 27)} assume true; {20237#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:17,514 INFO L273 TraceCheckUtils]: 115: Hoare triple {20237#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20237#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:17,514 INFO L273 TraceCheckUtils]: 116: Hoare triple {20237#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20237#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:17,515 INFO L273 TraceCheckUtils]: 117: Hoare triple {20237#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {20238#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:17,515 INFO L273 TraceCheckUtils]: 118: Hoare triple {20238#(<= main_~i~0 28)} assume true; {20238#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:17,516 INFO L273 TraceCheckUtils]: 119: Hoare triple {20238#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20238#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:17,516 INFO L273 TraceCheckUtils]: 120: Hoare triple {20238#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20238#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:17,517 INFO L273 TraceCheckUtils]: 121: Hoare triple {20238#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {20239#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:17,517 INFO L273 TraceCheckUtils]: 122: Hoare triple {20239#(<= main_~i~0 29)} assume true; {20239#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:17,518 INFO L273 TraceCheckUtils]: 123: Hoare triple {20239#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20239#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:17,518 INFO L273 TraceCheckUtils]: 124: Hoare triple {20239#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20239#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:17,519 INFO L273 TraceCheckUtils]: 125: Hoare triple {20239#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {20240#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:17,520 INFO L273 TraceCheckUtils]: 126: Hoare triple {20240#(<= main_~i~0 30)} assume true; {20240#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:17,520 INFO L273 TraceCheckUtils]: 127: Hoare triple {20240#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20240#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:17,520 INFO L273 TraceCheckUtils]: 128: Hoare triple {20240#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20240#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:17,521 INFO L273 TraceCheckUtils]: 129: Hoare triple {20240#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {20241#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:17,522 INFO L273 TraceCheckUtils]: 130: Hoare triple {20241#(<= main_~i~0 31)} assume true; {20241#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:17,522 INFO L273 TraceCheckUtils]: 131: Hoare triple {20241#(<= main_~i~0 31)} assume !(~i~0 < 100000); {20209#false} is VALID [2018-11-18 22:57:17,522 INFO L273 TraceCheckUtils]: 132: Hoare triple {20209#false} havoc ~x~0;~x~0 := 0; {20209#false} is VALID [2018-11-18 22:57:17,523 INFO L273 TraceCheckUtils]: 133: Hoare triple {20209#false} assume true; {20209#false} is VALID [2018-11-18 22:57:17,523 INFO L273 TraceCheckUtils]: 134: Hoare triple {20209#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {20209#false} is VALID [2018-11-18 22:57:17,523 INFO L256 TraceCheckUtils]: 135: Hoare triple {20209#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {20209#false} is VALID [2018-11-18 22:57:17,523 INFO L273 TraceCheckUtils]: 136: Hoare triple {20209#false} ~cond := #in~cond; {20209#false} is VALID [2018-11-18 22:57:17,523 INFO L273 TraceCheckUtils]: 137: Hoare triple {20209#false} assume 0 == ~cond; {20209#false} is VALID [2018-11-18 22:57:17,523 INFO L273 TraceCheckUtils]: 138: Hoare triple {20209#false} assume !false; {20209#false} is VALID [2018-11-18 22:57:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:17,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:17,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:17,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:17,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:17,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {20208#true} call ULTIMATE.init(); {20208#true} is VALID [2018-11-18 22:57:17,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {20208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20208#true} is VALID [2018-11-18 22:57:17,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {20208#true} assume true; {20208#true} is VALID [2018-11-18 22:57:17,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20208#true} {20208#true} #57#return; {20208#true} is VALID [2018-11-18 22:57:17,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {20208#true} call #t~ret4 := main(); {20208#true} is VALID [2018-11-18 22:57:17,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {20208#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {20260#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:17,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {20260#(<= main_~i~0 0)} assume true; {20260#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:17,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {20260#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20260#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:17,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {20260#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20260#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:17,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {20260#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {20211#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {20211#(<= main_~i~0 1)} assume true; {20211#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {20211#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20211#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {20211#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20211#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {20211#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {20212#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {20212#(<= main_~i~0 2)} assume true; {20212#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {20212#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20212#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {20212#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20212#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {20212#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {20213#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {20213#(<= main_~i~0 3)} assume true; {20213#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {20213#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20213#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {20213#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20213#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {20213#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {20214#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {20214#(<= main_~i~0 4)} assume true; {20214#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {20214#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20214#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {20214#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20214#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {20214#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {20215#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {20215#(<= main_~i~0 5)} assume true; {20215#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {20215#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20215#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {20215#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20215#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,874 INFO L273 TraceCheckUtils]: 29: Hoare triple {20215#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {20216#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,874 INFO L273 TraceCheckUtils]: 30: Hoare triple {20216#(<= main_~i~0 6)} assume true; {20216#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {20216#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20216#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {20216#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20216#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {20216#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {20217#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {20217#(<= main_~i~0 7)} assume true; {20217#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,877 INFO L273 TraceCheckUtils]: 35: Hoare triple {20217#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20217#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,878 INFO L273 TraceCheckUtils]: 36: Hoare triple {20217#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20217#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,878 INFO L273 TraceCheckUtils]: 37: Hoare triple {20217#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {20218#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,879 INFO L273 TraceCheckUtils]: 38: Hoare triple {20218#(<= main_~i~0 8)} assume true; {20218#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,879 INFO L273 TraceCheckUtils]: 39: Hoare triple {20218#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20218#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,880 INFO L273 TraceCheckUtils]: 40: Hoare triple {20218#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20218#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,880 INFO L273 TraceCheckUtils]: 41: Hoare triple {20218#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {20219#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,881 INFO L273 TraceCheckUtils]: 42: Hoare triple {20219#(<= main_~i~0 9)} assume true; {20219#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,881 INFO L273 TraceCheckUtils]: 43: Hoare triple {20219#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20219#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,882 INFO L273 TraceCheckUtils]: 44: Hoare triple {20219#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20219#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,883 INFO L273 TraceCheckUtils]: 45: Hoare triple {20219#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {20220#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,883 INFO L273 TraceCheckUtils]: 46: Hoare triple {20220#(<= main_~i~0 10)} assume true; {20220#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,884 INFO L273 TraceCheckUtils]: 47: Hoare triple {20220#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20220#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,884 INFO L273 TraceCheckUtils]: 48: Hoare triple {20220#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20220#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,885 INFO L273 TraceCheckUtils]: 49: Hoare triple {20220#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {20221#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,885 INFO L273 TraceCheckUtils]: 50: Hoare triple {20221#(<= main_~i~0 11)} assume true; {20221#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,886 INFO L273 TraceCheckUtils]: 51: Hoare triple {20221#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20221#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,886 INFO L273 TraceCheckUtils]: 52: Hoare triple {20221#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20221#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,887 INFO L273 TraceCheckUtils]: 53: Hoare triple {20221#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {20222#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,888 INFO L273 TraceCheckUtils]: 54: Hoare triple {20222#(<= main_~i~0 12)} assume true; {20222#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,888 INFO L273 TraceCheckUtils]: 55: Hoare triple {20222#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20222#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,889 INFO L273 TraceCheckUtils]: 56: Hoare triple {20222#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20222#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,889 INFO L273 TraceCheckUtils]: 57: Hoare triple {20222#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {20223#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,890 INFO L273 TraceCheckUtils]: 58: Hoare triple {20223#(<= main_~i~0 13)} assume true; {20223#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,890 INFO L273 TraceCheckUtils]: 59: Hoare triple {20223#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20223#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,891 INFO L273 TraceCheckUtils]: 60: Hoare triple {20223#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20223#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,892 INFO L273 TraceCheckUtils]: 61: Hoare triple {20223#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {20224#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,892 INFO L273 TraceCheckUtils]: 62: Hoare triple {20224#(<= main_~i~0 14)} assume true; {20224#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,893 INFO L273 TraceCheckUtils]: 63: Hoare triple {20224#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20224#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,893 INFO L273 TraceCheckUtils]: 64: Hoare triple {20224#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20224#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,894 INFO L273 TraceCheckUtils]: 65: Hoare triple {20224#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {20225#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,894 INFO L273 TraceCheckUtils]: 66: Hoare triple {20225#(<= main_~i~0 15)} assume true; {20225#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,895 INFO L273 TraceCheckUtils]: 67: Hoare triple {20225#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20225#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,895 INFO L273 TraceCheckUtils]: 68: Hoare triple {20225#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20225#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,896 INFO L273 TraceCheckUtils]: 69: Hoare triple {20225#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {20226#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,897 INFO L273 TraceCheckUtils]: 70: Hoare triple {20226#(<= main_~i~0 16)} assume true; {20226#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,897 INFO L273 TraceCheckUtils]: 71: Hoare triple {20226#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20226#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,897 INFO L273 TraceCheckUtils]: 72: Hoare triple {20226#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20226#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,898 INFO L273 TraceCheckUtils]: 73: Hoare triple {20226#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {20227#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,899 INFO L273 TraceCheckUtils]: 74: Hoare triple {20227#(<= main_~i~0 17)} assume true; {20227#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,899 INFO L273 TraceCheckUtils]: 75: Hoare triple {20227#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20227#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,900 INFO L273 TraceCheckUtils]: 76: Hoare triple {20227#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20227#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,900 INFO L273 TraceCheckUtils]: 77: Hoare triple {20227#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {20228#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,901 INFO L273 TraceCheckUtils]: 78: Hoare triple {20228#(<= main_~i~0 18)} assume true; {20228#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,901 INFO L273 TraceCheckUtils]: 79: Hoare triple {20228#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20228#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,902 INFO L273 TraceCheckUtils]: 80: Hoare triple {20228#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20228#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,903 INFO L273 TraceCheckUtils]: 81: Hoare triple {20228#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {20229#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,903 INFO L273 TraceCheckUtils]: 82: Hoare triple {20229#(<= main_~i~0 19)} assume true; {20229#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,904 INFO L273 TraceCheckUtils]: 83: Hoare triple {20229#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20229#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,904 INFO L273 TraceCheckUtils]: 84: Hoare triple {20229#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20229#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,905 INFO L273 TraceCheckUtils]: 85: Hoare triple {20229#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {20230#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,905 INFO L273 TraceCheckUtils]: 86: Hoare triple {20230#(<= main_~i~0 20)} assume true; {20230#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,906 INFO L273 TraceCheckUtils]: 87: Hoare triple {20230#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20230#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,906 INFO L273 TraceCheckUtils]: 88: Hoare triple {20230#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20230#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,907 INFO L273 TraceCheckUtils]: 89: Hoare triple {20230#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {20231#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:17,908 INFO L273 TraceCheckUtils]: 90: Hoare triple {20231#(<= main_~i~0 21)} assume true; {20231#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:17,908 INFO L273 TraceCheckUtils]: 91: Hoare triple {20231#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20231#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:17,909 INFO L273 TraceCheckUtils]: 92: Hoare triple {20231#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20231#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:17,909 INFO L273 TraceCheckUtils]: 93: Hoare triple {20231#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {20232#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:17,910 INFO L273 TraceCheckUtils]: 94: Hoare triple {20232#(<= main_~i~0 22)} assume true; {20232#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:17,910 INFO L273 TraceCheckUtils]: 95: Hoare triple {20232#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20232#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:17,911 INFO L273 TraceCheckUtils]: 96: Hoare triple {20232#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20232#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:17,911 INFO L273 TraceCheckUtils]: 97: Hoare triple {20232#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {20233#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:17,912 INFO L273 TraceCheckUtils]: 98: Hoare triple {20233#(<= main_~i~0 23)} assume true; {20233#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:17,912 INFO L273 TraceCheckUtils]: 99: Hoare triple {20233#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20233#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:17,913 INFO L273 TraceCheckUtils]: 100: Hoare triple {20233#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20233#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:17,914 INFO L273 TraceCheckUtils]: 101: Hoare triple {20233#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {20234#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:17,914 INFO L273 TraceCheckUtils]: 102: Hoare triple {20234#(<= main_~i~0 24)} assume true; {20234#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:17,915 INFO L273 TraceCheckUtils]: 103: Hoare triple {20234#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20234#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:17,915 INFO L273 TraceCheckUtils]: 104: Hoare triple {20234#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20234#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:17,916 INFO L273 TraceCheckUtils]: 105: Hoare triple {20234#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {20235#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:17,916 INFO L273 TraceCheckUtils]: 106: Hoare triple {20235#(<= main_~i~0 25)} assume true; {20235#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:17,917 INFO L273 TraceCheckUtils]: 107: Hoare triple {20235#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20235#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:17,917 INFO L273 TraceCheckUtils]: 108: Hoare triple {20235#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20235#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:17,918 INFO L273 TraceCheckUtils]: 109: Hoare triple {20235#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {20236#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:17,919 INFO L273 TraceCheckUtils]: 110: Hoare triple {20236#(<= main_~i~0 26)} assume true; {20236#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:17,919 INFO L273 TraceCheckUtils]: 111: Hoare triple {20236#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20236#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:17,920 INFO L273 TraceCheckUtils]: 112: Hoare triple {20236#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20236#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:17,920 INFO L273 TraceCheckUtils]: 113: Hoare triple {20236#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {20237#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:17,921 INFO L273 TraceCheckUtils]: 114: Hoare triple {20237#(<= main_~i~0 27)} assume true; {20237#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:17,921 INFO L273 TraceCheckUtils]: 115: Hoare triple {20237#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20237#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:17,922 INFO L273 TraceCheckUtils]: 116: Hoare triple {20237#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20237#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:17,923 INFO L273 TraceCheckUtils]: 117: Hoare triple {20237#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {20238#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:17,923 INFO L273 TraceCheckUtils]: 118: Hoare triple {20238#(<= main_~i~0 28)} assume true; {20238#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:17,924 INFO L273 TraceCheckUtils]: 119: Hoare triple {20238#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20238#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:17,924 INFO L273 TraceCheckUtils]: 120: Hoare triple {20238#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20238#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:17,925 INFO L273 TraceCheckUtils]: 121: Hoare triple {20238#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {20239#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:17,925 INFO L273 TraceCheckUtils]: 122: Hoare triple {20239#(<= main_~i~0 29)} assume true; {20239#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:17,926 INFO L273 TraceCheckUtils]: 123: Hoare triple {20239#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20239#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:17,926 INFO L273 TraceCheckUtils]: 124: Hoare triple {20239#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20239#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:17,927 INFO L273 TraceCheckUtils]: 125: Hoare triple {20239#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {20240#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:17,927 INFO L273 TraceCheckUtils]: 126: Hoare triple {20240#(<= main_~i~0 30)} assume true; {20240#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:17,928 INFO L273 TraceCheckUtils]: 127: Hoare triple {20240#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20240#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:17,928 INFO L273 TraceCheckUtils]: 128: Hoare triple {20240#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20240#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:17,929 INFO L273 TraceCheckUtils]: 129: Hoare triple {20240#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {20241#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:17,930 INFO L273 TraceCheckUtils]: 130: Hoare triple {20241#(<= main_~i~0 31)} assume true; {20241#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:17,930 INFO L273 TraceCheckUtils]: 131: Hoare triple {20241#(<= main_~i~0 31)} assume !(~i~0 < 100000); {20209#false} is VALID [2018-11-18 22:57:17,931 INFO L273 TraceCheckUtils]: 132: Hoare triple {20209#false} havoc ~x~0;~x~0 := 0; {20209#false} is VALID [2018-11-18 22:57:17,931 INFO L273 TraceCheckUtils]: 133: Hoare triple {20209#false} assume true; {20209#false} is VALID [2018-11-18 22:57:17,931 INFO L273 TraceCheckUtils]: 134: Hoare triple {20209#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {20209#false} is VALID [2018-11-18 22:57:17,931 INFO L256 TraceCheckUtils]: 135: Hoare triple {20209#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {20209#false} is VALID [2018-11-18 22:57:17,931 INFO L273 TraceCheckUtils]: 136: Hoare triple {20209#false} ~cond := #in~cond; {20209#false} is VALID [2018-11-18 22:57:17,931 INFO L273 TraceCheckUtils]: 137: Hoare triple {20209#false} assume 0 == ~cond; {20209#false} is VALID [2018-11-18 22:57:17,932 INFO L273 TraceCheckUtils]: 138: Hoare triple {20209#false} assume !false; {20209#false} is VALID [2018-11-18 22:57:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:17,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:17,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-18 22:57:17,966 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-11-18 22:57:17,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:17,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-18 22:57:18,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:18,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-18 22:57:18,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-18 22:57:18,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 22:57:18,134 INFO L87 Difference]: Start difference. First operand 144 states and 176 transitions. Second operand 35 states. [2018-11-18 22:57:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:18,661 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2018-11-18 22:57:18,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 22:57:18,661 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-11-18 22:57:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:57:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 197 transitions. [2018-11-18 22:57:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:57:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 197 transitions. [2018-11-18 22:57:18,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 197 transitions. [2018-11-18 22:57:18,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:18,843 INFO L225 Difference]: With dead ends: 162 [2018-11-18 22:57:18,843 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 22:57:18,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 22:57:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 22:57:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-18 22:57:19,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:19,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 148 states. [2018-11-18 22:57:19,189 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 148 states. [2018-11-18 22:57:19,190 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 148 states. [2018-11-18 22:57:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:19,192 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2018-11-18 22:57:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2018-11-18 22:57:19,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:19,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:19,193 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 150 states. [2018-11-18 22:57:19,193 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 150 states. [2018-11-18 22:57:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:19,195 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2018-11-18 22:57:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2018-11-18 22:57:19,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:19,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:19,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:19,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 22:57:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2018-11-18 22:57:19,198 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 139 [2018-11-18 22:57:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:19,198 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2018-11-18 22:57:19,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-18 22:57:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2018-11-18 22:57:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 22:57:19,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:19,199 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:19,200 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:19,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1771403710, now seen corresponding path program 32 times [2018-11-18 22:57:19,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:19,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:19,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:20,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {21352#true} call ULTIMATE.init(); {21352#true} is VALID [2018-11-18 22:57:20,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {21352#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21352#true} is VALID [2018-11-18 22:57:20,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {21352#true} assume true; {21352#true} is VALID [2018-11-18 22:57:20,031 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21352#true} {21352#true} #57#return; {21352#true} is VALID [2018-11-18 22:57:20,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {21352#true} call #t~ret4 := main(); {21352#true} is VALID [2018-11-18 22:57:20,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {21352#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {21354#(= main_~i~0 0)} is VALID [2018-11-18 22:57:20,032 INFO L273 TraceCheckUtils]: 6: Hoare triple {21354#(= main_~i~0 0)} assume true; {21354#(= main_~i~0 0)} is VALID [2018-11-18 22:57:20,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {21354#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21354#(= main_~i~0 0)} is VALID [2018-11-18 22:57:20,033 INFO L273 TraceCheckUtils]: 8: Hoare triple {21354#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21354#(= main_~i~0 0)} is VALID [2018-11-18 22:57:20,034 INFO L273 TraceCheckUtils]: 9: Hoare triple {21354#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {21355#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:20,034 INFO L273 TraceCheckUtils]: 10: Hoare triple {21355#(<= main_~i~0 1)} assume true; {21355#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:20,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {21355#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21355#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:20,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {21355#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21355#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:20,036 INFO L273 TraceCheckUtils]: 13: Hoare triple {21355#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {21356#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:20,036 INFO L273 TraceCheckUtils]: 14: Hoare triple {21356#(<= main_~i~0 2)} assume true; {21356#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:20,037 INFO L273 TraceCheckUtils]: 15: Hoare triple {21356#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21356#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:20,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {21356#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21356#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:20,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {21356#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {21357#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:20,038 INFO L273 TraceCheckUtils]: 18: Hoare triple {21357#(<= main_~i~0 3)} assume true; {21357#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:20,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {21357#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21357#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:20,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {21357#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21357#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:20,040 INFO L273 TraceCheckUtils]: 21: Hoare triple {21357#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {21358#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:20,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {21358#(<= main_~i~0 4)} assume true; {21358#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:20,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {21358#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21358#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:20,041 INFO L273 TraceCheckUtils]: 24: Hoare triple {21358#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21358#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:20,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {21358#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {21359#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:20,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {21359#(<= main_~i~0 5)} assume true; {21359#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:20,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {21359#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21359#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:20,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {21359#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21359#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:20,044 INFO L273 TraceCheckUtils]: 29: Hoare triple {21359#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {21360#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:20,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {21360#(<= main_~i~0 6)} assume true; {21360#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:20,045 INFO L273 TraceCheckUtils]: 31: Hoare triple {21360#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21360#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:20,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {21360#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21360#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:20,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {21360#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {21361#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:20,047 INFO L273 TraceCheckUtils]: 34: Hoare triple {21361#(<= main_~i~0 7)} assume true; {21361#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:20,048 INFO L273 TraceCheckUtils]: 35: Hoare triple {21361#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21361#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:20,048 INFO L273 TraceCheckUtils]: 36: Hoare triple {21361#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21361#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:20,049 INFO L273 TraceCheckUtils]: 37: Hoare triple {21361#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {21362#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:20,049 INFO L273 TraceCheckUtils]: 38: Hoare triple {21362#(<= main_~i~0 8)} assume true; {21362#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:20,050 INFO L273 TraceCheckUtils]: 39: Hoare triple {21362#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21362#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:20,050 INFO L273 TraceCheckUtils]: 40: Hoare triple {21362#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21362#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:20,051 INFO L273 TraceCheckUtils]: 41: Hoare triple {21362#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {21363#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:20,051 INFO L273 TraceCheckUtils]: 42: Hoare triple {21363#(<= main_~i~0 9)} assume true; {21363#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:20,052 INFO L273 TraceCheckUtils]: 43: Hoare triple {21363#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21363#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:20,052 INFO L273 TraceCheckUtils]: 44: Hoare triple {21363#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21363#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:20,053 INFO L273 TraceCheckUtils]: 45: Hoare triple {21363#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {21364#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:20,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {21364#(<= main_~i~0 10)} assume true; {21364#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:20,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {21364#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21364#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:20,055 INFO L273 TraceCheckUtils]: 48: Hoare triple {21364#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21364#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:20,055 INFO L273 TraceCheckUtils]: 49: Hoare triple {21364#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {21365#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:20,056 INFO L273 TraceCheckUtils]: 50: Hoare triple {21365#(<= main_~i~0 11)} assume true; {21365#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:20,056 INFO L273 TraceCheckUtils]: 51: Hoare triple {21365#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21365#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:20,057 INFO L273 TraceCheckUtils]: 52: Hoare triple {21365#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21365#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:20,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {21365#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {21366#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:20,058 INFO L273 TraceCheckUtils]: 54: Hoare triple {21366#(<= main_~i~0 12)} assume true; {21366#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:20,059 INFO L273 TraceCheckUtils]: 55: Hoare triple {21366#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21366#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:20,059 INFO L273 TraceCheckUtils]: 56: Hoare triple {21366#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21366#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:20,060 INFO L273 TraceCheckUtils]: 57: Hoare triple {21366#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {21367#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,060 INFO L273 TraceCheckUtils]: 58: Hoare triple {21367#(<= main_~i~0 13)} assume true; {21367#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,061 INFO L273 TraceCheckUtils]: 59: Hoare triple {21367#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21367#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,061 INFO L273 TraceCheckUtils]: 60: Hoare triple {21367#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21367#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,062 INFO L273 TraceCheckUtils]: 61: Hoare triple {21367#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {21368#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,062 INFO L273 TraceCheckUtils]: 62: Hoare triple {21368#(<= main_~i~0 14)} assume true; {21368#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,063 INFO L273 TraceCheckUtils]: 63: Hoare triple {21368#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21368#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,063 INFO L273 TraceCheckUtils]: 64: Hoare triple {21368#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21368#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,064 INFO L273 TraceCheckUtils]: 65: Hoare triple {21368#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {21369#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,065 INFO L273 TraceCheckUtils]: 66: Hoare triple {21369#(<= main_~i~0 15)} assume true; {21369#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,065 INFO L273 TraceCheckUtils]: 67: Hoare triple {21369#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21369#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,066 INFO L273 TraceCheckUtils]: 68: Hoare triple {21369#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21369#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,066 INFO L273 TraceCheckUtils]: 69: Hoare triple {21369#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {21370#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,067 INFO L273 TraceCheckUtils]: 70: Hoare triple {21370#(<= main_~i~0 16)} assume true; {21370#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,067 INFO L273 TraceCheckUtils]: 71: Hoare triple {21370#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21370#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,068 INFO L273 TraceCheckUtils]: 72: Hoare triple {21370#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21370#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,069 INFO L273 TraceCheckUtils]: 73: Hoare triple {21370#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {21371#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,069 INFO L273 TraceCheckUtils]: 74: Hoare triple {21371#(<= main_~i~0 17)} assume true; {21371#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,070 INFO L273 TraceCheckUtils]: 75: Hoare triple {21371#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21371#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,070 INFO L273 TraceCheckUtils]: 76: Hoare triple {21371#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21371#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,071 INFO L273 TraceCheckUtils]: 77: Hoare triple {21371#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {21372#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,071 INFO L273 TraceCheckUtils]: 78: Hoare triple {21372#(<= main_~i~0 18)} assume true; {21372#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,072 INFO L273 TraceCheckUtils]: 79: Hoare triple {21372#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21372#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,072 INFO L273 TraceCheckUtils]: 80: Hoare triple {21372#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21372#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,073 INFO L273 TraceCheckUtils]: 81: Hoare triple {21372#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {21373#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,074 INFO L273 TraceCheckUtils]: 82: Hoare triple {21373#(<= main_~i~0 19)} assume true; {21373#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,074 INFO L273 TraceCheckUtils]: 83: Hoare triple {21373#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21373#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,075 INFO L273 TraceCheckUtils]: 84: Hoare triple {21373#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21373#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,075 INFO L273 TraceCheckUtils]: 85: Hoare triple {21373#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {21374#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,076 INFO L273 TraceCheckUtils]: 86: Hoare triple {21374#(<= main_~i~0 20)} assume true; {21374#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,076 INFO L273 TraceCheckUtils]: 87: Hoare triple {21374#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21374#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,077 INFO L273 TraceCheckUtils]: 88: Hoare triple {21374#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21374#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,078 INFO L273 TraceCheckUtils]: 89: Hoare triple {21374#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {21375#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,078 INFO L273 TraceCheckUtils]: 90: Hoare triple {21375#(<= main_~i~0 21)} assume true; {21375#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,079 INFO L273 TraceCheckUtils]: 91: Hoare triple {21375#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21375#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,079 INFO L273 TraceCheckUtils]: 92: Hoare triple {21375#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21375#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,080 INFO L273 TraceCheckUtils]: 93: Hoare triple {21375#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {21376#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:20,080 INFO L273 TraceCheckUtils]: 94: Hoare triple {21376#(<= main_~i~0 22)} assume true; {21376#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:20,081 INFO L273 TraceCheckUtils]: 95: Hoare triple {21376#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21376#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:20,081 INFO L273 TraceCheckUtils]: 96: Hoare triple {21376#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21376#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:20,082 INFO L273 TraceCheckUtils]: 97: Hoare triple {21376#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {21377#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:20,082 INFO L273 TraceCheckUtils]: 98: Hoare triple {21377#(<= main_~i~0 23)} assume true; {21377#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:20,083 INFO L273 TraceCheckUtils]: 99: Hoare triple {21377#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21377#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:20,083 INFO L273 TraceCheckUtils]: 100: Hoare triple {21377#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21377#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:20,084 INFO L273 TraceCheckUtils]: 101: Hoare triple {21377#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {21378#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:20,084 INFO L273 TraceCheckUtils]: 102: Hoare triple {21378#(<= main_~i~0 24)} assume true; {21378#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:20,085 INFO L273 TraceCheckUtils]: 103: Hoare triple {21378#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21378#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:20,085 INFO L273 TraceCheckUtils]: 104: Hoare triple {21378#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21378#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:20,086 INFO L273 TraceCheckUtils]: 105: Hoare triple {21378#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {21379#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:20,086 INFO L273 TraceCheckUtils]: 106: Hoare triple {21379#(<= main_~i~0 25)} assume true; {21379#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:20,087 INFO L273 TraceCheckUtils]: 107: Hoare triple {21379#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21379#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:20,087 INFO L273 TraceCheckUtils]: 108: Hoare triple {21379#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21379#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:20,088 INFO L273 TraceCheckUtils]: 109: Hoare triple {21379#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {21380#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:20,089 INFO L273 TraceCheckUtils]: 110: Hoare triple {21380#(<= main_~i~0 26)} assume true; {21380#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:20,089 INFO L273 TraceCheckUtils]: 111: Hoare triple {21380#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21380#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:20,089 INFO L273 TraceCheckUtils]: 112: Hoare triple {21380#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21380#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:20,090 INFO L273 TraceCheckUtils]: 113: Hoare triple {21380#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {21381#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:20,091 INFO L273 TraceCheckUtils]: 114: Hoare triple {21381#(<= main_~i~0 27)} assume true; {21381#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:20,091 INFO L273 TraceCheckUtils]: 115: Hoare triple {21381#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21381#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:20,092 INFO L273 TraceCheckUtils]: 116: Hoare triple {21381#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21381#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:20,092 INFO L273 TraceCheckUtils]: 117: Hoare triple {21381#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {21382#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:20,093 INFO L273 TraceCheckUtils]: 118: Hoare triple {21382#(<= main_~i~0 28)} assume true; {21382#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:20,093 INFO L273 TraceCheckUtils]: 119: Hoare triple {21382#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21382#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:20,094 INFO L273 TraceCheckUtils]: 120: Hoare triple {21382#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21382#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:20,094 INFO L273 TraceCheckUtils]: 121: Hoare triple {21382#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {21383#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:20,095 INFO L273 TraceCheckUtils]: 122: Hoare triple {21383#(<= main_~i~0 29)} assume true; {21383#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:20,095 INFO L273 TraceCheckUtils]: 123: Hoare triple {21383#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21383#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:20,096 INFO L273 TraceCheckUtils]: 124: Hoare triple {21383#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21383#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:20,096 INFO L273 TraceCheckUtils]: 125: Hoare triple {21383#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {21384#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:20,097 INFO L273 TraceCheckUtils]: 126: Hoare triple {21384#(<= main_~i~0 30)} assume true; {21384#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:20,097 INFO L273 TraceCheckUtils]: 127: Hoare triple {21384#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21384#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:20,098 INFO L273 TraceCheckUtils]: 128: Hoare triple {21384#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21384#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:20,098 INFO L273 TraceCheckUtils]: 129: Hoare triple {21384#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {21385#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:20,099 INFO L273 TraceCheckUtils]: 130: Hoare triple {21385#(<= main_~i~0 31)} assume true; {21385#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:20,099 INFO L273 TraceCheckUtils]: 131: Hoare triple {21385#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21385#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:20,100 INFO L273 TraceCheckUtils]: 132: Hoare triple {21385#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21385#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:20,101 INFO L273 TraceCheckUtils]: 133: Hoare triple {21385#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {21386#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:20,101 INFO L273 TraceCheckUtils]: 134: Hoare triple {21386#(<= main_~i~0 32)} assume true; {21386#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:20,102 INFO L273 TraceCheckUtils]: 135: Hoare triple {21386#(<= main_~i~0 32)} assume !(~i~0 < 100000); {21353#false} is VALID [2018-11-18 22:57:20,102 INFO L273 TraceCheckUtils]: 136: Hoare triple {21353#false} havoc ~x~0;~x~0 := 0; {21353#false} is VALID [2018-11-18 22:57:20,102 INFO L273 TraceCheckUtils]: 137: Hoare triple {21353#false} assume true; {21353#false} is VALID [2018-11-18 22:57:20,102 INFO L273 TraceCheckUtils]: 138: Hoare triple {21353#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {21353#false} is VALID [2018-11-18 22:57:20,102 INFO L256 TraceCheckUtils]: 139: Hoare triple {21353#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {21353#false} is VALID [2018-11-18 22:57:20,103 INFO L273 TraceCheckUtils]: 140: Hoare triple {21353#false} ~cond := #in~cond; {21353#false} is VALID [2018-11-18 22:57:20,103 INFO L273 TraceCheckUtils]: 141: Hoare triple {21353#false} assume 0 == ~cond; {21353#false} is VALID [2018-11-18 22:57:20,103 INFO L273 TraceCheckUtils]: 142: Hoare triple {21353#false} assume !false; {21353#false} is VALID [2018-11-18 22:57:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:20,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:20,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:20,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:57:20,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:57:20,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:20,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:20,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {21352#true} call ULTIMATE.init(); {21352#true} is VALID [2018-11-18 22:57:20,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {21352#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21352#true} is VALID [2018-11-18 22:57:20,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {21352#true} assume true; {21352#true} is VALID [2018-11-18 22:57:20,516 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21352#true} {21352#true} #57#return; {21352#true} is VALID [2018-11-18 22:57:20,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {21352#true} call #t~ret4 := main(); {21352#true} is VALID [2018-11-18 22:57:20,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {21352#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {21405#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:20,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {21405#(<= main_~i~0 0)} assume true; {21405#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:20,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {21405#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21405#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:20,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {21405#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21405#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:20,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {21405#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {21355#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:20,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {21355#(<= main_~i~0 1)} assume true; {21355#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:20,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {21355#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21355#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:20,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {21355#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21355#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:20,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {21355#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {21356#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:20,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {21356#(<= main_~i~0 2)} assume true; {21356#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:20,521 INFO L273 TraceCheckUtils]: 15: Hoare triple {21356#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21356#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:20,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {21356#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21356#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:20,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {21356#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {21357#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:20,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {21357#(<= main_~i~0 3)} assume true; {21357#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:20,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {21357#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21357#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:20,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {21357#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21357#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:20,525 INFO L273 TraceCheckUtils]: 21: Hoare triple {21357#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {21358#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:20,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {21358#(<= main_~i~0 4)} assume true; {21358#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:20,526 INFO L273 TraceCheckUtils]: 23: Hoare triple {21358#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21358#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:20,526 INFO L273 TraceCheckUtils]: 24: Hoare triple {21358#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21358#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:20,527 INFO L273 TraceCheckUtils]: 25: Hoare triple {21358#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {21359#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:20,528 INFO L273 TraceCheckUtils]: 26: Hoare triple {21359#(<= main_~i~0 5)} assume true; {21359#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:20,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {21359#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21359#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:20,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {21359#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21359#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:20,529 INFO L273 TraceCheckUtils]: 29: Hoare triple {21359#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {21360#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:20,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {21360#(<= main_~i~0 6)} assume true; {21360#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:20,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {21360#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21360#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:20,531 INFO L273 TraceCheckUtils]: 32: Hoare triple {21360#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21360#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:20,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {21360#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {21361#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:20,532 INFO L273 TraceCheckUtils]: 34: Hoare triple {21361#(<= main_~i~0 7)} assume true; {21361#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:20,532 INFO L273 TraceCheckUtils]: 35: Hoare triple {21361#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21361#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:20,533 INFO L273 TraceCheckUtils]: 36: Hoare triple {21361#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21361#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:20,534 INFO L273 TraceCheckUtils]: 37: Hoare triple {21361#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {21362#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:20,534 INFO L273 TraceCheckUtils]: 38: Hoare triple {21362#(<= main_~i~0 8)} assume true; {21362#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:20,535 INFO L273 TraceCheckUtils]: 39: Hoare triple {21362#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21362#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:20,535 INFO L273 TraceCheckUtils]: 40: Hoare triple {21362#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21362#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:20,536 INFO L273 TraceCheckUtils]: 41: Hoare triple {21362#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {21363#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:20,536 INFO L273 TraceCheckUtils]: 42: Hoare triple {21363#(<= main_~i~0 9)} assume true; {21363#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:20,537 INFO L273 TraceCheckUtils]: 43: Hoare triple {21363#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21363#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:20,537 INFO L273 TraceCheckUtils]: 44: Hoare triple {21363#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21363#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:20,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {21363#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {21364#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:20,539 INFO L273 TraceCheckUtils]: 46: Hoare triple {21364#(<= main_~i~0 10)} assume true; {21364#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:20,539 INFO L273 TraceCheckUtils]: 47: Hoare triple {21364#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21364#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:20,539 INFO L273 TraceCheckUtils]: 48: Hoare triple {21364#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21364#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:20,540 INFO L273 TraceCheckUtils]: 49: Hoare triple {21364#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {21365#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:20,541 INFO L273 TraceCheckUtils]: 50: Hoare triple {21365#(<= main_~i~0 11)} assume true; {21365#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:20,541 INFO L273 TraceCheckUtils]: 51: Hoare triple {21365#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21365#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:20,542 INFO L273 TraceCheckUtils]: 52: Hoare triple {21365#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21365#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:20,542 INFO L273 TraceCheckUtils]: 53: Hoare triple {21365#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {21366#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:20,543 INFO L273 TraceCheckUtils]: 54: Hoare triple {21366#(<= main_~i~0 12)} assume true; {21366#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:20,543 INFO L273 TraceCheckUtils]: 55: Hoare triple {21366#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21366#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:20,548 INFO L273 TraceCheckUtils]: 56: Hoare triple {21366#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21366#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:20,548 INFO L273 TraceCheckUtils]: 57: Hoare triple {21366#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {21367#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,549 INFO L273 TraceCheckUtils]: 58: Hoare triple {21367#(<= main_~i~0 13)} assume true; {21367#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,549 INFO L273 TraceCheckUtils]: 59: Hoare triple {21367#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21367#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,549 INFO L273 TraceCheckUtils]: 60: Hoare triple {21367#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21367#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,550 INFO L273 TraceCheckUtils]: 61: Hoare triple {21367#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {21368#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,550 INFO L273 TraceCheckUtils]: 62: Hoare triple {21368#(<= main_~i~0 14)} assume true; {21368#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,550 INFO L273 TraceCheckUtils]: 63: Hoare triple {21368#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21368#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,551 INFO L273 TraceCheckUtils]: 64: Hoare triple {21368#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21368#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,551 INFO L273 TraceCheckUtils]: 65: Hoare triple {21368#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {21369#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,551 INFO L273 TraceCheckUtils]: 66: Hoare triple {21369#(<= main_~i~0 15)} assume true; {21369#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,552 INFO L273 TraceCheckUtils]: 67: Hoare triple {21369#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21369#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,552 INFO L273 TraceCheckUtils]: 68: Hoare triple {21369#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21369#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,553 INFO L273 TraceCheckUtils]: 69: Hoare triple {21369#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {21370#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,553 INFO L273 TraceCheckUtils]: 70: Hoare triple {21370#(<= main_~i~0 16)} assume true; {21370#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,554 INFO L273 TraceCheckUtils]: 71: Hoare triple {21370#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21370#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,554 INFO L273 TraceCheckUtils]: 72: Hoare triple {21370#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21370#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,555 INFO L273 TraceCheckUtils]: 73: Hoare triple {21370#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {21371#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,555 INFO L273 TraceCheckUtils]: 74: Hoare triple {21371#(<= main_~i~0 17)} assume true; {21371#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,556 INFO L273 TraceCheckUtils]: 75: Hoare triple {21371#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21371#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,556 INFO L273 TraceCheckUtils]: 76: Hoare triple {21371#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21371#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,557 INFO L273 TraceCheckUtils]: 77: Hoare triple {21371#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {21372#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,558 INFO L273 TraceCheckUtils]: 78: Hoare triple {21372#(<= main_~i~0 18)} assume true; {21372#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,558 INFO L273 TraceCheckUtils]: 79: Hoare triple {21372#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21372#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,559 INFO L273 TraceCheckUtils]: 80: Hoare triple {21372#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21372#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,559 INFO L273 TraceCheckUtils]: 81: Hoare triple {21372#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {21373#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,560 INFO L273 TraceCheckUtils]: 82: Hoare triple {21373#(<= main_~i~0 19)} assume true; {21373#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,560 INFO L273 TraceCheckUtils]: 83: Hoare triple {21373#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21373#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,561 INFO L273 TraceCheckUtils]: 84: Hoare triple {21373#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21373#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,562 INFO L273 TraceCheckUtils]: 85: Hoare triple {21373#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {21374#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,562 INFO L273 TraceCheckUtils]: 86: Hoare triple {21374#(<= main_~i~0 20)} assume true; {21374#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,563 INFO L273 TraceCheckUtils]: 87: Hoare triple {21374#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21374#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,563 INFO L273 TraceCheckUtils]: 88: Hoare triple {21374#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21374#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,564 INFO L273 TraceCheckUtils]: 89: Hoare triple {21374#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {21375#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,564 INFO L273 TraceCheckUtils]: 90: Hoare triple {21375#(<= main_~i~0 21)} assume true; {21375#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,565 INFO L273 TraceCheckUtils]: 91: Hoare triple {21375#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21375#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,565 INFO L273 TraceCheckUtils]: 92: Hoare triple {21375#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21375#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,566 INFO L273 TraceCheckUtils]: 93: Hoare triple {21375#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {21376#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:20,567 INFO L273 TraceCheckUtils]: 94: Hoare triple {21376#(<= main_~i~0 22)} assume true; {21376#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:20,567 INFO L273 TraceCheckUtils]: 95: Hoare triple {21376#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21376#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:20,568 INFO L273 TraceCheckUtils]: 96: Hoare triple {21376#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21376#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:20,568 INFO L273 TraceCheckUtils]: 97: Hoare triple {21376#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {21377#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:20,569 INFO L273 TraceCheckUtils]: 98: Hoare triple {21377#(<= main_~i~0 23)} assume true; {21377#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:20,569 INFO L273 TraceCheckUtils]: 99: Hoare triple {21377#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21377#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:20,570 INFO L273 TraceCheckUtils]: 100: Hoare triple {21377#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21377#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:20,571 INFO L273 TraceCheckUtils]: 101: Hoare triple {21377#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {21378#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:20,571 INFO L273 TraceCheckUtils]: 102: Hoare triple {21378#(<= main_~i~0 24)} assume true; {21378#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:20,572 INFO L273 TraceCheckUtils]: 103: Hoare triple {21378#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21378#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:20,572 INFO L273 TraceCheckUtils]: 104: Hoare triple {21378#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21378#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:20,573 INFO L273 TraceCheckUtils]: 105: Hoare triple {21378#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {21379#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:20,573 INFO L273 TraceCheckUtils]: 106: Hoare triple {21379#(<= main_~i~0 25)} assume true; {21379#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:20,574 INFO L273 TraceCheckUtils]: 107: Hoare triple {21379#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21379#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:20,574 INFO L273 TraceCheckUtils]: 108: Hoare triple {21379#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21379#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:20,575 INFO L273 TraceCheckUtils]: 109: Hoare triple {21379#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {21380#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:20,575 INFO L273 TraceCheckUtils]: 110: Hoare triple {21380#(<= main_~i~0 26)} assume true; {21380#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:20,576 INFO L273 TraceCheckUtils]: 111: Hoare triple {21380#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21380#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:20,576 INFO L273 TraceCheckUtils]: 112: Hoare triple {21380#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21380#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:20,577 INFO L273 TraceCheckUtils]: 113: Hoare triple {21380#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {21381#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:20,578 INFO L273 TraceCheckUtils]: 114: Hoare triple {21381#(<= main_~i~0 27)} assume true; {21381#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:20,578 INFO L273 TraceCheckUtils]: 115: Hoare triple {21381#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21381#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:20,579 INFO L273 TraceCheckUtils]: 116: Hoare triple {21381#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21381#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:20,579 INFO L273 TraceCheckUtils]: 117: Hoare triple {21381#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {21382#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:20,580 INFO L273 TraceCheckUtils]: 118: Hoare triple {21382#(<= main_~i~0 28)} assume true; {21382#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:20,580 INFO L273 TraceCheckUtils]: 119: Hoare triple {21382#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21382#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:20,581 INFO L273 TraceCheckUtils]: 120: Hoare triple {21382#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21382#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:20,582 INFO L273 TraceCheckUtils]: 121: Hoare triple {21382#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {21383#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:20,582 INFO L273 TraceCheckUtils]: 122: Hoare triple {21383#(<= main_~i~0 29)} assume true; {21383#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:20,583 INFO L273 TraceCheckUtils]: 123: Hoare triple {21383#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21383#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:20,583 INFO L273 TraceCheckUtils]: 124: Hoare triple {21383#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21383#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:20,584 INFO L273 TraceCheckUtils]: 125: Hoare triple {21383#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {21384#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:20,584 INFO L273 TraceCheckUtils]: 126: Hoare triple {21384#(<= main_~i~0 30)} assume true; {21384#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:20,585 INFO L273 TraceCheckUtils]: 127: Hoare triple {21384#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21384#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:20,585 INFO L273 TraceCheckUtils]: 128: Hoare triple {21384#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21384#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:20,586 INFO L273 TraceCheckUtils]: 129: Hoare triple {21384#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {21385#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:20,587 INFO L273 TraceCheckUtils]: 130: Hoare triple {21385#(<= main_~i~0 31)} assume true; {21385#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:20,587 INFO L273 TraceCheckUtils]: 131: Hoare triple {21385#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21385#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:20,588 INFO L273 TraceCheckUtils]: 132: Hoare triple {21385#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21385#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:20,588 INFO L273 TraceCheckUtils]: 133: Hoare triple {21385#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {21386#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:20,589 INFO L273 TraceCheckUtils]: 134: Hoare triple {21386#(<= main_~i~0 32)} assume true; {21386#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:20,589 INFO L273 TraceCheckUtils]: 135: Hoare triple {21386#(<= main_~i~0 32)} assume !(~i~0 < 100000); {21353#false} is VALID [2018-11-18 22:57:20,590 INFO L273 TraceCheckUtils]: 136: Hoare triple {21353#false} havoc ~x~0;~x~0 := 0; {21353#false} is VALID [2018-11-18 22:57:20,590 INFO L273 TraceCheckUtils]: 137: Hoare triple {21353#false} assume true; {21353#false} is VALID [2018-11-18 22:57:20,590 INFO L273 TraceCheckUtils]: 138: Hoare triple {21353#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {21353#false} is VALID [2018-11-18 22:57:20,590 INFO L256 TraceCheckUtils]: 139: Hoare triple {21353#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {21353#false} is VALID [2018-11-18 22:57:20,590 INFO L273 TraceCheckUtils]: 140: Hoare triple {21353#false} ~cond := #in~cond; {21353#false} is VALID [2018-11-18 22:57:20,591 INFO L273 TraceCheckUtils]: 141: Hoare triple {21353#false} assume 0 == ~cond; {21353#false} is VALID [2018-11-18 22:57:20,591 INFO L273 TraceCheckUtils]: 142: Hoare triple {21353#false} assume !false; {21353#false} is VALID [2018-11-18 22:57:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:20,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:20,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-18 22:57:20,626 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 143 [2018-11-18 22:57:20,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:20,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-18 22:57:20,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:20,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 22:57:20,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 22:57:20,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 22:57:20,758 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand 36 states. [2018-11-18 22:57:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:21,388 INFO L93 Difference]: Finished difference Result 166 states and 202 transitions. [2018-11-18 22:57:21,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-18 22:57:21,388 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 143 [2018-11-18 22:57:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:57:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 202 transitions. [2018-11-18 22:57:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:57:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 202 transitions. [2018-11-18 22:57:21,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 202 transitions. [2018-11-18 22:57:21,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:21,587 INFO L225 Difference]: With dead ends: 166 [2018-11-18 22:57:21,587 INFO L226 Difference]: Without dead ends: 154 [2018-11-18 22:57:21,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 22:57:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-18 22:57:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-11-18 22:57:21,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:21,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 152 states. [2018-11-18 22:57:21,622 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 152 states. [2018-11-18 22:57:21,622 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 152 states. [2018-11-18 22:57:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:21,625 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2018-11-18 22:57:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2018-11-18 22:57:21,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:21,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:21,626 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 154 states. [2018-11-18 22:57:21,626 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 154 states. [2018-11-18 22:57:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:21,630 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2018-11-18 22:57:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2018-11-18 22:57:21,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:21,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:21,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:21,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 22:57:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2018-11-18 22:57:21,634 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 143 [2018-11-18 22:57:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:21,634 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2018-11-18 22:57:21,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 22:57:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2018-11-18 22:57:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 22:57:21,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:21,635 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:21,636 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:21,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:21,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1299984792, now seen corresponding path program 33 times [2018-11-18 22:57:21,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:21,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:21,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:21,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:21,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:22,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {22527#true} call ULTIMATE.init(); {22527#true} is VALID [2018-11-18 22:57:22,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {22527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22527#true} is VALID [2018-11-18 22:57:22,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {22527#true} assume true; {22527#true} is VALID [2018-11-18 22:57:22,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22527#true} {22527#true} #57#return; {22527#true} is VALID [2018-11-18 22:57:22,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {22527#true} call #t~ret4 := main(); {22527#true} is VALID [2018-11-18 22:57:22,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {22527#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {22529#(= main_~i~0 0)} is VALID [2018-11-18 22:57:22,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {22529#(= main_~i~0 0)} assume true; {22529#(= main_~i~0 0)} is VALID [2018-11-18 22:57:22,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {22529#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22529#(= main_~i~0 0)} is VALID [2018-11-18 22:57:22,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {22529#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22529#(= main_~i~0 0)} is VALID [2018-11-18 22:57:22,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {22529#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {22530#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:22,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {22530#(<= main_~i~0 1)} assume true; {22530#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:22,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {22530#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22530#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:22,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {22530#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22530#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:22,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {22530#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {22531#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:22,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {22531#(<= main_~i~0 2)} assume true; {22531#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:22,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {22531#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22531#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:22,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {22531#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22531#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:22,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {22531#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {22532#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:22,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {22532#(<= main_~i~0 3)} assume true; {22532#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:22,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {22532#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22532#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:22,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {22532#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22532#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:22,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {22532#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {22533#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:22,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {22533#(<= main_~i~0 4)} assume true; {22533#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:22,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {22533#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22533#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:22,850 INFO L273 TraceCheckUtils]: 24: Hoare triple {22533#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22533#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:22,850 INFO L273 TraceCheckUtils]: 25: Hoare triple {22533#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {22534#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:22,851 INFO L273 TraceCheckUtils]: 26: Hoare triple {22534#(<= main_~i~0 5)} assume true; {22534#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:22,851 INFO L273 TraceCheckUtils]: 27: Hoare triple {22534#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22534#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:22,852 INFO L273 TraceCheckUtils]: 28: Hoare triple {22534#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22534#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:22,853 INFO L273 TraceCheckUtils]: 29: Hoare triple {22534#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {22535#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:22,853 INFO L273 TraceCheckUtils]: 30: Hoare triple {22535#(<= main_~i~0 6)} assume true; {22535#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:22,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {22535#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22535#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:22,854 INFO L273 TraceCheckUtils]: 32: Hoare triple {22535#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22535#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:22,855 INFO L273 TraceCheckUtils]: 33: Hoare triple {22535#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {22536#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:22,855 INFO L273 TraceCheckUtils]: 34: Hoare triple {22536#(<= main_~i~0 7)} assume true; {22536#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:22,856 INFO L273 TraceCheckUtils]: 35: Hoare triple {22536#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22536#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:22,856 INFO L273 TraceCheckUtils]: 36: Hoare triple {22536#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22536#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:22,857 INFO L273 TraceCheckUtils]: 37: Hoare triple {22536#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {22537#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:22,858 INFO L273 TraceCheckUtils]: 38: Hoare triple {22537#(<= main_~i~0 8)} assume true; {22537#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:22,858 INFO L273 TraceCheckUtils]: 39: Hoare triple {22537#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22537#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:22,859 INFO L273 TraceCheckUtils]: 40: Hoare triple {22537#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22537#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:22,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {22537#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {22538#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:22,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {22538#(<= main_~i~0 9)} assume true; {22538#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:22,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {22538#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22538#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:22,861 INFO L273 TraceCheckUtils]: 44: Hoare triple {22538#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22538#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:22,861 INFO L273 TraceCheckUtils]: 45: Hoare triple {22538#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {22539#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:22,862 INFO L273 TraceCheckUtils]: 46: Hoare triple {22539#(<= main_~i~0 10)} assume true; {22539#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:22,862 INFO L273 TraceCheckUtils]: 47: Hoare triple {22539#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22539#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:22,863 INFO L273 TraceCheckUtils]: 48: Hoare triple {22539#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22539#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:22,864 INFO L273 TraceCheckUtils]: 49: Hoare triple {22539#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {22540#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:22,864 INFO L273 TraceCheckUtils]: 50: Hoare triple {22540#(<= main_~i~0 11)} assume true; {22540#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:22,865 INFO L273 TraceCheckUtils]: 51: Hoare triple {22540#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22540#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:22,865 INFO L273 TraceCheckUtils]: 52: Hoare triple {22540#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22540#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:22,866 INFO L273 TraceCheckUtils]: 53: Hoare triple {22540#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {22541#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:22,866 INFO L273 TraceCheckUtils]: 54: Hoare triple {22541#(<= main_~i~0 12)} assume true; {22541#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:22,867 INFO L273 TraceCheckUtils]: 55: Hoare triple {22541#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22541#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:22,867 INFO L273 TraceCheckUtils]: 56: Hoare triple {22541#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22541#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:22,868 INFO L273 TraceCheckUtils]: 57: Hoare triple {22541#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {22542#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:22,869 INFO L273 TraceCheckUtils]: 58: Hoare triple {22542#(<= main_~i~0 13)} assume true; {22542#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:22,869 INFO L273 TraceCheckUtils]: 59: Hoare triple {22542#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22542#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:22,870 INFO L273 TraceCheckUtils]: 60: Hoare triple {22542#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22542#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:22,870 INFO L273 TraceCheckUtils]: 61: Hoare triple {22542#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {22543#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:22,871 INFO L273 TraceCheckUtils]: 62: Hoare triple {22543#(<= main_~i~0 14)} assume true; {22543#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:22,871 INFO L273 TraceCheckUtils]: 63: Hoare triple {22543#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22543#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:22,872 INFO L273 TraceCheckUtils]: 64: Hoare triple {22543#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22543#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:22,873 INFO L273 TraceCheckUtils]: 65: Hoare triple {22543#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {22544#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:22,873 INFO L273 TraceCheckUtils]: 66: Hoare triple {22544#(<= main_~i~0 15)} assume true; {22544#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:22,874 INFO L273 TraceCheckUtils]: 67: Hoare triple {22544#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22544#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:22,874 INFO L273 TraceCheckUtils]: 68: Hoare triple {22544#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22544#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:22,875 INFO L273 TraceCheckUtils]: 69: Hoare triple {22544#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {22545#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:22,875 INFO L273 TraceCheckUtils]: 70: Hoare triple {22545#(<= main_~i~0 16)} assume true; {22545#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:22,876 INFO L273 TraceCheckUtils]: 71: Hoare triple {22545#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22545#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:22,876 INFO L273 TraceCheckUtils]: 72: Hoare triple {22545#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22545#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:22,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {22545#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {22546#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:22,878 INFO L273 TraceCheckUtils]: 74: Hoare triple {22546#(<= main_~i~0 17)} assume true; {22546#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:22,878 INFO L273 TraceCheckUtils]: 75: Hoare triple {22546#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22546#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:22,879 INFO L273 TraceCheckUtils]: 76: Hoare triple {22546#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22546#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:22,879 INFO L273 TraceCheckUtils]: 77: Hoare triple {22546#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {22547#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:22,880 INFO L273 TraceCheckUtils]: 78: Hoare triple {22547#(<= main_~i~0 18)} assume true; {22547#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:22,880 INFO L273 TraceCheckUtils]: 79: Hoare triple {22547#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22547#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:22,881 INFO L273 TraceCheckUtils]: 80: Hoare triple {22547#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22547#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:22,882 INFO L273 TraceCheckUtils]: 81: Hoare triple {22547#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {22548#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:22,882 INFO L273 TraceCheckUtils]: 82: Hoare triple {22548#(<= main_~i~0 19)} assume true; {22548#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:22,883 INFO L273 TraceCheckUtils]: 83: Hoare triple {22548#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22548#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:22,883 INFO L273 TraceCheckUtils]: 84: Hoare triple {22548#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22548#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:22,884 INFO L273 TraceCheckUtils]: 85: Hoare triple {22548#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {22549#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:22,884 INFO L273 TraceCheckUtils]: 86: Hoare triple {22549#(<= main_~i~0 20)} assume true; {22549#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:22,885 INFO L273 TraceCheckUtils]: 87: Hoare triple {22549#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22549#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:22,885 INFO L273 TraceCheckUtils]: 88: Hoare triple {22549#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22549#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:22,886 INFO L273 TraceCheckUtils]: 89: Hoare triple {22549#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {22550#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:22,887 INFO L273 TraceCheckUtils]: 90: Hoare triple {22550#(<= main_~i~0 21)} assume true; {22550#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:22,887 INFO L273 TraceCheckUtils]: 91: Hoare triple {22550#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22550#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:22,887 INFO L273 TraceCheckUtils]: 92: Hoare triple {22550#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22550#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:22,888 INFO L273 TraceCheckUtils]: 93: Hoare triple {22550#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {22551#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:22,889 INFO L273 TraceCheckUtils]: 94: Hoare triple {22551#(<= main_~i~0 22)} assume true; {22551#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:22,889 INFO L273 TraceCheckUtils]: 95: Hoare triple {22551#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22551#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:22,890 INFO L273 TraceCheckUtils]: 96: Hoare triple {22551#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22551#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:22,890 INFO L273 TraceCheckUtils]: 97: Hoare triple {22551#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {22552#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:22,891 INFO L273 TraceCheckUtils]: 98: Hoare triple {22552#(<= main_~i~0 23)} assume true; {22552#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:22,891 INFO L273 TraceCheckUtils]: 99: Hoare triple {22552#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22552#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:22,892 INFO L273 TraceCheckUtils]: 100: Hoare triple {22552#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22552#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:22,893 INFO L273 TraceCheckUtils]: 101: Hoare triple {22552#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {22553#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:22,893 INFO L273 TraceCheckUtils]: 102: Hoare triple {22553#(<= main_~i~0 24)} assume true; {22553#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:22,894 INFO L273 TraceCheckUtils]: 103: Hoare triple {22553#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22553#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:22,894 INFO L273 TraceCheckUtils]: 104: Hoare triple {22553#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22553#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:22,895 INFO L273 TraceCheckUtils]: 105: Hoare triple {22553#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {22554#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:22,896 INFO L273 TraceCheckUtils]: 106: Hoare triple {22554#(<= main_~i~0 25)} assume true; {22554#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:22,896 INFO L273 TraceCheckUtils]: 107: Hoare triple {22554#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22554#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:22,897 INFO L273 TraceCheckUtils]: 108: Hoare triple {22554#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22554#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:22,897 INFO L273 TraceCheckUtils]: 109: Hoare triple {22554#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {22555#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:22,898 INFO L273 TraceCheckUtils]: 110: Hoare triple {22555#(<= main_~i~0 26)} assume true; {22555#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:22,898 INFO L273 TraceCheckUtils]: 111: Hoare triple {22555#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22555#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:22,899 INFO L273 TraceCheckUtils]: 112: Hoare triple {22555#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22555#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:22,899 INFO L273 TraceCheckUtils]: 113: Hoare triple {22555#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {22556#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:22,900 INFO L273 TraceCheckUtils]: 114: Hoare triple {22556#(<= main_~i~0 27)} assume true; {22556#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:22,900 INFO L273 TraceCheckUtils]: 115: Hoare triple {22556#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22556#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:22,901 INFO L273 TraceCheckUtils]: 116: Hoare triple {22556#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22556#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:22,902 INFO L273 TraceCheckUtils]: 117: Hoare triple {22556#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {22557#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:22,902 INFO L273 TraceCheckUtils]: 118: Hoare triple {22557#(<= main_~i~0 28)} assume true; {22557#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:22,903 INFO L273 TraceCheckUtils]: 119: Hoare triple {22557#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22557#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:22,903 INFO L273 TraceCheckUtils]: 120: Hoare triple {22557#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22557#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:22,904 INFO L273 TraceCheckUtils]: 121: Hoare triple {22557#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {22558#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:22,904 INFO L273 TraceCheckUtils]: 122: Hoare triple {22558#(<= main_~i~0 29)} assume true; {22558#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:22,905 INFO L273 TraceCheckUtils]: 123: Hoare triple {22558#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22558#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:22,905 INFO L273 TraceCheckUtils]: 124: Hoare triple {22558#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22558#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:22,906 INFO L273 TraceCheckUtils]: 125: Hoare triple {22558#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {22559#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:22,907 INFO L273 TraceCheckUtils]: 126: Hoare triple {22559#(<= main_~i~0 30)} assume true; {22559#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:22,907 INFO L273 TraceCheckUtils]: 127: Hoare triple {22559#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22559#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:22,908 INFO L273 TraceCheckUtils]: 128: Hoare triple {22559#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22559#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:22,908 INFO L273 TraceCheckUtils]: 129: Hoare triple {22559#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {22560#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:22,909 INFO L273 TraceCheckUtils]: 130: Hoare triple {22560#(<= main_~i~0 31)} assume true; {22560#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:22,909 INFO L273 TraceCheckUtils]: 131: Hoare triple {22560#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22560#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:22,910 INFO L273 TraceCheckUtils]: 132: Hoare triple {22560#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22560#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:22,911 INFO L273 TraceCheckUtils]: 133: Hoare triple {22560#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {22561#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:22,911 INFO L273 TraceCheckUtils]: 134: Hoare triple {22561#(<= main_~i~0 32)} assume true; {22561#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:22,912 INFO L273 TraceCheckUtils]: 135: Hoare triple {22561#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22561#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:22,912 INFO L273 TraceCheckUtils]: 136: Hoare triple {22561#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22561#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:22,913 INFO L273 TraceCheckUtils]: 137: Hoare triple {22561#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {22562#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:22,913 INFO L273 TraceCheckUtils]: 138: Hoare triple {22562#(<= main_~i~0 33)} assume true; {22562#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:22,914 INFO L273 TraceCheckUtils]: 139: Hoare triple {22562#(<= main_~i~0 33)} assume !(~i~0 < 100000); {22528#false} is VALID [2018-11-18 22:57:22,914 INFO L273 TraceCheckUtils]: 140: Hoare triple {22528#false} havoc ~x~0;~x~0 := 0; {22528#false} is VALID [2018-11-18 22:57:22,914 INFO L273 TraceCheckUtils]: 141: Hoare triple {22528#false} assume true; {22528#false} is VALID [2018-11-18 22:57:22,915 INFO L273 TraceCheckUtils]: 142: Hoare triple {22528#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {22528#false} is VALID [2018-11-18 22:57:22,915 INFO L256 TraceCheckUtils]: 143: Hoare triple {22528#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {22528#false} is VALID [2018-11-18 22:57:22,915 INFO L273 TraceCheckUtils]: 144: Hoare triple {22528#false} ~cond := #in~cond; {22528#false} is VALID [2018-11-18 22:57:22,915 INFO L273 TraceCheckUtils]: 145: Hoare triple {22528#false} assume 0 == ~cond; {22528#false} is VALID [2018-11-18 22:57:22,915 INFO L273 TraceCheckUtils]: 146: Hoare triple {22528#false} assume !false; {22528#false} is VALID [2018-11-18 22:57:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:22,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:22,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:22,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:57:23,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-18 22:57:23,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:23,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:23,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {22527#true} call ULTIMATE.init(); {22527#true} is VALID [2018-11-18 22:57:23,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {22527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22527#true} is VALID [2018-11-18 22:57:23,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {22527#true} assume true; {22527#true} is VALID [2018-11-18 22:57:23,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22527#true} {22527#true} #57#return; {22527#true} is VALID [2018-11-18 22:57:23,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {22527#true} call #t~ret4 := main(); {22527#true} is VALID [2018-11-18 22:57:23,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {22527#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {22581#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:23,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {22581#(<= main_~i~0 0)} assume true; {22581#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:23,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {22581#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22581#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:23,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {22581#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22581#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:23,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {22581#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {22530#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:23,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {22530#(<= main_~i~0 1)} assume true; {22530#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:23,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {22530#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22530#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:23,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {22530#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22530#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:23,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {22530#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {22531#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:23,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {22531#(<= main_~i~0 2)} assume true; {22531#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:23,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {22531#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22531#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:23,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {22531#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22531#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:23,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {22531#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {22532#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:23,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {22532#(<= main_~i~0 3)} assume true; {22532#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:23,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {22532#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22532#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:23,406 INFO L273 TraceCheckUtils]: 20: Hoare triple {22532#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22532#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:23,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {22532#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {22533#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:23,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {22533#(<= main_~i~0 4)} assume true; {22533#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:23,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {22533#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22533#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:23,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {22533#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22533#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:23,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {22533#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {22534#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:23,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {22534#(<= main_~i~0 5)} assume true; {22534#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:23,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {22534#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22534#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:23,417 INFO L273 TraceCheckUtils]: 28: Hoare triple {22534#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22534#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:23,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {22534#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {22535#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:23,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {22535#(<= main_~i~0 6)} assume true; {22535#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:23,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {22535#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22535#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:23,418 INFO L273 TraceCheckUtils]: 32: Hoare triple {22535#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22535#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:23,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {22535#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {22536#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:23,419 INFO L273 TraceCheckUtils]: 34: Hoare triple {22536#(<= main_~i~0 7)} assume true; {22536#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:23,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {22536#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22536#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:23,420 INFO L273 TraceCheckUtils]: 36: Hoare triple {22536#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22536#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:23,421 INFO L273 TraceCheckUtils]: 37: Hoare triple {22536#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {22537#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:23,421 INFO L273 TraceCheckUtils]: 38: Hoare triple {22537#(<= main_~i~0 8)} assume true; {22537#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:23,422 INFO L273 TraceCheckUtils]: 39: Hoare triple {22537#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22537#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:23,422 INFO L273 TraceCheckUtils]: 40: Hoare triple {22537#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22537#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:23,423 INFO L273 TraceCheckUtils]: 41: Hoare triple {22537#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {22538#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:23,423 INFO L273 TraceCheckUtils]: 42: Hoare triple {22538#(<= main_~i~0 9)} assume true; {22538#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:23,424 INFO L273 TraceCheckUtils]: 43: Hoare triple {22538#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22538#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:23,424 INFO L273 TraceCheckUtils]: 44: Hoare triple {22538#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22538#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:23,425 INFO L273 TraceCheckUtils]: 45: Hoare triple {22538#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {22539#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:23,425 INFO L273 TraceCheckUtils]: 46: Hoare triple {22539#(<= main_~i~0 10)} assume true; {22539#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:23,426 INFO L273 TraceCheckUtils]: 47: Hoare triple {22539#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22539#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:23,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {22539#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22539#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:23,427 INFO L273 TraceCheckUtils]: 49: Hoare triple {22539#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {22540#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:23,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {22540#(<= main_~i~0 11)} assume true; {22540#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:23,428 INFO L273 TraceCheckUtils]: 51: Hoare triple {22540#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22540#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:23,428 INFO L273 TraceCheckUtils]: 52: Hoare triple {22540#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22540#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:23,429 INFO L273 TraceCheckUtils]: 53: Hoare triple {22540#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {22541#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:23,429 INFO L273 TraceCheckUtils]: 54: Hoare triple {22541#(<= main_~i~0 12)} assume true; {22541#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:23,430 INFO L273 TraceCheckUtils]: 55: Hoare triple {22541#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22541#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:23,430 INFO L273 TraceCheckUtils]: 56: Hoare triple {22541#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22541#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:23,431 INFO L273 TraceCheckUtils]: 57: Hoare triple {22541#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {22542#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:23,431 INFO L273 TraceCheckUtils]: 58: Hoare triple {22542#(<= main_~i~0 13)} assume true; {22542#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:23,432 INFO L273 TraceCheckUtils]: 59: Hoare triple {22542#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22542#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:23,432 INFO L273 TraceCheckUtils]: 60: Hoare triple {22542#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22542#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:23,433 INFO L273 TraceCheckUtils]: 61: Hoare triple {22542#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {22543#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:23,433 INFO L273 TraceCheckUtils]: 62: Hoare triple {22543#(<= main_~i~0 14)} assume true; {22543#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:23,434 INFO L273 TraceCheckUtils]: 63: Hoare triple {22543#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22543#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:23,434 INFO L273 TraceCheckUtils]: 64: Hoare triple {22543#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22543#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:23,435 INFO L273 TraceCheckUtils]: 65: Hoare triple {22543#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {22544#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:23,436 INFO L273 TraceCheckUtils]: 66: Hoare triple {22544#(<= main_~i~0 15)} assume true; {22544#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:23,436 INFO L273 TraceCheckUtils]: 67: Hoare triple {22544#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22544#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:23,436 INFO L273 TraceCheckUtils]: 68: Hoare triple {22544#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22544#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:23,437 INFO L273 TraceCheckUtils]: 69: Hoare triple {22544#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {22545#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:23,438 INFO L273 TraceCheckUtils]: 70: Hoare triple {22545#(<= main_~i~0 16)} assume true; {22545#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:23,438 INFO L273 TraceCheckUtils]: 71: Hoare triple {22545#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22545#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:23,439 INFO L273 TraceCheckUtils]: 72: Hoare triple {22545#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22545#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:23,439 INFO L273 TraceCheckUtils]: 73: Hoare triple {22545#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {22546#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:23,440 INFO L273 TraceCheckUtils]: 74: Hoare triple {22546#(<= main_~i~0 17)} assume true; {22546#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:23,440 INFO L273 TraceCheckUtils]: 75: Hoare triple {22546#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22546#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:23,441 INFO L273 TraceCheckUtils]: 76: Hoare triple {22546#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22546#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:23,441 INFO L273 TraceCheckUtils]: 77: Hoare triple {22546#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {22547#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:23,442 INFO L273 TraceCheckUtils]: 78: Hoare triple {22547#(<= main_~i~0 18)} assume true; {22547#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:23,442 INFO L273 TraceCheckUtils]: 79: Hoare triple {22547#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22547#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:23,443 INFO L273 TraceCheckUtils]: 80: Hoare triple {22547#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22547#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:23,443 INFO L273 TraceCheckUtils]: 81: Hoare triple {22547#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {22548#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:23,444 INFO L273 TraceCheckUtils]: 82: Hoare triple {22548#(<= main_~i~0 19)} assume true; {22548#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:23,444 INFO L273 TraceCheckUtils]: 83: Hoare triple {22548#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22548#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:23,445 INFO L273 TraceCheckUtils]: 84: Hoare triple {22548#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22548#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:23,445 INFO L273 TraceCheckUtils]: 85: Hoare triple {22548#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {22549#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:23,446 INFO L273 TraceCheckUtils]: 86: Hoare triple {22549#(<= main_~i~0 20)} assume true; {22549#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:23,446 INFO L273 TraceCheckUtils]: 87: Hoare triple {22549#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22549#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:23,447 INFO L273 TraceCheckUtils]: 88: Hoare triple {22549#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22549#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:23,448 INFO L273 TraceCheckUtils]: 89: Hoare triple {22549#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {22550#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:23,448 INFO L273 TraceCheckUtils]: 90: Hoare triple {22550#(<= main_~i~0 21)} assume true; {22550#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:23,448 INFO L273 TraceCheckUtils]: 91: Hoare triple {22550#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22550#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:23,449 INFO L273 TraceCheckUtils]: 92: Hoare triple {22550#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22550#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:23,450 INFO L273 TraceCheckUtils]: 93: Hoare triple {22550#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {22551#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:23,450 INFO L273 TraceCheckUtils]: 94: Hoare triple {22551#(<= main_~i~0 22)} assume true; {22551#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:23,451 INFO L273 TraceCheckUtils]: 95: Hoare triple {22551#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22551#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:23,451 INFO L273 TraceCheckUtils]: 96: Hoare triple {22551#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22551#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:23,452 INFO L273 TraceCheckUtils]: 97: Hoare triple {22551#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {22552#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:23,452 INFO L273 TraceCheckUtils]: 98: Hoare triple {22552#(<= main_~i~0 23)} assume true; {22552#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:23,453 INFO L273 TraceCheckUtils]: 99: Hoare triple {22552#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22552#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:23,453 INFO L273 TraceCheckUtils]: 100: Hoare triple {22552#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22552#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:23,454 INFO L273 TraceCheckUtils]: 101: Hoare triple {22552#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {22553#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:23,454 INFO L273 TraceCheckUtils]: 102: Hoare triple {22553#(<= main_~i~0 24)} assume true; {22553#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:23,455 INFO L273 TraceCheckUtils]: 103: Hoare triple {22553#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22553#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:23,455 INFO L273 TraceCheckUtils]: 104: Hoare triple {22553#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22553#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:23,456 INFO L273 TraceCheckUtils]: 105: Hoare triple {22553#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {22554#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:23,456 INFO L273 TraceCheckUtils]: 106: Hoare triple {22554#(<= main_~i~0 25)} assume true; {22554#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:23,457 INFO L273 TraceCheckUtils]: 107: Hoare triple {22554#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22554#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:23,457 INFO L273 TraceCheckUtils]: 108: Hoare triple {22554#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22554#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:23,458 INFO L273 TraceCheckUtils]: 109: Hoare triple {22554#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {22555#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:23,458 INFO L273 TraceCheckUtils]: 110: Hoare triple {22555#(<= main_~i~0 26)} assume true; {22555#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:23,459 INFO L273 TraceCheckUtils]: 111: Hoare triple {22555#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22555#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:23,459 INFO L273 TraceCheckUtils]: 112: Hoare triple {22555#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22555#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:23,460 INFO L273 TraceCheckUtils]: 113: Hoare triple {22555#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {22556#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:23,461 INFO L273 TraceCheckUtils]: 114: Hoare triple {22556#(<= main_~i~0 27)} assume true; {22556#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:23,461 INFO L273 TraceCheckUtils]: 115: Hoare triple {22556#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22556#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:23,461 INFO L273 TraceCheckUtils]: 116: Hoare triple {22556#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22556#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:23,462 INFO L273 TraceCheckUtils]: 117: Hoare triple {22556#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {22557#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:23,463 INFO L273 TraceCheckUtils]: 118: Hoare triple {22557#(<= main_~i~0 28)} assume true; {22557#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:23,463 INFO L273 TraceCheckUtils]: 119: Hoare triple {22557#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22557#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:23,464 INFO L273 TraceCheckUtils]: 120: Hoare triple {22557#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22557#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:23,464 INFO L273 TraceCheckUtils]: 121: Hoare triple {22557#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {22558#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:23,465 INFO L273 TraceCheckUtils]: 122: Hoare triple {22558#(<= main_~i~0 29)} assume true; {22558#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:23,465 INFO L273 TraceCheckUtils]: 123: Hoare triple {22558#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22558#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:23,466 INFO L273 TraceCheckUtils]: 124: Hoare triple {22558#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22558#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:23,466 INFO L273 TraceCheckUtils]: 125: Hoare triple {22558#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {22559#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:23,467 INFO L273 TraceCheckUtils]: 126: Hoare triple {22559#(<= main_~i~0 30)} assume true; {22559#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:23,467 INFO L273 TraceCheckUtils]: 127: Hoare triple {22559#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22559#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:23,468 INFO L273 TraceCheckUtils]: 128: Hoare triple {22559#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22559#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:23,468 INFO L273 TraceCheckUtils]: 129: Hoare triple {22559#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {22560#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:23,469 INFO L273 TraceCheckUtils]: 130: Hoare triple {22560#(<= main_~i~0 31)} assume true; {22560#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:23,469 INFO L273 TraceCheckUtils]: 131: Hoare triple {22560#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22560#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:23,470 INFO L273 TraceCheckUtils]: 132: Hoare triple {22560#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22560#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:23,470 INFO L273 TraceCheckUtils]: 133: Hoare triple {22560#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {22561#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:23,471 INFO L273 TraceCheckUtils]: 134: Hoare triple {22561#(<= main_~i~0 32)} assume true; {22561#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:23,471 INFO L273 TraceCheckUtils]: 135: Hoare triple {22561#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22561#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:23,472 INFO L273 TraceCheckUtils]: 136: Hoare triple {22561#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22561#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:23,472 INFO L273 TraceCheckUtils]: 137: Hoare triple {22561#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {22562#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:23,473 INFO L273 TraceCheckUtils]: 138: Hoare triple {22562#(<= main_~i~0 33)} assume true; {22562#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:23,474 INFO L273 TraceCheckUtils]: 139: Hoare triple {22562#(<= main_~i~0 33)} assume !(~i~0 < 100000); {22528#false} is VALID [2018-11-18 22:57:23,474 INFO L273 TraceCheckUtils]: 140: Hoare triple {22528#false} havoc ~x~0;~x~0 := 0; {22528#false} is VALID [2018-11-18 22:57:23,474 INFO L273 TraceCheckUtils]: 141: Hoare triple {22528#false} assume true; {22528#false} is VALID [2018-11-18 22:57:23,474 INFO L273 TraceCheckUtils]: 142: Hoare triple {22528#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {22528#false} is VALID [2018-11-18 22:57:23,474 INFO L256 TraceCheckUtils]: 143: Hoare triple {22528#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {22528#false} is VALID [2018-11-18 22:57:23,475 INFO L273 TraceCheckUtils]: 144: Hoare triple {22528#false} ~cond := #in~cond; {22528#false} is VALID [2018-11-18 22:57:23,475 INFO L273 TraceCheckUtils]: 145: Hoare triple {22528#false} assume 0 == ~cond; {22528#false} is VALID [2018-11-18 22:57:23,475 INFO L273 TraceCheckUtils]: 146: Hoare triple {22528#false} assume !false; {22528#false} is VALID [2018-11-18 22:57:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:23,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:23,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-18 22:57:23,512 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2018-11-18 22:57:23,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:23,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-18 22:57:23,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:23,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 22:57:23,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 22:57:23,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 22:57:23,693 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand 37 states. [2018-11-18 22:57:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:24,461 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2018-11-18 22:57:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-18 22:57:24,462 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2018-11-18 22:57:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 22:57:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 207 transitions. [2018-11-18 22:57:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 22:57:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 207 transitions. [2018-11-18 22:57:24,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 207 transitions. [2018-11-18 22:57:24,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:24,663 INFO L225 Difference]: With dead ends: 170 [2018-11-18 22:57:24,663 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 22:57:24,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 22:57:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 22:57:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-11-18 22:57:24,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:24,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 156 states. [2018-11-18 22:57:24,729 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 156 states. [2018-11-18 22:57:24,729 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 156 states. [2018-11-18 22:57:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:24,732 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2018-11-18 22:57:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 194 transitions. [2018-11-18 22:57:24,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:24,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:24,733 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 158 states. [2018-11-18 22:57:24,733 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 158 states. [2018-11-18 22:57:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:24,735 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2018-11-18 22:57:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 194 transitions. [2018-11-18 22:57:24,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:24,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:24,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:24,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-18 22:57:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 191 transitions. [2018-11-18 22:57:24,738 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 191 transitions. Word has length 147 [2018-11-18 22:57:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:24,738 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 191 transitions. [2018-11-18 22:57:24,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 22:57:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2018-11-18 22:57:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 22:57:24,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:24,739 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:24,739 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:24,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:24,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2105785874, now seen corresponding path program 34 times [2018-11-18 22:57:24,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:24,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:24,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:24,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:25,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {23733#true} call ULTIMATE.init(); {23733#true} is VALID [2018-11-18 22:57:25,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {23733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23733#true} is VALID [2018-11-18 22:57:25,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {23733#true} assume true; {23733#true} is VALID [2018-11-18 22:57:25,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23733#true} {23733#true} #57#return; {23733#true} is VALID [2018-11-18 22:57:25,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {23733#true} call #t~ret4 := main(); {23733#true} is VALID [2018-11-18 22:57:25,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {23733#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {23735#(= main_~i~0 0)} is VALID [2018-11-18 22:57:25,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {23735#(= main_~i~0 0)} assume true; {23735#(= main_~i~0 0)} is VALID [2018-11-18 22:57:25,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {23735#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23735#(= main_~i~0 0)} is VALID [2018-11-18 22:57:25,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {23735#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23735#(= main_~i~0 0)} is VALID [2018-11-18 22:57:25,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {23735#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {23736#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:25,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {23736#(<= main_~i~0 1)} assume true; {23736#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:25,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {23736#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23736#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:25,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {23736#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23736#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:25,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {23736#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {23737#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:25,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {23737#(<= main_~i~0 2)} assume true; {23737#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:25,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {23737#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23737#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:25,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {23737#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23737#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:25,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {23737#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {23738#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:25,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {23738#(<= main_~i~0 3)} assume true; {23738#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:25,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {23738#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23738#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:25,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {23738#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23738#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:25,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {23738#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {23739#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:25,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {23739#(<= main_~i~0 4)} assume true; {23739#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:25,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {23739#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23739#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:25,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {23739#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23739#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:25,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {23739#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {23740#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:25,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {23740#(<= main_~i~0 5)} assume true; {23740#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:25,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {23740#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23740#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:25,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {23740#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23740#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:25,504 INFO L273 TraceCheckUtils]: 29: Hoare triple {23740#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {23741#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:25,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {23741#(<= main_~i~0 6)} assume true; {23741#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:25,505 INFO L273 TraceCheckUtils]: 31: Hoare triple {23741#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23741#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:25,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {23741#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23741#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:25,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {23741#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {23742#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:25,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {23742#(<= main_~i~0 7)} assume true; {23742#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:25,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {23742#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23742#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:25,508 INFO L273 TraceCheckUtils]: 36: Hoare triple {23742#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23742#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:25,509 INFO L273 TraceCheckUtils]: 37: Hoare triple {23742#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {23743#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:25,509 INFO L273 TraceCheckUtils]: 38: Hoare triple {23743#(<= main_~i~0 8)} assume true; {23743#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:25,510 INFO L273 TraceCheckUtils]: 39: Hoare triple {23743#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23743#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:25,510 INFO L273 TraceCheckUtils]: 40: Hoare triple {23743#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23743#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:25,511 INFO L273 TraceCheckUtils]: 41: Hoare triple {23743#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {23744#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:25,512 INFO L273 TraceCheckUtils]: 42: Hoare triple {23744#(<= main_~i~0 9)} assume true; {23744#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:25,512 INFO L273 TraceCheckUtils]: 43: Hoare triple {23744#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23744#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:25,513 INFO L273 TraceCheckUtils]: 44: Hoare triple {23744#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23744#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:25,513 INFO L273 TraceCheckUtils]: 45: Hoare triple {23744#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {23745#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:25,514 INFO L273 TraceCheckUtils]: 46: Hoare triple {23745#(<= main_~i~0 10)} assume true; {23745#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:25,514 INFO L273 TraceCheckUtils]: 47: Hoare triple {23745#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23745#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:25,515 INFO L273 TraceCheckUtils]: 48: Hoare triple {23745#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23745#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:25,516 INFO L273 TraceCheckUtils]: 49: Hoare triple {23745#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {23746#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:25,516 INFO L273 TraceCheckUtils]: 50: Hoare triple {23746#(<= main_~i~0 11)} assume true; {23746#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:25,517 INFO L273 TraceCheckUtils]: 51: Hoare triple {23746#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23746#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:25,517 INFO L273 TraceCheckUtils]: 52: Hoare triple {23746#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23746#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:25,518 INFO L273 TraceCheckUtils]: 53: Hoare triple {23746#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {23747#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:25,518 INFO L273 TraceCheckUtils]: 54: Hoare triple {23747#(<= main_~i~0 12)} assume true; {23747#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:25,519 INFO L273 TraceCheckUtils]: 55: Hoare triple {23747#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23747#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:25,519 INFO L273 TraceCheckUtils]: 56: Hoare triple {23747#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23747#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:25,520 INFO L273 TraceCheckUtils]: 57: Hoare triple {23747#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {23748#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:25,520 INFO L273 TraceCheckUtils]: 58: Hoare triple {23748#(<= main_~i~0 13)} assume true; {23748#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:25,521 INFO L273 TraceCheckUtils]: 59: Hoare triple {23748#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23748#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:25,521 INFO L273 TraceCheckUtils]: 60: Hoare triple {23748#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23748#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:25,522 INFO L273 TraceCheckUtils]: 61: Hoare triple {23748#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {23749#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:25,523 INFO L273 TraceCheckUtils]: 62: Hoare triple {23749#(<= main_~i~0 14)} assume true; {23749#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:25,523 INFO L273 TraceCheckUtils]: 63: Hoare triple {23749#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23749#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:25,524 INFO L273 TraceCheckUtils]: 64: Hoare triple {23749#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23749#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:25,524 INFO L273 TraceCheckUtils]: 65: Hoare triple {23749#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {23750#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:25,525 INFO L273 TraceCheckUtils]: 66: Hoare triple {23750#(<= main_~i~0 15)} assume true; {23750#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:25,525 INFO L273 TraceCheckUtils]: 67: Hoare triple {23750#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23750#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:25,526 INFO L273 TraceCheckUtils]: 68: Hoare triple {23750#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23750#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:25,527 INFO L273 TraceCheckUtils]: 69: Hoare triple {23750#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {23751#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:25,527 INFO L273 TraceCheckUtils]: 70: Hoare triple {23751#(<= main_~i~0 16)} assume true; {23751#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:25,528 INFO L273 TraceCheckUtils]: 71: Hoare triple {23751#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23751#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:25,528 INFO L273 TraceCheckUtils]: 72: Hoare triple {23751#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23751#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:25,529 INFO L273 TraceCheckUtils]: 73: Hoare triple {23751#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {23752#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:25,529 INFO L273 TraceCheckUtils]: 74: Hoare triple {23752#(<= main_~i~0 17)} assume true; {23752#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:25,530 INFO L273 TraceCheckUtils]: 75: Hoare triple {23752#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23752#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:25,530 INFO L273 TraceCheckUtils]: 76: Hoare triple {23752#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23752#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:25,531 INFO L273 TraceCheckUtils]: 77: Hoare triple {23752#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {23753#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:25,531 INFO L273 TraceCheckUtils]: 78: Hoare triple {23753#(<= main_~i~0 18)} assume true; {23753#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:25,532 INFO L273 TraceCheckUtils]: 79: Hoare triple {23753#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23753#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:25,532 INFO L273 TraceCheckUtils]: 80: Hoare triple {23753#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23753#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:25,533 INFO L273 TraceCheckUtils]: 81: Hoare triple {23753#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {23754#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:25,534 INFO L273 TraceCheckUtils]: 82: Hoare triple {23754#(<= main_~i~0 19)} assume true; {23754#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:25,534 INFO L273 TraceCheckUtils]: 83: Hoare triple {23754#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23754#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:25,535 INFO L273 TraceCheckUtils]: 84: Hoare triple {23754#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23754#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:25,535 INFO L273 TraceCheckUtils]: 85: Hoare triple {23754#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {23755#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:25,536 INFO L273 TraceCheckUtils]: 86: Hoare triple {23755#(<= main_~i~0 20)} assume true; {23755#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:25,536 INFO L273 TraceCheckUtils]: 87: Hoare triple {23755#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23755#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:25,537 INFO L273 TraceCheckUtils]: 88: Hoare triple {23755#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23755#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:25,538 INFO L273 TraceCheckUtils]: 89: Hoare triple {23755#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {23756#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:25,538 INFO L273 TraceCheckUtils]: 90: Hoare triple {23756#(<= main_~i~0 21)} assume true; {23756#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:25,539 INFO L273 TraceCheckUtils]: 91: Hoare triple {23756#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23756#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:25,539 INFO L273 TraceCheckUtils]: 92: Hoare triple {23756#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23756#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:25,540 INFO L273 TraceCheckUtils]: 93: Hoare triple {23756#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {23757#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:25,540 INFO L273 TraceCheckUtils]: 94: Hoare triple {23757#(<= main_~i~0 22)} assume true; {23757#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:25,541 INFO L273 TraceCheckUtils]: 95: Hoare triple {23757#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23757#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:25,541 INFO L273 TraceCheckUtils]: 96: Hoare triple {23757#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23757#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:25,542 INFO L273 TraceCheckUtils]: 97: Hoare triple {23757#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {23758#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:25,542 INFO L273 TraceCheckUtils]: 98: Hoare triple {23758#(<= main_~i~0 23)} assume true; {23758#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:25,543 INFO L273 TraceCheckUtils]: 99: Hoare triple {23758#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23758#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:25,543 INFO L273 TraceCheckUtils]: 100: Hoare triple {23758#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23758#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:25,544 INFO L273 TraceCheckUtils]: 101: Hoare triple {23758#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {23759#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:25,545 INFO L273 TraceCheckUtils]: 102: Hoare triple {23759#(<= main_~i~0 24)} assume true; {23759#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:25,545 INFO L273 TraceCheckUtils]: 103: Hoare triple {23759#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23759#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:25,546 INFO L273 TraceCheckUtils]: 104: Hoare triple {23759#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23759#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:25,546 INFO L273 TraceCheckUtils]: 105: Hoare triple {23759#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {23760#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:25,547 INFO L273 TraceCheckUtils]: 106: Hoare triple {23760#(<= main_~i~0 25)} assume true; {23760#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:25,547 INFO L273 TraceCheckUtils]: 107: Hoare triple {23760#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23760#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:25,548 INFO L273 TraceCheckUtils]: 108: Hoare triple {23760#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23760#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:25,549 INFO L273 TraceCheckUtils]: 109: Hoare triple {23760#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {23761#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:25,549 INFO L273 TraceCheckUtils]: 110: Hoare triple {23761#(<= main_~i~0 26)} assume true; {23761#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:25,550 INFO L273 TraceCheckUtils]: 111: Hoare triple {23761#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23761#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:25,550 INFO L273 TraceCheckUtils]: 112: Hoare triple {23761#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23761#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:25,551 INFO L273 TraceCheckUtils]: 113: Hoare triple {23761#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {23762#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:25,551 INFO L273 TraceCheckUtils]: 114: Hoare triple {23762#(<= main_~i~0 27)} assume true; {23762#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:25,552 INFO L273 TraceCheckUtils]: 115: Hoare triple {23762#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23762#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:25,552 INFO L273 TraceCheckUtils]: 116: Hoare triple {23762#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23762#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:25,553 INFO L273 TraceCheckUtils]: 117: Hoare triple {23762#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {23763#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:25,553 INFO L273 TraceCheckUtils]: 118: Hoare triple {23763#(<= main_~i~0 28)} assume true; {23763#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:25,554 INFO L273 TraceCheckUtils]: 119: Hoare triple {23763#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23763#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:25,554 INFO L273 TraceCheckUtils]: 120: Hoare triple {23763#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23763#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:25,555 INFO L273 TraceCheckUtils]: 121: Hoare triple {23763#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {23764#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:25,556 INFO L273 TraceCheckUtils]: 122: Hoare triple {23764#(<= main_~i~0 29)} assume true; {23764#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:25,556 INFO L273 TraceCheckUtils]: 123: Hoare triple {23764#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23764#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:25,557 INFO L273 TraceCheckUtils]: 124: Hoare triple {23764#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23764#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:25,576 INFO L273 TraceCheckUtils]: 125: Hoare triple {23764#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {23765#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:25,589 INFO L273 TraceCheckUtils]: 126: Hoare triple {23765#(<= main_~i~0 30)} assume true; {23765#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:25,602 INFO L273 TraceCheckUtils]: 127: Hoare triple {23765#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23765#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:25,610 INFO L273 TraceCheckUtils]: 128: Hoare triple {23765#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23765#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:25,610 INFO L273 TraceCheckUtils]: 129: Hoare triple {23765#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {23766#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:25,611 INFO L273 TraceCheckUtils]: 130: Hoare triple {23766#(<= main_~i~0 31)} assume true; {23766#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:25,611 INFO L273 TraceCheckUtils]: 131: Hoare triple {23766#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23766#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:25,611 INFO L273 TraceCheckUtils]: 132: Hoare triple {23766#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23766#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:25,612 INFO L273 TraceCheckUtils]: 133: Hoare triple {23766#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {23767#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:25,612 INFO L273 TraceCheckUtils]: 134: Hoare triple {23767#(<= main_~i~0 32)} assume true; {23767#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:25,612 INFO L273 TraceCheckUtils]: 135: Hoare triple {23767#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23767#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:25,613 INFO L273 TraceCheckUtils]: 136: Hoare triple {23767#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23767#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:25,613 INFO L273 TraceCheckUtils]: 137: Hoare triple {23767#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {23768#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:25,613 INFO L273 TraceCheckUtils]: 138: Hoare triple {23768#(<= main_~i~0 33)} assume true; {23768#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:25,614 INFO L273 TraceCheckUtils]: 139: Hoare triple {23768#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23768#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:25,614 INFO L273 TraceCheckUtils]: 140: Hoare triple {23768#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23768#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:25,614 INFO L273 TraceCheckUtils]: 141: Hoare triple {23768#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {23769#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:25,615 INFO L273 TraceCheckUtils]: 142: Hoare triple {23769#(<= main_~i~0 34)} assume true; {23769#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:25,616 INFO L273 TraceCheckUtils]: 143: Hoare triple {23769#(<= main_~i~0 34)} assume !(~i~0 < 100000); {23734#false} is VALID [2018-11-18 22:57:25,616 INFO L273 TraceCheckUtils]: 144: Hoare triple {23734#false} havoc ~x~0;~x~0 := 0; {23734#false} is VALID [2018-11-18 22:57:25,616 INFO L273 TraceCheckUtils]: 145: Hoare triple {23734#false} assume true; {23734#false} is VALID [2018-11-18 22:57:25,616 INFO L273 TraceCheckUtils]: 146: Hoare triple {23734#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {23734#false} is VALID [2018-11-18 22:57:25,616 INFO L256 TraceCheckUtils]: 147: Hoare triple {23734#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {23734#false} is VALID [2018-11-18 22:57:25,617 INFO L273 TraceCheckUtils]: 148: Hoare triple {23734#false} ~cond := #in~cond; {23734#false} is VALID [2018-11-18 22:57:25,617 INFO L273 TraceCheckUtils]: 149: Hoare triple {23734#false} assume 0 == ~cond; {23734#false} is VALID [2018-11-18 22:57:25,617 INFO L273 TraceCheckUtils]: 150: Hoare triple {23734#false} assume !false; {23734#false} is VALID [2018-11-18 22:57:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:25,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:25,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:25,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:57:25,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:57:25,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:25,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:26,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {23733#true} call ULTIMATE.init(); {23733#true} is VALID [2018-11-18 22:57:26,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {23733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23733#true} is VALID [2018-11-18 22:57:26,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {23733#true} assume true; {23733#true} is VALID [2018-11-18 22:57:26,355 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23733#true} {23733#true} #57#return; {23733#true} is VALID [2018-11-18 22:57:26,355 INFO L256 TraceCheckUtils]: 4: Hoare triple {23733#true} call #t~ret4 := main(); {23733#true} is VALID [2018-11-18 22:57:26,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {23733#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {23788#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:26,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {23788#(<= main_~i~0 0)} assume true; {23788#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:26,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {23788#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23788#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:26,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {23788#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23788#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:26,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {23788#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {23736#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:26,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {23736#(<= main_~i~0 1)} assume true; {23736#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:26,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {23736#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23736#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:26,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {23736#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23736#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:26,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {23736#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {23737#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:26,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {23737#(<= main_~i~0 2)} assume true; {23737#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:26,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {23737#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23737#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:26,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {23737#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23737#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:26,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {23737#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {23738#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:26,376 INFO L273 TraceCheckUtils]: 18: Hoare triple {23738#(<= main_~i~0 3)} assume true; {23738#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:26,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {23738#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23738#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:26,378 INFO L273 TraceCheckUtils]: 20: Hoare triple {23738#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23738#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:26,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {23738#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {23739#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:26,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {23739#(<= main_~i~0 4)} assume true; {23739#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:26,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {23739#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23739#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:26,384 INFO L273 TraceCheckUtils]: 24: Hoare triple {23739#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23739#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:26,384 INFO L273 TraceCheckUtils]: 25: Hoare triple {23739#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {23740#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:26,386 INFO L273 TraceCheckUtils]: 26: Hoare triple {23740#(<= main_~i~0 5)} assume true; {23740#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:26,386 INFO L273 TraceCheckUtils]: 27: Hoare triple {23740#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23740#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:26,389 INFO L273 TraceCheckUtils]: 28: Hoare triple {23740#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23740#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:26,389 INFO L273 TraceCheckUtils]: 29: Hoare triple {23740#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {23741#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:26,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {23741#(<= main_~i~0 6)} assume true; {23741#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:26,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {23741#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23741#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:26,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {23741#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23741#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:26,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {23741#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {23742#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:26,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {23742#(<= main_~i~0 7)} assume true; {23742#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:26,397 INFO L273 TraceCheckUtils]: 35: Hoare triple {23742#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23742#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:26,400 INFO L273 TraceCheckUtils]: 36: Hoare triple {23742#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23742#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:26,400 INFO L273 TraceCheckUtils]: 37: Hoare triple {23742#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {23743#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:26,402 INFO L273 TraceCheckUtils]: 38: Hoare triple {23743#(<= main_~i~0 8)} assume true; {23743#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:26,402 INFO L273 TraceCheckUtils]: 39: Hoare triple {23743#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23743#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:26,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {23743#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23743#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:26,404 INFO L273 TraceCheckUtils]: 41: Hoare triple {23743#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {23744#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:26,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {23744#(<= main_~i~0 9)} assume true; {23744#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:26,406 INFO L273 TraceCheckUtils]: 43: Hoare triple {23744#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23744#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:26,409 INFO L273 TraceCheckUtils]: 44: Hoare triple {23744#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23744#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:26,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {23744#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {23745#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:26,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {23745#(<= main_~i~0 10)} assume true; {23745#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:26,410 INFO L273 TraceCheckUtils]: 47: Hoare triple {23745#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23745#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:26,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {23745#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23745#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:26,410 INFO L273 TraceCheckUtils]: 49: Hoare triple {23745#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {23746#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:26,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {23746#(<= main_~i~0 11)} assume true; {23746#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:26,411 INFO L273 TraceCheckUtils]: 51: Hoare triple {23746#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23746#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:26,411 INFO L273 TraceCheckUtils]: 52: Hoare triple {23746#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23746#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:26,412 INFO L273 TraceCheckUtils]: 53: Hoare triple {23746#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {23747#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:26,412 INFO L273 TraceCheckUtils]: 54: Hoare triple {23747#(<= main_~i~0 12)} assume true; {23747#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:26,413 INFO L273 TraceCheckUtils]: 55: Hoare triple {23747#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23747#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:26,413 INFO L273 TraceCheckUtils]: 56: Hoare triple {23747#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23747#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:26,414 INFO L273 TraceCheckUtils]: 57: Hoare triple {23747#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {23748#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:26,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {23748#(<= main_~i~0 13)} assume true; {23748#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:26,415 INFO L273 TraceCheckUtils]: 59: Hoare triple {23748#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23748#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:26,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {23748#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23748#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:26,416 INFO L273 TraceCheckUtils]: 61: Hoare triple {23748#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {23749#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:26,417 INFO L273 TraceCheckUtils]: 62: Hoare triple {23749#(<= main_~i~0 14)} assume true; {23749#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:26,417 INFO L273 TraceCheckUtils]: 63: Hoare triple {23749#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23749#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:26,417 INFO L273 TraceCheckUtils]: 64: Hoare triple {23749#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23749#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:26,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {23749#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {23750#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:26,419 INFO L273 TraceCheckUtils]: 66: Hoare triple {23750#(<= main_~i~0 15)} assume true; {23750#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:26,419 INFO L273 TraceCheckUtils]: 67: Hoare triple {23750#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23750#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:26,420 INFO L273 TraceCheckUtils]: 68: Hoare triple {23750#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23750#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:26,420 INFO L273 TraceCheckUtils]: 69: Hoare triple {23750#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {23751#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:26,421 INFO L273 TraceCheckUtils]: 70: Hoare triple {23751#(<= main_~i~0 16)} assume true; {23751#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:26,421 INFO L273 TraceCheckUtils]: 71: Hoare triple {23751#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23751#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:26,422 INFO L273 TraceCheckUtils]: 72: Hoare triple {23751#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23751#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:26,423 INFO L273 TraceCheckUtils]: 73: Hoare triple {23751#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {23752#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:26,423 INFO L273 TraceCheckUtils]: 74: Hoare triple {23752#(<= main_~i~0 17)} assume true; {23752#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:26,423 INFO L273 TraceCheckUtils]: 75: Hoare triple {23752#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23752#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:26,424 INFO L273 TraceCheckUtils]: 76: Hoare triple {23752#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23752#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:26,425 INFO L273 TraceCheckUtils]: 77: Hoare triple {23752#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {23753#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:26,425 INFO L273 TraceCheckUtils]: 78: Hoare triple {23753#(<= main_~i~0 18)} assume true; {23753#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:26,426 INFO L273 TraceCheckUtils]: 79: Hoare triple {23753#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23753#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:26,426 INFO L273 TraceCheckUtils]: 80: Hoare triple {23753#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23753#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:26,427 INFO L273 TraceCheckUtils]: 81: Hoare triple {23753#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {23754#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:26,427 INFO L273 TraceCheckUtils]: 82: Hoare triple {23754#(<= main_~i~0 19)} assume true; {23754#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:26,428 INFO L273 TraceCheckUtils]: 83: Hoare triple {23754#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23754#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:26,428 INFO L273 TraceCheckUtils]: 84: Hoare triple {23754#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23754#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:26,429 INFO L273 TraceCheckUtils]: 85: Hoare triple {23754#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {23755#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:26,430 INFO L273 TraceCheckUtils]: 86: Hoare triple {23755#(<= main_~i~0 20)} assume true; {23755#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:26,430 INFO L273 TraceCheckUtils]: 87: Hoare triple {23755#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23755#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:26,431 INFO L273 TraceCheckUtils]: 88: Hoare triple {23755#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23755#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:26,431 INFO L273 TraceCheckUtils]: 89: Hoare triple {23755#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {23756#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:26,432 INFO L273 TraceCheckUtils]: 90: Hoare triple {23756#(<= main_~i~0 21)} assume true; {23756#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:26,432 INFO L273 TraceCheckUtils]: 91: Hoare triple {23756#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23756#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:26,433 INFO L273 TraceCheckUtils]: 92: Hoare triple {23756#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23756#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:26,433 INFO L273 TraceCheckUtils]: 93: Hoare triple {23756#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {23757#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:26,434 INFO L273 TraceCheckUtils]: 94: Hoare triple {23757#(<= main_~i~0 22)} assume true; {23757#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:26,434 INFO L273 TraceCheckUtils]: 95: Hoare triple {23757#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23757#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:26,435 INFO L273 TraceCheckUtils]: 96: Hoare triple {23757#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23757#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:26,436 INFO L273 TraceCheckUtils]: 97: Hoare triple {23757#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {23758#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:26,436 INFO L273 TraceCheckUtils]: 98: Hoare triple {23758#(<= main_~i~0 23)} assume true; {23758#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:26,437 INFO L273 TraceCheckUtils]: 99: Hoare triple {23758#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23758#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:26,437 INFO L273 TraceCheckUtils]: 100: Hoare triple {23758#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23758#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:26,438 INFO L273 TraceCheckUtils]: 101: Hoare triple {23758#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {23759#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:26,438 INFO L273 TraceCheckUtils]: 102: Hoare triple {23759#(<= main_~i~0 24)} assume true; {23759#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:26,439 INFO L273 TraceCheckUtils]: 103: Hoare triple {23759#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23759#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:26,439 INFO L273 TraceCheckUtils]: 104: Hoare triple {23759#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23759#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:26,440 INFO L273 TraceCheckUtils]: 105: Hoare triple {23759#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {23760#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:26,441 INFO L273 TraceCheckUtils]: 106: Hoare triple {23760#(<= main_~i~0 25)} assume true; {23760#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:26,441 INFO L273 TraceCheckUtils]: 107: Hoare triple {23760#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23760#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:26,441 INFO L273 TraceCheckUtils]: 108: Hoare triple {23760#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23760#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:26,442 INFO L273 TraceCheckUtils]: 109: Hoare triple {23760#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {23761#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:26,443 INFO L273 TraceCheckUtils]: 110: Hoare triple {23761#(<= main_~i~0 26)} assume true; {23761#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:26,443 INFO L273 TraceCheckUtils]: 111: Hoare triple {23761#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23761#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:26,444 INFO L273 TraceCheckUtils]: 112: Hoare triple {23761#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23761#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:26,444 INFO L273 TraceCheckUtils]: 113: Hoare triple {23761#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {23762#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:26,445 INFO L273 TraceCheckUtils]: 114: Hoare triple {23762#(<= main_~i~0 27)} assume true; {23762#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:26,445 INFO L273 TraceCheckUtils]: 115: Hoare triple {23762#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23762#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:26,446 INFO L273 TraceCheckUtils]: 116: Hoare triple {23762#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23762#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:26,447 INFO L273 TraceCheckUtils]: 117: Hoare triple {23762#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {23763#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:26,447 INFO L273 TraceCheckUtils]: 118: Hoare triple {23763#(<= main_~i~0 28)} assume true; {23763#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:26,448 INFO L273 TraceCheckUtils]: 119: Hoare triple {23763#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23763#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:26,448 INFO L273 TraceCheckUtils]: 120: Hoare triple {23763#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23763#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:26,449 INFO L273 TraceCheckUtils]: 121: Hoare triple {23763#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {23764#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:26,449 INFO L273 TraceCheckUtils]: 122: Hoare triple {23764#(<= main_~i~0 29)} assume true; {23764#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:26,450 INFO L273 TraceCheckUtils]: 123: Hoare triple {23764#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23764#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:26,450 INFO L273 TraceCheckUtils]: 124: Hoare triple {23764#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23764#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:26,451 INFO L273 TraceCheckUtils]: 125: Hoare triple {23764#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {23765#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:26,451 INFO L273 TraceCheckUtils]: 126: Hoare triple {23765#(<= main_~i~0 30)} assume true; {23765#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:26,452 INFO L273 TraceCheckUtils]: 127: Hoare triple {23765#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23765#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:26,452 INFO L273 TraceCheckUtils]: 128: Hoare triple {23765#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23765#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:26,453 INFO L273 TraceCheckUtils]: 129: Hoare triple {23765#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {23766#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:26,454 INFO L273 TraceCheckUtils]: 130: Hoare triple {23766#(<= main_~i~0 31)} assume true; {23766#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:26,454 INFO L273 TraceCheckUtils]: 131: Hoare triple {23766#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23766#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:26,455 INFO L273 TraceCheckUtils]: 132: Hoare triple {23766#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23766#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:26,455 INFO L273 TraceCheckUtils]: 133: Hoare triple {23766#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {23767#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:26,456 INFO L273 TraceCheckUtils]: 134: Hoare triple {23767#(<= main_~i~0 32)} assume true; {23767#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:26,456 INFO L273 TraceCheckUtils]: 135: Hoare triple {23767#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23767#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:26,457 INFO L273 TraceCheckUtils]: 136: Hoare triple {23767#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23767#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:26,457 INFO L273 TraceCheckUtils]: 137: Hoare triple {23767#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {23768#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:26,458 INFO L273 TraceCheckUtils]: 138: Hoare triple {23768#(<= main_~i~0 33)} assume true; {23768#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:26,458 INFO L273 TraceCheckUtils]: 139: Hoare triple {23768#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23768#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:26,459 INFO L273 TraceCheckUtils]: 140: Hoare triple {23768#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23768#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:26,460 INFO L273 TraceCheckUtils]: 141: Hoare triple {23768#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {23769#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:26,460 INFO L273 TraceCheckUtils]: 142: Hoare triple {23769#(<= main_~i~0 34)} assume true; {23769#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:26,461 INFO L273 TraceCheckUtils]: 143: Hoare triple {23769#(<= main_~i~0 34)} assume !(~i~0 < 100000); {23734#false} is VALID [2018-11-18 22:57:26,461 INFO L273 TraceCheckUtils]: 144: Hoare triple {23734#false} havoc ~x~0;~x~0 := 0; {23734#false} is VALID [2018-11-18 22:57:26,461 INFO L273 TraceCheckUtils]: 145: Hoare triple {23734#false} assume true; {23734#false} is VALID [2018-11-18 22:57:26,461 INFO L273 TraceCheckUtils]: 146: Hoare triple {23734#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {23734#false} is VALID [2018-11-18 22:57:26,462 INFO L256 TraceCheckUtils]: 147: Hoare triple {23734#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {23734#false} is VALID [2018-11-18 22:57:26,462 INFO L273 TraceCheckUtils]: 148: Hoare triple {23734#false} ~cond := #in~cond; {23734#false} is VALID [2018-11-18 22:57:26,462 INFO L273 TraceCheckUtils]: 149: Hoare triple {23734#false} assume 0 == ~cond; {23734#false} is VALID [2018-11-18 22:57:26,462 INFO L273 TraceCheckUtils]: 150: Hoare triple {23734#false} assume !false; {23734#false} is VALID [2018-11-18 22:57:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:26,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:26,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-18 22:57:26,503 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-11-18 22:57:26,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:26,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-18 22:57:26,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:26,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 22:57:26,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 22:57:26,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 22:57:26,648 INFO L87 Difference]: Start difference. First operand 156 states and 191 transitions. Second operand 38 states. [2018-11-18 22:57:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:27,320 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-11-18 22:57:27,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 22:57:27,320 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-11-18 22:57:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:57:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 212 transitions. [2018-11-18 22:57:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:57:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 212 transitions. [2018-11-18 22:57:27,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 212 transitions. [2018-11-18 22:57:27,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:27,520 INFO L225 Difference]: With dead ends: 174 [2018-11-18 22:57:27,520 INFO L226 Difference]: Without dead ends: 162 [2018-11-18 22:57:27,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 22:57:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-18 22:57:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-18 22:57:27,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:27,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 160 states. [2018-11-18 22:57:27,548 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 160 states. [2018-11-18 22:57:27,549 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 160 states. [2018-11-18 22:57:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:27,551 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2018-11-18 22:57:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 199 transitions. [2018-11-18 22:57:27,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:27,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:27,551 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 162 states. [2018-11-18 22:57:27,551 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 162 states. [2018-11-18 22:57:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:27,554 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2018-11-18 22:57:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 199 transitions. [2018-11-18 22:57:27,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:27,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:27,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:27,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-18 22:57:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 196 transitions. [2018-11-18 22:57:27,558 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 196 transitions. Word has length 151 [2018-11-18 22:57:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:27,558 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 196 transitions. [2018-11-18 22:57:27,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 22:57:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 196 transitions. [2018-11-18 22:57:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 22:57:27,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:27,559 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:27,559 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:27,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash 498087748, now seen corresponding path program 35 times [2018-11-18 22:57:27,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:27,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:27,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:27,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:27,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:28,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {24970#true} call ULTIMATE.init(); {24970#true} is VALID [2018-11-18 22:57:28,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {24970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24970#true} is VALID [2018-11-18 22:57:28,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {24970#true} assume true; {24970#true} is VALID [2018-11-18 22:57:28,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24970#true} {24970#true} #57#return; {24970#true} is VALID [2018-11-18 22:57:28,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {24970#true} call #t~ret4 := main(); {24970#true} is VALID [2018-11-18 22:57:28,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {24970#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {24972#(= main_~i~0 0)} is VALID [2018-11-18 22:57:28,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {24972#(= main_~i~0 0)} assume true; {24972#(= main_~i~0 0)} is VALID [2018-11-18 22:57:28,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {24972#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24972#(= main_~i~0 0)} is VALID [2018-11-18 22:57:28,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {24972#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24972#(= main_~i~0 0)} is VALID [2018-11-18 22:57:28,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {24972#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {24973#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:28,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {24973#(<= main_~i~0 1)} assume true; {24973#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:28,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {24973#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24973#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:28,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24973#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:28,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {24974#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:28,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~0 2)} assume true; {24974#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:28,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24974#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:28,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {24974#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24974#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:28,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {24974#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {24975#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:28,374 INFO L273 TraceCheckUtils]: 18: Hoare triple {24975#(<= main_~i~0 3)} assume true; {24975#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:28,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {24975#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24975#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:28,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {24975#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24975#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:28,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {24975#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {24976#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:28,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {24976#(<= main_~i~0 4)} assume true; {24976#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:28,376 INFO L273 TraceCheckUtils]: 23: Hoare triple {24976#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24976#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:28,377 INFO L273 TraceCheckUtils]: 24: Hoare triple {24976#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24976#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:28,377 INFO L273 TraceCheckUtils]: 25: Hoare triple {24976#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {24977#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:28,378 INFO L273 TraceCheckUtils]: 26: Hoare triple {24977#(<= main_~i~0 5)} assume true; {24977#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:28,378 INFO L273 TraceCheckUtils]: 27: Hoare triple {24977#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24977#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:28,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {24977#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24977#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:28,379 INFO L273 TraceCheckUtils]: 29: Hoare triple {24977#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {24978#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:28,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {24978#(<= main_~i~0 6)} assume true; {24978#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:28,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {24978#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24978#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:28,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {24978#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24978#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:28,381 INFO L273 TraceCheckUtils]: 33: Hoare triple {24978#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {24979#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:28,382 INFO L273 TraceCheckUtils]: 34: Hoare triple {24979#(<= main_~i~0 7)} assume true; {24979#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:28,382 INFO L273 TraceCheckUtils]: 35: Hoare triple {24979#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24979#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:28,383 INFO L273 TraceCheckUtils]: 36: Hoare triple {24979#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24979#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:28,383 INFO L273 TraceCheckUtils]: 37: Hoare triple {24979#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {24980#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:28,384 INFO L273 TraceCheckUtils]: 38: Hoare triple {24980#(<= main_~i~0 8)} assume true; {24980#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:28,384 INFO L273 TraceCheckUtils]: 39: Hoare triple {24980#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24980#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:28,385 INFO L273 TraceCheckUtils]: 40: Hoare triple {24980#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24980#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:28,386 INFO L273 TraceCheckUtils]: 41: Hoare triple {24980#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {24981#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:28,386 INFO L273 TraceCheckUtils]: 42: Hoare triple {24981#(<= main_~i~0 9)} assume true; {24981#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:28,386 INFO L273 TraceCheckUtils]: 43: Hoare triple {24981#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24981#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:28,387 INFO L273 TraceCheckUtils]: 44: Hoare triple {24981#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24981#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:28,388 INFO L273 TraceCheckUtils]: 45: Hoare triple {24981#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {24982#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:28,388 INFO L273 TraceCheckUtils]: 46: Hoare triple {24982#(<= main_~i~0 10)} assume true; {24982#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:28,389 INFO L273 TraceCheckUtils]: 47: Hoare triple {24982#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24982#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:28,389 INFO L273 TraceCheckUtils]: 48: Hoare triple {24982#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24982#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:28,390 INFO L273 TraceCheckUtils]: 49: Hoare triple {24982#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {24983#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:28,390 INFO L273 TraceCheckUtils]: 50: Hoare triple {24983#(<= main_~i~0 11)} assume true; {24983#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:28,391 INFO L273 TraceCheckUtils]: 51: Hoare triple {24983#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24983#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:28,391 INFO L273 TraceCheckUtils]: 52: Hoare triple {24983#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24983#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:28,392 INFO L273 TraceCheckUtils]: 53: Hoare triple {24983#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {24984#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:28,392 INFO L273 TraceCheckUtils]: 54: Hoare triple {24984#(<= main_~i~0 12)} assume true; {24984#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:28,393 INFO L273 TraceCheckUtils]: 55: Hoare triple {24984#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24984#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:28,393 INFO L273 TraceCheckUtils]: 56: Hoare triple {24984#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24984#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:28,394 INFO L273 TraceCheckUtils]: 57: Hoare triple {24984#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {24985#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:28,394 INFO L273 TraceCheckUtils]: 58: Hoare triple {24985#(<= main_~i~0 13)} assume true; {24985#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:28,395 INFO L273 TraceCheckUtils]: 59: Hoare triple {24985#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24985#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:28,395 INFO L273 TraceCheckUtils]: 60: Hoare triple {24985#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24985#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:28,396 INFO L273 TraceCheckUtils]: 61: Hoare triple {24985#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {24986#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:28,396 INFO L273 TraceCheckUtils]: 62: Hoare triple {24986#(<= main_~i~0 14)} assume true; {24986#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:28,397 INFO L273 TraceCheckUtils]: 63: Hoare triple {24986#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24986#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:28,397 INFO L273 TraceCheckUtils]: 64: Hoare triple {24986#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24986#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:28,398 INFO L273 TraceCheckUtils]: 65: Hoare triple {24986#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {24987#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:28,398 INFO L273 TraceCheckUtils]: 66: Hoare triple {24987#(<= main_~i~0 15)} assume true; {24987#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:28,399 INFO L273 TraceCheckUtils]: 67: Hoare triple {24987#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24987#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:28,399 INFO L273 TraceCheckUtils]: 68: Hoare triple {24987#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24987#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:28,400 INFO L273 TraceCheckUtils]: 69: Hoare triple {24987#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {24988#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:28,400 INFO L273 TraceCheckUtils]: 70: Hoare triple {24988#(<= main_~i~0 16)} assume true; {24988#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:28,401 INFO L273 TraceCheckUtils]: 71: Hoare triple {24988#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24988#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:28,401 INFO L273 TraceCheckUtils]: 72: Hoare triple {24988#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24988#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:28,402 INFO L273 TraceCheckUtils]: 73: Hoare triple {24988#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {24989#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:28,403 INFO L273 TraceCheckUtils]: 74: Hoare triple {24989#(<= main_~i~0 17)} assume true; {24989#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:28,403 INFO L273 TraceCheckUtils]: 75: Hoare triple {24989#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24989#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:28,403 INFO L273 TraceCheckUtils]: 76: Hoare triple {24989#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24989#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:28,404 INFO L273 TraceCheckUtils]: 77: Hoare triple {24989#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {24990#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:28,405 INFO L273 TraceCheckUtils]: 78: Hoare triple {24990#(<= main_~i~0 18)} assume true; {24990#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:28,405 INFO L273 TraceCheckUtils]: 79: Hoare triple {24990#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24990#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:28,406 INFO L273 TraceCheckUtils]: 80: Hoare triple {24990#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24990#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:28,406 INFO L273 TraceCheckUtils]: 81: Hoare triple {24990#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {24991#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:28,407 INFO L273 TraceCheckUtils]: 82: Hoare triple {24991#(<= main_~i~0 19)} assume true; {24991#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:28,407 INFO L273 TraceCheckUtils]: 83: Hoare triple {24991#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24991#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:28,408 INFO L273 TraceCheckUtils]: 84: Hoare triple {24991#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24991#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:28,408 INFO L273 TraceCheckUtils]: 85: Hoare triple {24991#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {24992#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:28,409 INFO L273 TraceCheckUtils]: 86: Hoare triple {24992#(<= main_~i~0 20)} assume true; {24992#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:28,409 INFO L273 TraceCheckUtils]: 87: Hoare triple {24992#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24992#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:28,410 INFO L273 TraceCheckUtils]: 88: Hoare triple {24992#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24992#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:28,411 INFO L273 TraceCheckUtils]: 89: Hoare triple {24992#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {24993#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:28,411 INFO L273 TraceCheckUtils]: 90: Hoare triple {24993#(<= main_~i~0 21)} assume true; {24993#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:28,412 INFO L273 TraceCheckUtils]: 91: Hoare triple {24993#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24993#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:28,412 INFO L273 TraceCheckUtils]: 92: Hoare triple {24993#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24993#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:28,413 INFO L273 TraceCheckUtils]: 93: Hoare triple {24993#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {24994#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:28,413 INFO L273 TraceCheckUtils]: 94: Hoare triple {24994#(<= main_~i~0 22)} assume true; {24994#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:28,414 INFO L273 TraceCheckUtils]: 95: Hoare triple {24994#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24994#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:28,414 INFO L273 TraceCheckUtils]: 96: Hoare triple {24994#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24994#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:28,415 INFO L273 TraceCheckUtils]: 97: Hoare triple {24994#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {24995#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:28,416 INFO L273 TraceCheckUtils]: 98: Hoare triple {24995#(<= main_~i~0 23)} assume true; {24995#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:28,416 INFO L273 TraceCheckUtils]: 99: Hoare triple {24995#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24995#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:28,417 INFO L273 TraceCheckUtils]: 100: Hoare triple {24995#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24995#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:28,417 INFO L273 TraceCheckUtils]: 101: Hoare triple {24995#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {24996#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:28,418 INFO L273 TraceCheckUtils]: 102: Hoare triple {24996#(<= main_~i~0 24)} assume true; {24996#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:28,418 INFO L273 TraceCheckUtils]: 103: Hoare triple {24996#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24996#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:28,419 INFO L273 TraceCheckUtils]: 104: Hoare triple {24996#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24996#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:28,419 INFO L273 TraceCheckUtils]: 105: Hoare triple {24996#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {24997#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:28,420 INFO L273 TraceCheckUtils]: 106: Hoare triple {24997#(<= main_~i~0 25)} assume true; {24997#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:28,420 INFO L273 TraceCheckUtils]: 107: Hoare triple {24997#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24997#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:28,421 INFO L273 TraceCheckUtils]: 108: Hoare triple {24997#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24997#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:28,422 INFO L273 TraceCheckUtils]: 109: Hoare triple {24997#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {24998#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:28,422 INFO L273 TraceCheckUtils]: 110: Hoare triple {24998#(<= main_~i~0 26)} assume true; {24998#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:28,423 INFO L273 TraceCheckUtils]: 111: Hoare triple {24998#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24998#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:28,423 INFO L273 TraceCheckUtils]: 112: Hoare triple {24998#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24998#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:28,424 INFO L273 TraceCheckUtils]: 113: Hoare triple {24998#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {24999#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:28,424 INFO L273 TraceCheckUtils]: 114: Hoare triple {24999#(<= main_~i~0 27)} assume true; {24999#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:28,425 INFO L273 TraceCheckUtils]: 115: Hoare triple {24999#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24999#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:28,425 INFO L273 TraceCheckUtils]: 116: Hoare triple {24999#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24999#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:28,426 INFO L273 TraceCheckUtils]: 117: Hoare triple {24999#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {25000#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:28,426 INFO L273 TraceCheckUtils]: 118: Hoare triple {25000#(<= main_~i~0 28)} assume true; {25000#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:28,427 INFO L273 TraceCheckUtils]: 119: Hoare triple {25000#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25000#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:28,427 INFO L273 TraceCheckUtils]: 120: Hoare triple {25000#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25000#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:28,428 INFO L273 TraceCheckUtils]: 121: Hoare triple {25000#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {25001#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:28,428 INFO L273 TraceCheckUtils]: 122: Hoare triple {25001#(<= main_~i~0 29)} assume true; {25001#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:28,429 INFO L273 TraceCheckUtils]: 123: Hoare triple {25001#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25001#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:28,429 INFO L273 TraceCheckUtils]: 124: Hoare triple {25001#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25001#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:28,430 INFO L273 TraceCheckUtils]: 125: Hoare triple {25001#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {25002#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:28,430 INFO L273 TraceCheckUtils]: 126: Hoare triple {25002#(<= main_~i~0 30)} assume true; {25002#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:28,431 INFO L273 TraceCheckUtils]: 127: Hoare triple {25002#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25002#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:28,431 INFO L273 TraceCheckUtils]: 128: Hoare triple {25002#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25002#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:28,432 INFO L273 TraceCheckUtils]: 129: Hoare triple {25002#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {25003#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:28,432 INFO L273 TraceCheckUtils]: 130: Hoare triple {25003#(<= main_~i~0 31)} assume true; {25003#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:28,433 INFO L273 TraceCheckUtils]: 131: Hoare triple {25003#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25003#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:28,433 INFO L273 TraceCheckUtils]: 132: Hoare triple {25003#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25003#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:28,434 INFO L273 TraceCheckUtils]: 133: Hoare triple {25003#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {25004#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:28,434 INFO L273 TraceCheckUtils]: 134: Hoare triple {25004#(<= main_~i~0 32)} assume true; {25004#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:28,435 INFO L273 TraceCheckUtils]: 135: Hoare triple {25004#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25004#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:28,435 INFO L273 TraceCheckUtils]: 136: Hoare triple {25004#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25004#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:28,436 INFO L273 TraceCheckUtils]: 137: Hoare triple {25004#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {25005#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:28,437 INFO L273 TraceCheckUtils]: 138: Hoare triple {25005#(<= main_~i~0 33)} assume true; {25005#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:28,437 INFO L273 TraceCheckUtils]: 139: Hoare triple {25005#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25005#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:28,437 INFO L273 TraceCheckUtils]: 140: Hoare triple {25005#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25005#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:28,438 INFO L273 TraceCheckUtils]: 141: Hoare triple {25005#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {25006#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:28,439 INFO L273 TraceCheckUtils]: 142: Hoare triple {25006#(<= main_~i~0 34)} assume true; {25006#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:28,439 INFO L273 TraceCheckUtils]: 143: Hoare triple {25006#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25006#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:28,440 INFO L273 TraceCheckUtils]: 144: Hoare triple {25006#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25006#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:28,440 INFO L273 TraceCheckUtils]: 145: Hoare triple {25006#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {25007#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:28,441 INFO L273 TraceCheckUtils]: 146: Hoare triple {25007#(<= main_~i~0 35)} assume true; {25007#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:28,441 INFO L273 TraceCheckUtils]: 147: Hoare triple {25007#(<= main_~i~0 35)} assume !(~i~0 < 100000); {24971#false} is VALID [2018-11-18 22:57:28,441 INFO L273 TraceCheckUtils]: 148: Hoare triple {24971#false} havoc ~x~0;~x~0 := 0; {24971#false} is VALID [2018-11-18 22:57:28,442 INFO L273 TraceCheckUtils]: 149: Hoare triple {24971#false} assume true; {24971#false} is VALID [2018-11-18 22:57:28,442 INFO L273 TraceCheckUtils]: 150: Hoare triple {24971#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {24971#false} is VALID [2018-11-18 22:57:28,442 INFO L256 TraceCheckUtils]: 151: Hoare triple {24971#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {24971#false} is VALID [2018-11-18 22:57:28,442 INFO L273 TraceCheckUtils]: 152: Hoare triple {24971#false} ~cond := #in~cond; {24971#false} is VALID [2018-11-18 22:57:28,442 INFO L273 TraceCheckUtils]: 153: Hoare triple {24971#false} assume 0 == ~cond; {24971#false} is VALID [2018-11-18 22:57:28,442 INFO L273 TraceCheckUtils]: 154: Hoare triple {24971#false} assume !false; {24971#false} is VALID [2018-11-18 22:57:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:28,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:28,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:28,471 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:57:28,565 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-18 22:57:28,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:28,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:28,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {24970#true} call ULTIMATE.init(); {24970#true} is VALID [2018-11-18 22:57:28,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {24970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24970#true} is VALID [2018-11-18 22:57:28,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {24970#true} assume true; {24970#true} is VALID [2018-11-18 22:57:28,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24970#true} {24970#true} #57#return; {24970#true} is VALID [2018-11-18 22:57:28,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {24970#true} call #t~ret4 := main(); {24970#true} is VALID [2018-11-18 22:57:28,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {24970#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {25026#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:28,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {25026#(<= main_~i~0 0)} assume true; {25026#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:28,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {25026#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25026#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:28,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {25026#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25026#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:28,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {25026#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {24973#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:28,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {24973#(<= main_~i~0 1)} assume true; {24973#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:28,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {24973#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24973#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:28,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24973#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:28,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {24974#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:28,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~0 2)} assume true; {24974#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:28,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24974#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:28,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {24974#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24974#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:28,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {24974#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {24975#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:28,867 INFO L273 TraceCheckUtils]: 18: Hoare triple {24975#(<= main_~i~0 3)} assume true; {24975#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:28,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {24975#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24975#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:28,868 INFO L273 TraceCheckUtils]: 20: Hoare triple {24975#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24975#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:28,869 INFO L273 TraceCheckUtils]: 21: Hoare triple {24975#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {24976#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:28,869 INFO L273 TraceCheckUtils]: 22: Hoare triple {24976#(<= main_~i~0 4)} assume true; {24976#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:28,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {24976#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24976#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:28,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {24976#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24976#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:28,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {24976#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {24977#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:28,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {24977#(<= main_~i~0 5)} assume true; {24977#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:28,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {24977#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24977#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:28,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {24977#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24977#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:28,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {24977#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {24978#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:28,874 INFO L273 TraceCheckUtils]: 30: Hoare triple {24978#(<= main_~i~0 6)} assume true; {24978#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:28,874 INFO L273 TraceCheckUtils]: 31: Hoare triple {24978#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24978#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:28,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {24978#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24978#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:28,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {24978#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {24979#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:28,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {24979#(<= main_~i~0 7)} assume true; {24979#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:28,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {24979#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24979#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:28,877 INFO L273 TraceCheckUtils]: 36: Hoare triple {24979#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24979#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:28,878 INFO L273 TraceCheckUtils]: 37: Hoare triple {24979#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {24980#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:28,878 INFO L273 TraceCheckUtils]: 38: Hoare triple {24980#(<= main_~i~0 8)} assume true; {24980#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:28,879 INFO L273 TraceCheckUtils]: 39: Hoare triple {24980#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24980#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:28,879 INFO L273 TraceCheckUtils]: 40: Hoare triple {24980#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24980#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:28,880 INFO L273 TraceCheckUtils]: 41: Hoare triple {24980#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {24981#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:28,880 INFO L273 TraceCheckUtils]: 42: Hoare triple {24981#(<= main_~i~0 9)} assume true; {24981#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:28,881 INFO L273 TraceCheckUtils]: 43: Hoare triple {24981#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24981#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:28,881 INFO L273 TraceCheckUtils]: 44: Hoare triple {24981#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24981#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:28,882 INFO L273 TraceCheckUtils]: 45: Hoare triple {24981#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {24982#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:28,883 INFO L273 TraceCheckUtils]: 46: Hoare triple {24982#(<= main_~i~0 10)} assume true; {24982#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:28,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {24982#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24982#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:28,884 INFO L273 TraceCheckUtils]: 48: Hoare triple {24982#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24982#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:28,884 INFO L273 TraceCheckUtils]: 49: Hoare triple {24982#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {24983#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:28,885 INFO L273 TraceCheckUtils]: 50: Hoare triple {24983#(<= main_~i~0 11)} assume true; {24983#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:28,885 INFO L273 TraceCheckUtils]: 51: Hoare triple {24983#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24983#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:28,886 INFO L273 TraceCheckUtils]: 52: Hoare triple {24983#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24983#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:28,887 INFO L273 TraceCheckUtils]: 53: Hoare triple {24983#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {24984#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:28,887 INFO L273 TraceCheckUtils]: 54: Hoare triple {24984#(<= main_~i~0 12)} assume true; {24984#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:28,888 INFO L273 TraceCheckUtils]: 55: Hoare triple {24984#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24984#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:28,888 INFO L273 TraceCheckUtils]: 56: Hoare triple {24984#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24984#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:28,889 INFO L273 TraceCheckUtils]: 57: Hoare triple {24984#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {24985#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:28,889 INFO L273 TraceCheckUtils]: 58: Hoare triple {24985#(<= main_~i~0 13)} assume true; {24985#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:28,890 INFO L273 TraceCheckUtils]: 59: Hoare triple {24985#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24985#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:28,890 INFO L273 TraceCheckUtils]: 60: Hoare triple {24985#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24985#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:28,891 INFO L273 TraceCheckUtils]: 61: Hoare triple {24985#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {24986#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:28,892 INFO L273 TraceCheckUtils]: 62: Hoare triple {24986#(<= main_~i~0 14)} assume true; {24986#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:28,892 INFO L273 TraceCheckUtils]: 63: Hoare triple {24986#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24986#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:28,893 INFO L273 TraceCheckUtils]: 64: Hoare triple {24986#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24986#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:28,893 INFO L273 TraceCheckUtils]: 65: Hoare triple {24986#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {24987#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:28,894 INFO L273 TraceCheckUtils]: 66: Hoare triple {24987#(<= main_~i~0 15)} assume true; {24987#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:28,894 INFO L273 TraceCheckUtils]: 67: Hoare triple {24987#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24987#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:28,895 INFO L273 TraceCheckUtils]: 68: Hoare triple {24987#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24987#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:28,896 INFO L273 TraceCheckUtils]: 69: Hoare triple {24987#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {24988#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:28,896 INFO L273 TraceCheckUtils]: 70: Hoare triple {24988#(<= main_~i~0 16)} assume true; {24988#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:28,897 INFO L273 TraceCheckUtils]: 71: Hoare triple {24988#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24988#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:28,897 INFO L273 TraceCheckUtils]: 72: Hoare triple {24988#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24988#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:28,898 INFO L273 TraceCheckUtils]: 73: Hoare triple {24988#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {24989#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:28,898 INFO L273 TraceCheckUtils]: 74: Hoare triple {24989#(<= main_~i~0 17)} assume true; {24989#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:28,899 INFO L273 TraceCheckUtils]: 75: Hoare triple {24989#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24989#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:28,899 INFO L273 TraceCheckUtils]: 76: Hoare triple {24989#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24989#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:28,900 INFO L273 TraceCheckUtils]: 77: Hoare triple {24989#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {24990#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:28,901 INFO L273 TraceCheckUtils]: 78: Hoare triple {24990#(<= main_~i~0 18)} assume true; {24990#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:28,901 INFO L273 TraceCheckUtils]: 79: Hoare triple {24990#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24990#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:28,902 INFO L273 TraceCheckUtils]: 80: Hoare triple {24990#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24990#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:28,902 INFO L273 TraceCheckUtils]: 81: Hoare triple {24990#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {24991#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:28,903 INFO L273 TraceCheckUtils]: 82: Hoare triple {24991#(<= main_~i~0 19)} assume true; {24991#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:28,903 INFO L273 TraceCheckUtils]: 83: Hoare triple {24991#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24991#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:28,904 INFO L273 TraceCheckUtils]: 84: Hoare triple {24991#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24991#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:28,904 INFO L273 TraceCheckUtils]: 85: Hoare triple {24991#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {24992#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:28,905 INFO L273 TraceCheckUtils]: 86: Hoare triple {24992#(<= main_~i~0 20)} assume true; {24992#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:28,905 INFO L273 TraceCheckUtils]: 87: Hoare triple {24992#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24992#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:28,906 INFO L273 TraceCheckUtils]: 88: Hoare triple {24992#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24992#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:28,907 INFO L273 TraceCheckUtils]: 89: Hoare triple {24992#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {24993#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:28,907 INFO L273 TraceCheckUtils]: 90: Hoare triple {24993#(<= main_~i~0 21)} assume true; {24993#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:28,908 INFO L273 TraceCheckUtils]: 91: Hoare triple {24993#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24993#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:28,908 INFO L273 TraceCheckUtils]: 92: Hoare triple {24993#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24993#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:28,909 INFO L273 TraceCheckUtils]: 93: Hoare triple {24993#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {24994#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:28,909 INFO L273 TraceCheckUtils]: 94: Hoare triple {24994#(<= main_~i~0 22)} assume true; {24994#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:28,910 INFO L273 TraceCheckUtils]: 95: Hoare triple {24994#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24994#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:28,910 INFO L273 TraceCheckUtils]: 96: Hoare triple {24994#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24994#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:28,911 INFO L273 TraceCheckUtils]: 97: Hoare triple {24994#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {24995#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:28,912 INFO L273 TraceCheckUtils]: 98: Hoare triple {24995#(<= main_~i~0 23)} assume true; {24995#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:28,912 INFO L273 TraceCheckUtils]: 99: Hoare triple {24995#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24995#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:28,913 INFO L273 TraceCheckUtils]: 100: Hoare triple {24995#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24995#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:28,913 INFO L273 TraceCheckUtils]: 101: Hoare triple {24995#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {24996#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:28,914 INFO L273 TraceCheckUtils]: 102: Hoare triple {24996#(<= main_~i~0 24)} assume true; {24996#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:28,914 INFO L273 TraceCheckUtils]: 103: Hoare triple {24996#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24996#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:28,915 INFO L273 TraceCheckUtils]: 104: Hoare triple {24996#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24996#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:28,916 INFO L273 TraceCheckUtils]: 105: Hoare triple {24996#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {24997#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:28,916 INFO L273 TraceCheckUtils]: 106: Hoare triple {24997#(<= main_~i~0 25)} assume true; {24997#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:28,917 INFO L273 TraceCheckUtils]: 107: Hoare triple {24997#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24997#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:28,917 INFO L273 TraceCheckUtils]: 108: Hoare triple {24997#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24997#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:28,918 INFO L273 TraceCheckUtils]: 109: Hoare triple {24997#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {24998#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:28,918 INFO L273 TraceCheckUtils]: 110: Hoare triple {24998#(<= main_~i~0 26)} assume true; {24998#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:28,919 INFO L273 TraceCheckUtils]: 111: Hoare triple {24998#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24998#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:28,919 INFO L273 TraceCheckUtils]: 112: Hoare triple {24998#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24998#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:28,920 INFO L273 TraceCheckUtils]: 113: Hoare triple {24998#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {24999#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:28,920 INFO L273 TraceCheckUtils]: 114: Hoare triple {24999#(<= main_~i~0 27)} assume true; {24999#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:28,921 INFO L273 TraceCheckUtils]: 115: Hoare triple {24999#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24999#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:28,921 INFO L273 TraceCheckUtils]: 116: Hoare triple {24999#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24999#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:28,922 INFO L273 TraceCheckUtils]: 117: Hoare triple {24999#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {25000#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:28,923 INFO L273 TraceCheckUtils]: 118: Hoare triple {25000#(<= main_~i~0 28)} assume true; {25000#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:28,923 INFO L273 TraceCheckUtils]: 119: Hoare triple {25000#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25000#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:28,924 INFO L273 TraceCheckUtils]: 120: Hoare triple {25000#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25000#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:28,924 INFO L273 TraceCheckUtils]: 121: Hoare triple {25000#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {25001#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:28,925 INFO L273 TraceCheckUtils]: 122: Hoare triple {25001#(<= main_~i~0 29)} assume true; {25001#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:28,925 INFO L273 TraceCheckUtils]: 123: Hoare triple {25001#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25001#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:28,926 INFO L273 TraceCheckUtils]: 124: Hoare triple {25001#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25001#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:28,927 INFO L273 TraceCheckUtils]: 125: Hoare triple {25001#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {25002#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:28,927 INFO L273 TraceCheckUtils]: 126: Hoare triple {25002#(<= main_~i~0 30)} assume true; {25002#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:28,928 INFO L273 TraceCheckUtils]: 127: Hoare triple {25002#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25002#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:28,928 INFO L273 TraceCheckUtils]: 128: Hoare triple {25002#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25002#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:28,929 INFO L273 TraceCheckUtils]: 129: Hoare triple {25002#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {25003#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:28,929 INFO L273 TraceCheckUtils]: 130: Hoare triple {25003#(<= main_~i~0 31)} assume true; {25003#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:28,930 INFO L273 TraceCheckUtils]: 131: Hoare triple {25003#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25003#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:28,930 INFO L273 TraceCheckUtils]: 132: Hoare triple {25003#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25003#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:28,931 INFO L273 TraceCheckUtils]: 133: Hoare triple {25003#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {25004#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:28,932 INFO L273 TraceCheckUtils]: 134: Hoare triple {25004#(<= main_~i~0 32)} assume true; {25004#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:28,932 INFO L273 TraceCheckUtils]: 135: Hoare triple {25004#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25004#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:28,932 INFO L273 TraceCheckUtils]: 136: Hoare triple {25004#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25004#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:28,933 INFO L273 TraceCheckUtils]: 137: Hoare triple {25004#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {25005#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:28,934 INFO L273 TraceCheckUtils]: 138: Hoare triple {25005#(<= main_~i~0 33)} assume true; {25005#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:28,934 INFO L273 TraceCheckUtils]: 139: Hoare triple {25005#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25005#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:28,935 INFO L273 TraceCheckUtils]: 140: Hoare triple {25005#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25005#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:28,935 INFO L273 TraceCheckUtils]: 141: Hoare triple {25005#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {25006#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:28,936 INFO L273 TraceCheckUtils]: 142: Hoare triple {25006#(<= main_~i~0 34)} assume true; {25006#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:28,936 INFO L273 TraceCheckUtils]: 143: Hoare triple {25006#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25006#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:28,937 INFO L273 TraceCheckUtils]: 144: Hoare triple {25006#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25006#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:28,938 INFO L273 TraceCheckUtils]: 145: Hoare triple {25006#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {25007#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:28,938 INFO L273 TraceCheckUtils]: 146: Hoare triple {25007#(<= main_~i~0 35)} assume true; {25007#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:28,939 INFO L273 TraceCheckUtils]: 147: Hoare triple {25007#(<= main_~i~0 35)} assume !(~i~0 < 100000); {24971#false} is VALID [2018-11-18 22:57:28,939 INFO L273 TraceCheckUtils]: 148: Hoare triple {24971#false} havoc ~x~0;~x~0 := 0; {24971#false} is VALID [2018-11-18 22:57:28,939 INFO L273 TraceCheckUtils]: 149: Hoare triple {24971#false} assume true; {24971#false} is VALID [2018-11-18 22:57:28,939 INFO L273 TraceCheckUtils]: 150: Hoare triple {24971#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {24971#false} is VALID [2018-11-18 22:57:28,940 INFO L256 TraceCheckUtils]: 151: Hoare triple {24971#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {24971#false} is VALID [2018-11-18 22:57:28,940 INFO L273 TraceCheckUtils]: 152: Hoare triple {24971#false} ~cond := #in~cond; {24971#false} is VALID [2018-11-18 22:57:28,940 INFO L273 TraceCheckUtils]: 153: Hoare triple {24971#false} assume 0 == ~cond; {24971#false} is VALID [2018-11-18 22:57:28,940 INFO L273 TraceCheckUtils]: 154: Hoare triple {24971#false} assume !false; {24971#false} is VALID [2018-11-18 22:57:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:28,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:28,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-18 22:57:28,977 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 155 [2018-11-18 22:57:28,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:28,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-18 22:57:29,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:29,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-18 22:57:29,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 22:57:29,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 22:57:29,124 INFO L87 Difference]: Start difference. First operand 160 states and 196 transitions. Second operand 39 states. [2018-11-18 22:57:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:29,915 INFO L93 Difference]: Finished difference Result 178 states and 217 transitions. [2018-11-18 22:57:29,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 22:57:29,915 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 155 [2018-11-18 22:57:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:57:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 217 transitions. [2018-11-18 22:57:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:57:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 217 transitions. [2018-11-18 22:57:29,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 217 transitions. [2018-11-18 22:57:30,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:30,107 INFO L225 Difference]: With dead ends: 178 [2018-11-18 22:57:30,107 INFO L226 Difference]: Without dead ends: 166 [2018-11-18 22:57:30,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 22:57:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-18 22:57:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-11-18 22:57:30,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:30,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 164 states. [2018-11-18 22:57:30,140 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 164 states. [2018-11-18 22:57:30,140 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 164 states. [2018-11-18 22:57:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:30,143 INFO L93 Difference]: Finished difference Result 166 states and 204 transitions. [2018-11-18 22:57:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2018-11-18 22:57:30,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:30,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:30,144 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 166 states. [2018-11-18 22:57:30,144 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 166 states. [2018-11-18 22:57:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:30,146 INFO L93 Difference]: Finished difference Result 166 states and 204 transitions. [2018-11-18 22:57:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2018-11-18 22:57:30,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:30,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:30,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:30,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-18 22:57:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2018-11-18 22:57:30,149 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 155 [2018-11-18 22:57:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:30,149 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2018-11-18 22:57:30,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-18 22:57:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2018-11-18 22:57:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-18 22:57:30,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:30,150 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:30,150 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:30,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1755156890, now seen corresponding path program 36 times [2018-11-18 22:57:30,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:30,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:30,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:31,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {26238#true} call ULTIMATE.init(); {26238#true} is VALID [2018-11-18 22:57:31,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {26238#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26238#true} is VALID [2018-11-18 22:57:31,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {26238#true} assume true; {26238#true} is VALID [2018-11-18 22:57:31,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26238#true} {26238#true} #57#return; {26238#true} is VALID [2018-11-18 22:57:31,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {26238#true} call #t~ret4 := main(); {26238#true} is VALID [2018-11-18 22:57:31,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {26238#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {26240#(= main_~i~0 0)} is VALID [2018-11-18 22:57:31,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {26240#(= main_~i~0 0)} assume true; {26240#(= main_~i~0 0)} is VALID [2018-11-18 22:57:31,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {26240#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26240#(= main_~i~0 0)} is VALID [2018-11-18 22:57:31,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {26240#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26240#(= main_~i~0 0)} is VALID [2018-11-18 22:57:31,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {26240#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {26241#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:31,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#(<= main_~i~0 1)} assume true; {26241#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:31,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {26241#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26241#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:31,564 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26241#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:31,564 INFO L273 TraceCheckUtils]: 13: Hoare triple {26241#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {26242#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:31,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {26242#(<= main_~i~0 2)} assume true; {26242#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:31,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {26242#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26242#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:31,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {26242#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26242#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:31,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {26242#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {26243#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:31,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {26243#(<= main_~i~0 3)} assume true; {26243#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:31,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {26243#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26243#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:31,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {26243#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26243#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:31,574 INFO L273 TraceCheckUtils]: 21: Hoare triple {26243#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {26244#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:31,577 INFO L273 TraceCheckUtils]: 22: Hoare triple {26244#(<= main_~i~0 4)} assume true; {26244#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:31,577 INFO L273 TraceCheckUtils]: 23: Hoare triple {26244#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26244#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:31,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {26244#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26244#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:31,579 INFO L273 TraceCheckUtils]: 25: Hoare triple {26244#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {26245#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:31,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {26245#(<= main_~i~0 5)} assume true; {26245#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:31,581 INFO L273 TraceCheckUtils]: 27: Hoare triple {26245#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26245#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:31,583 INFO L273 TraceCheckUtils]: 28: Hoare triple {26245#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26245#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:31,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {26245#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {26246#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:31,586 INFO L273 TraceCheckUtils]: 30: Hoare triple {26246#(<= main_~i~0 6)} assume true; {26246#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:31,588 INFO L273 TraceCheckUtils]: 31: Hoare triple {26246#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26246#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:31,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {26246#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26246#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:31,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {26246#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {26247#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:31,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {26247#(<= main_~i~0 7)} assume true; {26247#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:31,592 INFO L273 TraceCheckUtils]: 35: Hoare triple {26247#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26247#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:31,592 INFO L273 TraceCheckUtils]: 36: Hoare triple {26247#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26247#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:31,594 INFO L273 TraceCheckUtils]: 37: Hoare triple {26247#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {26248#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:31,594 INFO L273 TraceCheckUtils]: 38: Hoare triple {26248#(<= main_~i~0 8)} assume true; {26248#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:31,596 INFO L273 TraceCheckUtils]: 39: Hoare triple {26248#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26248#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:31,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {26248#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26248#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:31,598 INFO L273 TraceCheckUtils]: 41: Hoare triple {26248#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {26249#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:31,598 INFO L273 TraceCheckUtils]: 42: Hoare triple {26249#(<= main_~i~0 9)} assume true; {26249#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:31,600 INFO L273 TraceCheckUtils]: 43: Hoare triple {26249#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26249#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:31,600 INFO L273 TraceCheckUtils]: 44: Hoare triple {26249#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26249#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:31,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {26249#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {26250#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:31,603 INFO L273 TraceCheckUtils]: 46: Hoare triple {26250#(<= main_~i~0 10)} assume true; {26250#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:31,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {26250#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26250#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:31,606 INFO L273 TraceCheckUtils]: 48: Hoare triple {26250#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26250#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:31,609 INFO L273 TraceCheckUtils]: 49: Hoare triple {26250#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {26251#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:31,609 INFO L273 TraceCheckUtils]: 50: Hoare triple {26251#(<= main_~i~0 11)} assume true; {26251#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:31,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {26251#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26251#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:31,612 INFO L273 TraceCheckUtils]: 52: Hoare triple {26251#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26251#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:31,615 INFO L273 TraceCheckUtils]: 53: Hoare triple {26251#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {26252#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:31,615 INFO L273 TraceCheckUtils]: 54: Hoare triple {26252#(<= main_~i~0 12)} assume true; {26252#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:31,617 INFO L273 TraceCheckUtils]: 55: Hoare triple {26252#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26252#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:31,617 INFO L273 TraceCheckUtils]: 56: Hoare triple {26252#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26252#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:31,619 INFO L273 TraceCheckUtils]: 57: Hoare triple {26252#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {26253#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:31,619 INFO L273 TraceCheckUtils]: 58: Hoare triple {26253#(<= main_~i~0 13)} assume true; {26253#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:31,622 INFO L273 TraceCheckUtils]: 59: Hoare triple {26253#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26253#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:31,622 INFO L273 TraceCheckUtils]: 60: Hoare triple {26253#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26253#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:31,624 INFO L273 TraceCheckUtils]: 61: Hoare triple {26253#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {26254#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:31,624 INFO L273 TraceCheckUtils]: 62: Hoare triple {26254#(<= main_~i~0 14)} assume true; {26254#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:31,627 INFO L273 TraceCheckUtils]: 63: Hoare triple {26254#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26254#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:31,627 INFO L273 TraceCheckUtils]: 64: Hoare triple {26254#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26254#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:31,629 INFO L273 TraceCheckUtils]: 65: Hoare triple {26254#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {26255#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:31,629 INFO L273 TraceCheckUtils]: 66: Hoare triple {26255#(<= main_~i~0 15)} assume true; {26255#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:31,631 INFO L273 TraceCheckUtils]: 67: Hoare triple {26255#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26255#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:31,631 INFO L273 TraceCheckUtils]: 68: Hoare triple {26255#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26255#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:31,634 INFO L273 TraceCheckUtils]: 69: Hoare triple {26255#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {26256#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:31,634 INFO L273 TraceCheckUtils]: 70: Hoare triple {26256#(<= main_~i~0 16)} assume true; {26256#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:31,636 INFO L273 TraceCheckUtils]: 71: Hoare triple {26256#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26256#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:31,636 INFO L273 TraceCheckUtils]: 72: Hoare triple {26256#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26256#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:31,639 INFO L273 TraceCheckUtils]: 73: Hoare triple {26256#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {26257#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:31,639 INFO L273 TraceCheckUtils]: 74: Hoare triple {26257#(<= main_~i~0 17)} assume true; {26257#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:31,642 INFO L273 TraceCheckUtils]: 75: Hoare triple {26257#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26257#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:31,642 INFO L273 TraceCheckUtils]: 76: Hoare triple {26257#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26257#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:31,644 INFO L273 TraceCheckUtils]: 77: Hoare triple {26257#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {26258#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:31,644 INFO L273 TraceCheckUtils]: 78: Hoare triple {26258#(<= main_~i~0 18)} assume true; {26258#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:31,647 INFO L273 TraceCheckUtils]: 79: Hoare triple {26258#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26258#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:31,647 INFO L273 TraceCheckUtils]: 80: Hoare triple {26258#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26258#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:31,650 INFO L273 TraceCheckUtils]: 81: Hoare triple {26258#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {26259#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:31,650 INFO L273 TraceCheckUtils]: 82: Hoare triple {26259#(<= main_~i~0 19)} assume true; {26259#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:31,650 INFO L273 TraceCheckUtils]: 83: Hoare triple {26259#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26259#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:31,651 INFO L273 TraceCheckUtils]: 84: Hoare triple {26259#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26259#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:31,652 INFO L273 TraceCheckUtils]: 85: Hoare triple {26259#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {26260#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:31,652 INFO L273 TraceCheckUtils]: 86: Hoare triple {26260#(<= main_~i~0 20)} assume true; {26260#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:31,654 INFO L273 TraceCheckUtils]: 87: Hoare triple {26260#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26260#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:31,654 INFO L273 TraceCheckUtils]: 88: Hoare triple {26260#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26260#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:31,654 INFO L273 TraceCheckUtils]: 89: Hoare triple {26260#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {26261#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:31,655 INFO L273 TraceCheckUtils]: 90: Hoare triple {26261#(<= main_~i~0 21)} assume true; {26261#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:31,655 INFO L273 TraceCheckUtils]: 91: Hoare triple {26261#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26261#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:31,655 INFO L273 TraceCheckUtils]: 92: Hoare triple {26261#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26261#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:31,656 INFO L273 TraceCheckUtils]: 93: Hoare triple {26261#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {26262#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:31,656 INFO L273 TraceCheckUtils]: 94: Hoare triple {26262#(<= main_~i~0 22)} assume true; {26262#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:31,656 INFO L273 TraceCheckUtils]: 95: Hoare triple {26262#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26262#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:31,657 INFO L273 TraceCheckUtils]: 96: Hoare triple {26262#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26262#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:31,657 INFO L273 TraceCheckUtils]: 97: Hoare triple {26262#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {26263#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:31,657 INFO L273 TraceCheckUtils]: 98: Hoare triple {26263#(<= main_~i~0 23)} assume true; {26263#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:31,658 INFO L273 TraceCheckUtils]: 99: Hoare triple {26263#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26263#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:31,658 INFO L273 TraceCheckUtils]: 100: Hoare triple {26263#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26263#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:31,659 INFO L273 TraceCheckUtils]: 101: Hoare triple {26263#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {26264#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:31,659 INFO L273 TraceCheckUtils]: 102: Hoare triple {26264#(<= main_~i~0 24)} assume true; {26264#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:31,660 INFO L273 TraceCheckUtils]: 103: Hoare triple {26264#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26264#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:31,660 INFO L273 TraceCheckUtils]: 104: Hoare triple {26264#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26264#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:31,661 INFO L273 TraceCheckUtils]: 105: Hoare triple {26264#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {26265#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:31,661 INFO L273 TraceCheckUtils]: 106: Hoare triple {26265#(<= main_~i~0 25)} assume true; {26265#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:31,662 INFO L273 TraceCheckUtils]: 107: Hoare triple {26265#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26265#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:31,662 INFO L273 TraceCheckUtils]: 108: Hoare triple {26265#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26265#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:31,663 INFO L273 TraceCheckUtils]: 109: Hoare triple {26265#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {26266#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:31,663 INFO L273 TraceCheckUtils]: 110: Hoare triple {26266#(<= main_~i~0 26)} assume true; {26266#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:31,664 INFO L273 TraceCheckUtils]: 111: Hoare triple {26266#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26266#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:31,664 INFO L273 TraceCheckUtils]: 112: Hoare triple {26266#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26266#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:31,665 INFO L273 TraceCheckUtils]: 113: Hoare triple {26266#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {26267#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:31,665 INFO L273 TraceCheckUtils]: 114: Hoare triple {26267#(<= main_~i~0 27)} assume true; {26267#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:31,666 INFO L273 TraceCheckUtils]: 115: Hoare triple {26267#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26267#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:31,666 INFO L273 TraceCheckUtils]: 116: Hoare triple {26267#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26267#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:31,667 INFO L273 TraceCheckUtils]: 117: Hoare triple {26267#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {26268#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:31,667 INFO L273 TraceCheckUtils]: 118: Hoare triple {26268#(<= main_~i~0 28)} assume true; {26268#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:31,668 INFO L273 TraceCheckUtils]: 119: Hoare triple {26268#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26268#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:31,668 INFO L273 TraceCheckUtils]: 120: Hoare triple {26268#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26268#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:31,669 INFO L273 TraceCheckUtils]: 121: Hoare triple {26268#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {26269#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:31,669 INFO L273 TraceCheckUtils]: 122: Hoare triple {26269#(<= main_~i~0 29)} assume true; {26269#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:31,670 INFO L273 TraceCheckUtils]: 123: Hoare triple {26269#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26269#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:31,670 INFO L273 TraceCheckUtils]: 124: Hoare triple {26269#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26269#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:31,671 INFO L273 TraceCheckUtils]: 125: Hoare triple {26269#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {26270#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:31,671 INFO L273 TraceCheckUtils]: 126: Hoare triple {26270#(<= main_~i~0 30)} assume true; {26270#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:31,672 INFO L273 TraceCheckUtils]: 127: Hoare triple {26270#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26270#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:31,672 INFO L273 TraceCheckUtils]: 128: Hoare triple {26270#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26270#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:31,673 INFO L273 TraceCheckUtils]: 129: Hoare triple {26270#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {26271#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:31,673 INFO L273 TraceCheckUtils]: 130: Hoare triple {26271#(<= main_~i~0 31)} assume true; {26271#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:31,674 INFO L273 TraceCheckUtils]: 131: Hoare triple {26271#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26271#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:31,674 INFO L273 TraceCheckUtils]: 132: Hoare triple {26271#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26271#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:31,675 INFO L273 TraceCheckUtils]: 133: Hoare triple {26271#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {26272#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:31,676 INFO L273 TraceCheckUtils]: 134: Hoare triple {26272#(<= main_~i~0 32)} assume true; {26272#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:31,676 INFO L273 TraceCheckUtils]: 135: Hoare triple {26272#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26272#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:31,676 INFO L273 TraceCheckUtils]: 136: Hoare triple {26272#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26272#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:31,677 INFO L273 TraceCheckUtils]: 137: Hoare triple {26272#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {26273#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:31,678 INFO L273 TraceCheckUtils]: 138: Hoare triple {26273#(<= main_~i~0 33)} assume true; {26273#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:31,678 INFO L273 TraceCheckUtils]: 139: Hoare triple {26273#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26273#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:31,679 INFO L273 TraceCheckUtils]: 140: Hoare triple {26273#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26273#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:31,679 INFO L273 TraceCheckUtils]: 141: Hoare triple {26273#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {26274#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:31,680 INFO L273 TraceCheckUtils]: 142: Hoare triple {26274#(<= main_~i~0 34)} assume true; {26274#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:31,680 INFO L273 TraceCheckUtils]: 143: Hoare triple {26274#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26274#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:31,681 INFO L273 TraceCheckUtils]: 144: Hoare triple {26274#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26274#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:31,682 INFO L273 TraceCheckUtils]: 145: Hoare triple {26274#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {26275#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:31,682 INFO L273 TraceCheckUtils]: 146: Hoare triple {26275#(<= main_~i~0 35)} assume true; {26275#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:31,683 INFO L273 TraceCheckUtils]: 147: Hoare triple {26275#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26275#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:31,683 INFO L273 TraceCheckUtils]: 148: Hoare triple {26275#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26275#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:31,684 INFO L273 TraceCheckUtils]: 149: Hoare triple {26275#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {26276#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:31,684 INFO L273 TraceCheckUtils]: 150: Hoare triple {26276#(<= main_~i~0 36)} assume true; {26276#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:31,685 INFO L273 TraceCheckUtils]: 151: Hoare triple {26276#(<= main_~i~0 36)} assume !(~i~0 < 100000); {26239#false} is VALID [2018-11-18 22:57:31,685 INFO L273 TraceCheckUtils]: 152: Hoare triple {26239#false} havoc ~x~0;~x~0 := 0; {26239#false} is VALID [2018-11-18 22:57:31,685 INFO L273 TraceCheckUtils]: 153: Hoare triple {26239#false} assume true; {26239#false} is VALID [2018-11-18 22:57:31,686 INFO L273 TraceCheckUtils]: 154: Hoare triple {26239#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {26239#false} is VALID [2018-11-18 22:57:31,686 INFO L256 TraceCheckUtils]: 155: Hoare triple {26239#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {26239#false} is VALID [2018-11-18 22:57:31,686 INFO L273 TraceCheckUtils]: 156: Hoare triple {26239#false} ~cond := #in~cond; {26239#false} is VALID [2018-11-18 22:57:31,686 INFO L273 TraceCheckUtils]: 157: Hoare triple {26239#false} assume 0 == ~cond; {26239#false} is VALID [2018-11-18 22:57:31,686 INFO L273 TraceCheckUtils]: 158: Hoare triple {26239#false} assume !false; {26239#false} is VALID [2018-11-18 22:57:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:31,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:31,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:31,715 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:57:31,817 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-18 22:57:31,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:31,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:32,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {26238#true} call ULTIMATE.init(); {26238#true} is VALID [2018-11-18 22:57:32,688 INFO L273 TraceCheckUtils]: 1: Hoare triple {26238#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26238#true} is VALID [2018-11-18 22:57:32,688 INFO L273 TraceCheckUtils]: 2: Hoare triple {26238#true} assume true; {26238#true} is VALID [2018-11-18 22:57:32,689 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26238#true} {26238#true} #57#return; {26238#true} is VALID [2018-11-18 22:57:32,689 INFO L256 TraceCheckUtils]: 4: Hoare triple {26238#true} call #t~ret4 := main(); {26238#true} is VALID [2018-11-18 22:57:32,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {26238#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {26295#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:32,690 INFO L273 TraceCheckUtils]: 6: Hoare triple {26295#(<= main_~i~0 0)} assume true; {26295#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:32,691 INFO L273 TraceCheckUtils]: 7: Hoare triple {26295#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26295#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:32,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {26295#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26295#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:32,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {26295#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {26241#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:32,692 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#(<= main_~i~0 1)} assume true; {26241#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:32,692 INFO L273 TraceCheckUtils]: 11: Hoare triple {26241#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26241#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:32,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26241#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:32,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {26241#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {26242#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:32,693 INFO L273 TraceCheckUtils]: 14: Hoare triple {26242#(<= main_~i~0 2)} assume true; {26242#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:32,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {26242#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26242#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:32,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {26242#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26242#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:32,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {26242#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {26243#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:32,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {26243#(<= main_~i~0 3)} assume true; {26243#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:32,696 INFO L273 TraceCheckUtils]: 19: Hoare triple {26243#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26243#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:32,696 INFO L273 TraceCheckUtils]: 20: Hoare triple {26243#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26243#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:32,697 INFO L273 TraceCheckUtils]: 21: Hoare triple {26243#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {26244#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:32,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {26244#(<= main_~i~0 4)} assume true; {26244#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:32,698 INFO L273 TraceCheckUtils]: 23: Hoare triple {26244#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26244#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:32,699 INFO L273 TraceCheckUtils]: 24: Hoare triple {26244#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26244#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:32,699 INFO L273 TraceCheckUtils]: 25: Hoare triple {26244#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {26245#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:32,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {26245#(<= main_~i~0 5)} assume true; {26245#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:32,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {26245#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26245#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:32,701 INFO L273 TraceCheckUtils]: 28: Hoare triple {26245#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26245#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:32,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {26245#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {26246#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:32,702 INFO L273 TraceCheckUtils]: 30: Hoare triple {26246#(<= main_~i~0 6)} assume true; {26246#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:32,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {26246#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26246#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:32,703 INFO L273 TraceCheckUtils]: 32: Hoare triple {26246#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26246#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:32,704 INFO L273 TraceCheckUtils]: 33: Hoare triple {26246#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {26247#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:32,704 INFO L273 TraceCheckUtils]: 34: Hoare triple {26247#(<= main_~i~0 7)} assume true; {26247#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:32,705 INFO L273 TraceCheckUtils]: 35: Hoare triple {26247#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26247#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:32,705 INFO L273 TraceCheckUtils]: 36: Hoare triple {26247#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26247#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:32,706 INFO L273 TraceCheckUtils]: 37: Hoare triple {26247#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {26248#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:32,706 INFO L273 TraceCheckUtils]: 38: Hoare triple {26248#(<= main_~i~0 8)} assume true; {26248#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:32,707 INFO L273 TraceCheckUtils]: 39: Hoare triple {26248#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26248#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:32,707 INFO L273 TraceCheckUtils]: 40: Hoare triple {26248#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26248#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:32,708 INFO L273 TraceCheckUtils]: 41: Hoare triple {26248#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {26249#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:32,709 INFO L273 TraceCheckUtils]: 42: Hoare triple {26249#(<= main_~i~0 9)} assume true; {26249#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:32,710 INFO L273 TraceCheckUtils]: 43: Hoare triple {26249#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26249#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:32,710 INFO L273 TraceCheckUtils]: 44: Hoare triple {26249#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26249#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:32,711 INFO L273 TraceCheckUtils]: 45: Hoare triple {26249#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {26250#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:32,712 INFO L273 TraceCheckUtils]: 46: Hoare triple {26250#(<= main_~i~0 10)} assume true; {26250#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:32,712 INFO L273 TraceCheckUtils]: 47: Hoare triple {26250#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26250#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:32,713 INFO L273 TraceCheckUtils]: 48: Hoare triple {26250#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26250#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:32,713 INFO L273 TraceCheckUtils]: 49: Hoare triple {26250#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {26251#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:32,714 INFO L273 TraceCheckUtils]: 50: Hoare triple {26251#(<= main_~i~0 11)} assume true; {26251#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:32,714 INFO L273 TraceCheckUtils]: 51: Hoare triple {26251#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26251#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:32,715 INFO L273 TraceCheckUtils]: 52: Hoare triple {26251#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26251#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:32,715 INFO L273 TraceCheckUtils]: 53: Hoare triple {26251#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {26252#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:32,716 INFO L273 TraceCheckUtils]: 54: Hoare triple {26252#(<= main_~i~0 12)} assume true; {26252#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:32,716 INFO L273 TraceCheckUtils]: 55: Hoare triple {26252#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26252#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:32,717 INFO L273 TraceCheckUtils]: 56: Hoare triple {26252#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26252#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:32,718 INFO L273 TraceCheckUtils]: 57: Hoare triple {26252#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {26253#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:32,718 INFO L273 TraceCheckUtils]: 58: Hoare triple {26253#(<= main_~i~0 13)} assume true; {26253#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:32,719 INFO L273 TraceCheckUtils]: 59: Hoare triple {26253#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26253#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:32,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {26253#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26253#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:32,720 INFO L273 TraceCheckUtils]: 61: Hoare triple {26253#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {26254#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:32,720 INFO L273 TraceCheckUtils]: 62: Hoare triple {26254#(<= main_~i~0 14)} assume true; {26254#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:32,721 INFO L273 TraceCheckUtils]: 63: Hoare triple {26254#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26254#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:32,721 INFO L273 TraceCheckUtils]: 64: Hoare triple {26254#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26254#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:32,722 INFO L273 TraceCheckUtils]: 65: Hoare triple {26254#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {26255#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:32,723 INFO L273 TraceCheckUtils]: 66: Hoare triple {26255#(<= main_~i~0 15)} assume true; {26255#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:32,723 INFO L273 TraceCheckUtils]: 67: Hoare triple {26255#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26255#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:32,724 INFO L273 TraceCheckUtils]: 68: Hoare triple {26255#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26255#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:32,724 INFO L273 TraceCheckUtils]: 69: Hoare triple {26255#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {26256#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:32,725 INFO L273 TraceCheckUtils]: 70: Hoare triple {26256#(<= main_~i~0 16)} assume true; {26256#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:32,725 INFO L273 TraceCheckUtils]: 71: Hoare triple {26256#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26256#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:32,726 INFO L273 TraceCheckUtils]: 72: Hoare triple {26256#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26256#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:32,726 INFO L273 TraceCheckUtils]: 73: Hoare triple {26256#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {26257#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:32,727 INFO L273 TraceCheckUtils]: 74: Hoare triple {26257#(<= main_~i~0 17)} assume true; {26257#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:32,727 INFO L273 TraceCheckUtils]: 75: Hoare triple {26257#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26257#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:32,728 INFO L273 TraceCheckUtils]: 76: Hoare triple {26257#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26257#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:32,729 INFO L273 TraceCheckUtils]: 77: Hoare triple {26257#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {26258#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:32,729 INFO L273 TraceCheckUtils]: 78: Hoare triple {26258#(<= main_~i~0 18)} assume true; {26258#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:32,730 INFO L273 TraceCheckUtils]: 79: Hoare triple {26258#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26258#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:32,730 INFO L273 TraceCheckUtils]: 80: Hoare triple {26258#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26258#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:32,731 INFO L273 TraceCheckUtils]: 81: Hoare triple {26258#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {26259#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:32,731 INFO L273 TraceCheckUtils]: 82: Hoare triple {26259#(<= main_~i~0 19)} assume true; {26259#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:32,732 INFO L273 TraceCheckUtils]: 83: Hoare triple {26259#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26259#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:32,732 INFO L273 TraceCheckUtils]: 84: Hoare triple {26259#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26259#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:32,733 INFO L273 TraceCheckUtils]: 85: Hoare triple {26259#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {26260#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:32,734 INFO L273 TraceCheckUtils]: 86: Hoare triple {26260#(<= main_~i~0 20)} assume true; {26260#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:32,734 INFO L273 TraceCheckUtils]: 87: Hoare triple {26260#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26260#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:32,735 INFO L273 TraceCheckUtils]: 88: Hoare triple {26260#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26260#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:32,735 INFO L273 TraceCheckUtils]: 89: Hoare triple {26260#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {26261#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:32,736 INFO L273 TraceCheckUtils]: 90: Hoare triple {26261#(<= main_~i~0 21)} assume true; {26261#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:32,736 INFO L273 TraceCheckUtils]: 91: Hoare triple {26261#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26261#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:32,737 INFO L273 TraceCheckUtils]: 92: Hoare triple {26261#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26261#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:32,737 INFO L273 TraceCheckUtils]: 93: Hoare triple {26261#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {26262#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:32,738 INFO L273 TraceCheckUtils]: 94: Hoare triple {26262#(<= main_~i~0 22)} assume true; {26262#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:32,748 INFO L273 TraceCheckUtils]: 95: Hoare triple {26262#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26262#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:32,748 INFO L273 TraceCheckUtils]: 96: Hoare triple {26262#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26262#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:32,749 INFO L273 TraceCheckUtils]: 97: Hoare triple {26262#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {26263#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:32,749 INFO L273 TraceCheckUtils]: 98: Hoare triple {26263#(<= main_~i~0 23)} assume true; {26263#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:32,749 INFO L273 TraceCheckUtils]: 99: Hoare triple {26263#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26263#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:32,749 INFO L273 TraceCheckUtils]: 100: Hoare triple {26263#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26263#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:32,750 INFO L273 TraceCheckUtils]: 101: Hoare triple {26263#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {26264#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:32,750 INFO L273 TraceCheckUtils]: 102: Hoare triple {26264#(<= main_~i~0 24)} assume true; {26264#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:32,750 INFO L273 TraceCheckUtils]: 103: Hoare triple {26264#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26264#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:32,751 INFO L273 TraceCheckUtils]: 104: Hoare triple {26264#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26264#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:32,751 INFO L273 TraceCheckUtils]: 105: Hoare triple {26264#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {26265#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:32,751 INFO L273 TraceCheckUtils]: 106: Hoare triple {26265#(<= main_~i~0 25)} assume true; {26265#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:32,752 INFO L273 TraceCheckUtils]: 107: Hoare triple {26265#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26265#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:32,752 INFO L273 TraceCheckUtils]: 108: Hoare triple {26265#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26265#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:32,753 INFO L273 TraceCheckUtils]: 109: Hoare triple {26265#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {26266#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:32,754 INFO L273 TraceCheckUtils]: 110: Hoare triple {26266#(<= main_~i~0 26)} assume true; {26266#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:32,754 INFO L273 TraceCheckUtils]: 111: Hoare triple {26266#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26266#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:32,755 INFO L273 TraceCheckUtils]: 112: Hoare triple {26266#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26266#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:32,755 INFO L273 TraceCheckUtils]: 113: Hoare triple {26266#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {26267#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:32,756 INFO L273 TraceCheckUtils]: 114: Hoare triple {26267#(<= main_~i~0 27)} assume true; {26267#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:32,756 INFO L273 TraceCheckUtils]: 115: Hoare triple {26267#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26267#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:32,757 INFO L273 TraceCheckUtils]: 116: Hoare triple {26267#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26267#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:32,757 INFO L273 TraceCheckUtils]: 117: Hoare triple {26267#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {26268#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:32,758 INFO L273 TraceCheckUtils]: 118: Hoare triple {26268#(<= main_~i~0 28)} assume true; {26268#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:32,758 INFO L273 TraceCheckUtils]: 119: Hoare triple {26268#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26268#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:32,759 INFO L273 TraceCheckUtils]: 120: Hoare triple {26268#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26268#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:32,760 INFO L273 TraceCheckUtils]: 121: Hoare triple {26268#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {26269#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:32,760 INFO L273 TraceCheckUtils]: 122: Hoare triple {26269#(<= main_~i~0 29)} assume true; {26269#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:32,761 INFO L273 TraceCheckUtils]: 123: Hoare triple {26269#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26269#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:32,761 INFO L273 TraceCheckUtils]: 124: Hoare triple {26269#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26269#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:32,762 INFO L273 TraceCheckUtils]: 125: Hoare triple {26269#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {26270#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:32,762 INFO L273 TraceCheckUtils]: 126: Hoare triple {26270#(<= main_~i~0 30)} assume true; {26270#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:32,763 INFO L273 TraceCheckUtils]: 127: Hoare triple {26270#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26270#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:32,763 INFO L273 TraceCheckUtils]: 128: Hoare triple {26270#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26270#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:32,764 INFO L273 TraceCheckUtils]: 129: Hoare triple {26270#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {26271#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:32,765 INFO L273 TraceCheckUtils]: 130: Hoare triple {26271#(<= main_~i~0 31)} assume true; {26271#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:32,765 INFO L273 TraceCheckUtils]: 131: Hoare triple {26271#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26271#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:32,765 INFO L273 TraceCheckUtils]: 132: Hoare triple {26271#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26271#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:32,766 INFO L273 TraceCheckUtils]: 133: Hoare triple {26271#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {26272#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:32,767 INFO L273 TraceCheckUtils]: 134: Hoare triple {26272#(<= main_~i~0 32)} assume true; {26272#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:32,767 INFO L273 TraceCheckUtils]: 135: Hoare triple {26272#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26272#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:32,768 INFO L273 TraceCheckUtils]: 136: Hoare triple {26272#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26272#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:32,768 INFO L273 TraceCheckUtils]: 137: Hoare triple {26272#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {26273#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:32,769 INFO L273 TraceCheckUtils]: 138: Hoare triple {26273#(<= main_~i~0 33)} assume true; {26273#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:32,769 INFO L273 TraceCheckUtils]: 139: Hoare triple {26273#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26273#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:32,770 INFO L273 TraceCheckUtils]: 140: Hoare triple {26273#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26273#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:32,771 INFO L273 TraceCheckUtils]: 141: Hoare triple {26273#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {26274#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:32,771 INFO L273 TraceCheckUtils]: 142: Hoare triple {26274#(<= main_~i~0 34)} assume true; {26274#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:32,772 INFO L273 TraceCheckUtils]: 143: Hoare triple {26274#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26274#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:32,772 INFO L273 TraceCheckUtils]: 144: Hoare triple {26274#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26274#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:32,773 INFO L273 TraceCheckUtils]: 145: Hoare triple {26274#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {26275#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:32,773 INFO L273 TraceCheckUtils]: 146: Hoare triple {26275#(<= main_~i~0 35)} assume true; {26275#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:32,774 INFO L273 TraceCheckUtils]: 147: Hoare triple {26275#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26275#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:32,774 INFO L273 TraceCheckUtils]: 148: Hoare triple {26275#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26275#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:32,775 INFO L273 TraceCheckUtils]: 149: Hoare triple {26275#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {26276#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:32,775 INFO L273 TraceCheckUtils]: 150: Hoare triple {26276#(<= main_~i~0 36)} assume true; {26276#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:32,776 INFO L273 TraceCheckUtils]: 151: Hoare triple {26276#(<= main_~i~0 36)} assume !(~i~0 < 100000); {26239#false} is VALID [2018-11-18 22:57:32,776 INFO L273 TraceCheckUtils]: 152: Hoare triple {26239#false} havoc ~x~0;~x~0 := 0; {26239#false} is VALID [2018-11-18 22:57:32,776 INFO L273 TraceCheckUtils]: 153: Hoare triple {26239#false} assume true; {26239#false} is VALID [2018-11-18 22:57:32,777 INFO L273 TraceCheckUtils]: 154: Hoare triple {26239#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {26239#false} is VALID [2018-11-18 22:57:32,777 INFO L256 TraceCheckUtils]: 155: Hoare triple {26239#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {26239#false} is VALID [2018-11-18 22:57:32,777 INFO L273 TraceCheckUtils]: 156: Hoare triple {26239#false} ~cond := #in~cond; {26239#false} is VALID [2018-11-18 22:57:32,777 INFO L273 TraceCheckUtils]: 157: Hoare triple {26239#false} assume 0 == ~cond; {26239#false} is VALID [2018-11-18 22:57:32,777 INFO L273 TraceCheckUtils]: 158: Hoare triple {26239#false} assume !false; {26239#false} is VALID [2018-11-18 22:57:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:32,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:32,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-18 22:57:32,816 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-11-18 22:57:32,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:32,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-18 22:57:32,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:32,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-18 22:57:32,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-18 22:57:32,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 22:57:32,969 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand 40 states. [2018-11-18 22:57:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:33,789 INFO L93 Difference]: Finished difference Result 182 states and 222 transitions. [2018-11-18 22:57:33,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 22:57:33,790 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-11-18 22:57:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:57:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 222 transitions. [2018-11-18 22:57:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:57:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 222 transitions. [2018-11-18 22:57:33,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 222 transitions. [2018-11-18 22:57:33,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:33,983 INFO L225 Difference]: With dead ends: 182 [2018-11-18 22:57:33,983 INFO L226 Difference]: Without dead ends: 170 [2018-11-18 22:57:33,984 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 22:57:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-18 22:57:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-11-18 22:57:34,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:34,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 168 states. [2018-11-18 22:57:34,012 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 168 states. [2018-11-18 22:57:34,012 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 168 states. [2018-11-18 22:57:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:34,015 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2018-11-18 22:57:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2018-11-18 22:57:34,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:34,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:34,015 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 170 states. [2018-11-18 22:57:34,015 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 170 states. [2018-11-18 22:57:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:34,017 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2018-11-18 22:57:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2018-11-18 22:57:34,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:34,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:34,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:34,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-18 22:57:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2018-11-18 22:57:34,020 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 159 [2018-11-18 22:57:34,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:34,020 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2018-11-18 22:57:34,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-18 22:57:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2018-11-18 22:57:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 22:57:34,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:34,021 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:34,022 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:34,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1846137072, now seen corresponding path program 37 times [2018-11-18 22:57:34,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:34,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:34,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:35,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {27537#true} call ULTIMATE.init(); {27537#true} is VALID [2018-11-18 22:57:35,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {27537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27537#true} is VALID [2018-11-18 22:57:35,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {27537#true} assume true; {27537#true} is VALID [2018-11-18 22:57:35,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27537#true} {27537#true} #57#return; {27537#true} is VALID [2018-11-18 22:57:35,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {27537#true} call #t~ret4 := main(); {27537#true} is VALID [2018-11-18 22:57:35,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {27537#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {27539#(= main_~i~0 0)} is VALID [2018-11-18 22:57:35,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {27539#(= main_~i~0 0)} assume true; {27539#(= main_~i~0 0)} is VALID [2018-11-18 22:57:35,009 INFO L273 TraceCheckUtils]: 7: Hoare triple {27539#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27539#(= main_~i~0 0)} is VALID [2018-11-18 22:57:35,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {27539#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27539#(= main_~i~0 0)} is VALID [2018-11-18 22:57:35,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {27539#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {27540#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {27540#(<= main_~i~0 1)} assume true; {27540#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {27540#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27540#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {27540#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27540#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {27540#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {27541#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {27541#(<= main_~i~0 2)} assume true; {27541#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {27541#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27541#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {27541#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27541#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {27541#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {27542#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {27542#(<= main_~i~0 3)} assume true; {27542#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {27542#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27542#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {27542#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27542#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {27542#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {27543#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {27543#(<= main_~i~0 4)} assume true; {27543#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {27543#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27543#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {27543#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27543#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {27543#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {27544#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,018 INFO L273 TraceCheckUtils]: 26: Hoare triple {27544#(<= main_~i~0 5)} assume true; {27544#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,019 INFO L273 TraceCheckUtils]: 27: Hoare triple {27544#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27544#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {27544#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27544#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,020 INFO L273 TraceCheckUtils]: 29: Hoare triple {27544#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {27545#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,020 INFO L273 TraceCheckUtils]: 30: Hoare triple {27545#(<= main_~i~0 6)} assume true; {27545#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,021 INFO L273 TraceCheckUtils]: 31: Hoare triple {27545#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27545#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {27545#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27545#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,022 INFO L273 TraceCheckUtils]: 33: Hoare triple {27545#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {27546#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,023 INFO L273 TraceCheckUtils]: 34: Hoare triple {27546#(<= main_~i~0 7)} assume true; {27546#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,023 INFO L273 TraceCheckUtils]: 35: Hoare triple {27546#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27546#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {27546#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27546#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,024 INFO L273 TraceCheckUtils]: 37: Hoare triple {27546#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {27547#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,025 INFO L273 TraceCheckUtils]: 38: Hoare triple {27547#(<= main_~i~0 8)} assume true; {27547#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,025 INFO L273 TraceCheckUtils]: 39: Hoare triple {27547#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27547#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,026 INFO L273 TraceCheckUtils]: 40: Hoare triple {27547#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27547#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,026 INFO L273 TraceCheckUtils]: 41: Hoare triple {27547#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {27548#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,027 INFO L273 TraceCheckUtils]: 42: Hoare triple {27548#(<= main_~i~0 9)} assume true; {27548#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,027 INFO L273 TraceCheckUtils]: 43: Hoare triple {27548#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27548#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,028 INFO L273 TraceCheckUtils]: 44: Hoare triple {27548#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27548#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,028 INFO L273 TraceCheckUtils]: 45: Hoare triple {27548#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {27549#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,029 INFO L273 TraceCheckUtils]: 46: Hoare triple {27549#(<= main_~i~0 10)} assume true; {27549#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,029 INFO L273 TraceCheckUtils]: 47: Hoare triple {27549#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27549#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,030 INFO L273 TraceCheckUtils]: 48: Hoare triple {27549#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27549#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,030 INFO L273 TraceCheckUtils]: 49: Hoare triple {27549#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {27550#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,031 INFO L273 TraceCheckUtils]: 50: Hoare triple {27550#(<= main_~i~0 11)} assume true; {27550#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,031 INFO L273 TraceCheckUtils]: 51: Hoare triple {27550#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27550#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,032 INFO L273 TraceCheckUtils]: 52: Hoare triple {27550#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27550#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,033 INFO L273 TraceCheckUtils]: 53: Hoare triple {27550#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {27551#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,033 INFO L273 TraceCheckUtils]: 54: Hoare triple {27551#(<= main_~i~0 12)} assume true; {27551#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,034 INFO L273 TraceCheckUtils]: 55: Hoare triple {27551#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27551#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,034 INFO L273 TraceCheckUtils]: 56: Hoare triple {27551#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27551#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,035 INFO L273 TraceCheckUtils]: 57: Hoare triple {27551#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {27552#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,035 INFO L273 TraceCheckUtils]: 58: Hoare triple {27552#(<= main_~i~0 13)} assume true; {27552#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,036 INFO L273 TraceCheckUtils]: 59: Hoare triple {27552#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27552#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,036 INFO L273 TraceCheckUtils]: 60: Hoare triple {27552#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27552#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,037 INFO L273 TraceCheckUtils]: 61: Hoare triple {27552#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {27553#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,037 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#(<= main_~i~0 14)} assume true; {27553#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,038 INFO L273 TraceCheckUtils]: 63: Hoare triple {27553#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27553#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,038 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27553#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,039 INFO L273 TraceCheckUtils]: 65: Hoare triple {27553#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {27554#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,040 INFO L273 TraceCheckUtils]: 66: Hoare triple {27554#(<= main_~i~0 15)} assume true; {27554#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,040 INFO L273 TraceCheckUtils]: 67: Hoare triple {27554#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27554#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,041 INFO L273 TraceCheckUtils]: 68: Hoare triple {27554#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27554#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,041 INFO L273 TraceCheckUtils]: 69: Hoare triple {27554#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {27555#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,042 INFO L273 TraceCheckUtils]: 70: Hoare triple {27555#(<= main_~i~0 16)} assume true; {27555#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,042 INFO L273 TraceCheckUtils]: 71: Hoare triple {27555#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27555#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,043 INFO L273 TraceCheckUtils]: 72: Hoare triple {27555#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27555#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,043 INFO L273 TraceCheckUtils]: 73: Hoare triple {27555#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {27556#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,044 INFO L273 TraceCheckUtils]: 74: Hoare triple {27556#(<= main_~i~0 17)} assume true; {27556#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,044 INFO L273 TraceCheckUtils]: 75: Hoare triple {27556#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27556#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,045 INFO L273 TraceCheckUtils]: 76: Hoare triple {27556#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27556#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,046 INFO L273 TraceCheckUtils]: 77: Hoare triple {27556#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {27557#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,046 INFO L273 TraceCheckUtils]: 78: Hoare triple {27557#(<= main_~i~0 18)} assume true; {27557#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,047 INFO L273 TraceCheckUtils]: 79: Hoare triple {27557#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27557#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,047 INFO L273 TraceCheckUtils]: 80: Hoare triple {27557#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27557#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,048 INFO L273 TraceCheckUtils]: 81: Hoare triple {27557#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {27558#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,048 INFO L273 TraceCheckUtils]: 82: Hoare triple {27558#(<= main_~i~0 19)} assume true; {27558#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,049 INFO L273 TraceCheckUtils]: 83: Hoare triple {27558#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27558#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,049 INFO L273 TraceCheckUtils]: 84: Hoare triple {27558#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27558#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,050 INFO L273 TraceCheckUtils]: 85: Hoare triple {27558#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {27559#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,051 INFO L273 TraceCheckUtils]: 86: Hoare triple {27559#(<= main_~i~0 20)} assume true; {27559#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,051 INFO L273 TraceCheckUtils]: 87: Hoare triple {27559#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27559#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,052 INFO L273 TraceCheckUtils]: 88: Hoare triple {27559#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27559#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,052 INFO L273 TraceCheckUtils]: 89: Hoare triple {27559#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {27560#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,053 INFO L273 TraceCheckUtils]: 90: Hoare triple {27560#(<= main_~i~0 21)} assume true; {27560#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,053 INFO L273 TraceCheckUtils]: 91: Hoare triple {27560#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27560#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,054 INFO L273 TraceCheckUtils]: 92: Hoare triple {27560#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27560#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,054 INFO L273 TraceCheckUtils]: 93: Hoare triple {27560#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {27561#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,055 INFO L273 TraceCheckUtils]: 94: Hoare triple {27561#(<= main_~i~0 22)} assume true; {27561#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,055 INFO L273 TraceCheckUtils]: 95: Hoare triple {27561#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27561#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,056 INFO L273 TraceCheckUtils]: 96: Hoare triple {27561#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27561#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,056 INFO L273 TraceCheckUtils]: 97: Hoare triple {27561#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {27562#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,057 INFO L273 TraceCheckUtils]: 98: Hoare triple {27562#(<= main_~i~0 23)} assume true; {27562#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,057 INFO L273 TraceCheckUtils]: 99: Hoare triple {27562#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27562#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,058 INFO L273 TraceCheckUtils]: 100: Hoare triple {27562#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27562#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,059 INFO L273 TraceCheckUtils]: 101: Hoare triple {27562#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {27563#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,059 INFO L273 TraceCheckUtils]: 102: Hoare triple {27563#(<= main_~i~0 24)} assume true; {27563#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,060 INFO L273 TraceCheckUtils]: 103: Hoare triple {27563#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27563#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,060 INFO L273 TraceCheckUtils]: 104: Hoare triple {27563#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27563#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,061 INFO L273 TraceCheckUtils]: 105: Hoare triple {27563#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {27564#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,061 INFO L273 TraceCheckUtils]: 106: Hoare triple {27564#(<= main_~i~0 25)} assume true; {27564#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,062 INFO L273 TraceCheckUtils]: 107: Hoare triple {27564#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27564#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,062 INFO L273 TraceCheckUtils]: 108: Hoare triple {27564#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27564#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,063 INFO L273 TraceCheckUtils]: 109: Hoare triple {27564#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {27565#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,064 INFO L273 TraceCheckUtils]: 110: Hoare triple {27565#(<= main_~i~0 26)} assume true; {27565#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,064 INFO L273 TraceCheckUtils]: 111: Hoare triple {27565#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27565#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,065 INFO L273 TraceCheckUtils]: 112: Hoare triple {27565#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27565#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,065 INFO L273 TraceCheckUtils]: 113: Hoare triple {27565#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {27566#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:35,066 INFO L273 TraceCheckUtils]: 114: Hoare triple {27566#(<= main_~i~0 27)} assume true; {27566#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:35,066 INFO L273 TraceCheckUtils]: 115: Hoare triple {27566#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27566#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:35,067 INFO L273 TraceCheckUtils]: 116: Hoare triple {27566#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27566#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:35,067 INFO L273 TraceCheckUtils]: 117: Hoare triple {27566#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {27567#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:35,068 INFO L273 TraceCheckUtils]: 118: Hoare triple {27567#(<= main_~i~0 28)} assume true; {27567#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:35,068 INFO L273 TraceCheckUtils]: 119: Hoare triple {27567#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27567#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:35,069 INFO L273 TraceCheckUtils]: 120: Hoare triple {27567#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27567#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:35,069 INFO L273 TraceCheckUtils]: 121: Hoare triple {27567#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {27568#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:35,070 INFO L273 TraceCheckUtils]: 122: Hoare triple {27568#(<= main_~i~0 29)} assume true; {27568#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:35,070 INFO L273 TraceCheckUtils]: 123: Hoare triple {27568#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27568#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:35,071 INFO L273 TraceCheckUtils]: 124: Hoare triple {27568#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27568#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:35,072 INFO L273 TraceCheckUtils]: 125: Hoare triple {27568#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {27569#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:35,072 INFO L273 TraceCheckUtils]: 126: Hoare triple {27569#(<= main_~i~0 30)} assume true; {27569#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:35,072 INFO L273 TraceCheckUtils]: 127: Hoare triple {27569#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27569#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:35,073 INFO L273 TraceCheckUtils]: 128: Hoare triple {27569#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27569#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:35,074 INFO L273 TraceCheckUtils]: 129: Hoare triple {27569#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {27570#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:35,074 INFO L273 TraceCheckUtils]: 130: Hoare triple {27570#(<= main_~i~0 31)} assume true; {27570#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:35,075 INFO L273 TraceCheckUtils]: 131: Hoare triple {27570#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27570#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:35,075 INFO L273 TraceCheckUtils]: 132: Hoare triple {27570#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27570#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:35,076 INFO L273 TraceCheckUtils]: 133: Hoare triple {27570#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {27571#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:35,076 INFO L273 TraceCheckUtils]: 134: Hoare triple {27571#(<= main_~i~0 32)} assume true; {27571#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:35,077 INFO L273 TraceCheckUtils]: 135: Hoare triple {27571#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27571#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:35,077 INFO L273 TraceCheckUtils]: 136: Hoare triple {27571#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27571#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:35,078 INFO L273 TraceCheckUtils]: 137: Hoare triple {27571#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {27572#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:35,078 INFO L273 TraceCheckUtils]: 138: Hoare triple {27572#(<= main_~i~0 33)} assume true; {27572#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:35,079 INFO L273 TraceCheckUtils]: 139: Hoare triple {27572#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27572#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:35,079 INFO L273 TraceCheckUtils]: 140: Hoare triple {27572#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27572#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:35,080 INFO L273 TraceCheckUtils]: 141: Hoare triple {27572#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {27573#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:35,081 INFO L273 TraceCheckUtils]: 142: Hoare triple {27573#(<= main_~i~0 34)} assume true; {27573#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:35,081 INFO L273 TraceCheckUtils]: 143: Hoare triple {27573#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27573#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:35,082 INFO L273 TraceCheckUtils]: 144: Hoare triple {27573#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27573#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:35,082 INFO L273 TraceCheckUtils]: 145: Hoare triple {27573#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {27574#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:35,083 INFO L273 TraceCheckUtils]: 146: Hoare triple {27574#(<= main_~i~0 35)} assume true; {27574#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:35,083 INFO L273 TraceCheckUtils]: 147: Hoare triple {27574#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27574#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:35,084 INFO L273 TraceCheckUtils]: 148: Hoare triple {27574#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27574#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:35,084 INFO L273 TraceCheckUtils]: 149: Hoare triple {27574#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {27575#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:35,085 INFO L273 TraceCheckUtils]: 150: Hoare triple {27575#(<= main_~i~0 36)} assume true; {27575#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:35,085 INFO L273 TraceCheckUtils]: 151: Hoare triple {27575#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27575#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:35,086 INFO L273 TraceCheckUtils]: 152: Hoare triple {27575#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27575#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:35,086 INFO L273 TraceCheckUtils]: 153: Hoare triple {27575#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {27576#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:35,087 INFO L273 TraceCheckUtils]: 154: Hoare triple {27576#(<= main_~i~0 37)} assume true; {27576#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:35,088 INFO L273 TraceCheckUtils]: 155: Hoare triple {27576#(<= main_~i~0 37)} assume !(~i~0 < 100000); {27538#false} is VALID [2018-11-18 22:57:35,088 INFO L273 TraceCheckUtils]: 156: Hoare triple {27538#false} havoc ~x~0;~x~0 := 0; {27538#false} is VALID [2018-11-18 22:57:35,088 INFO L273 TraceCheckUtils]: 157: Hoare triple {27538#false} assume true; {27538#false} is VALID [2018-11-18 22:57:35,088 INFO L273 TraceCheckUtils]: 158: Hoare triple {27538#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {27538#false} is VALID [2018-11-18 22:57:35,088 INFO L256 TraceCheckUtils]: 159: Hoare triple {27538#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {27538#false} is VALID [2018-11-18 22:57:35,089 INFO L273 TraceCheckUtils]: 160: Hoare triple {27538#false} ~cond := #in~cond; {27538#false} is VALID [2018-11-18 22:57:35,089 INFO L273 TraceCheckUtils]: 161: Hoare triple {27538#false} assume 0 == ~cond; {27538#false} is VALID [2018-11-18 22:57:35,089 INFO L273 TraceCheckUtils]: 162: Hoare triple {27538#false} assume !false; {27538#false} is VALID [2018-11-18 22:57:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:35,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:35,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:35,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:35,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:35,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {27537#true} call ULTIMATE.init(); {27537#true} is VALID [2018-11-18 22:57:35,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {27537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27537#true} is VALID [2018-11-18 22:57:35,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {27537#true} assume true; {27537#true} is VALID [2018-11-18 22:57:35,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27537#true} {27537#true} #57#return; {27537#true} is VALID [2018-11-18 22:57:35,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {27537#true} call #t~ret4 := main(); {27537#true} is VALID [2018-11-18 22:57:35,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {27537#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {27595#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:35,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {27595#(<= main_~i~0 0)} assume true; {27595#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:35,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {27595#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27595#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:35,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {27595#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27595#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:35,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {27595#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {27540#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {27540#(<= main_~i~0 1)} assume true; {27540#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {27540#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27540#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {27540#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27540#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {27540#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {27541#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {27541#(<= main_~i~0 2)} assume true; {27541#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {27541#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27541#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {27541#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27541#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {27541#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {27542#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {27542#(<= main_~i~0 3)} assume true; {27542#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {27542#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27542#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {27542#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27542#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {27542#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {27543#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {27543#(<= main_~i~0 4)} assume true; {27543#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {27543#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27543#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {27543#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27543#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {27543#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {27544#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {27544#(<= main_~i~0 5)} assume true; {27544#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {27544#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27544#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,662 INFO L273 TraceCheckUtils]: 28: Hoare triple {27544#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27544#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {27544#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {27545#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,663 INFO L273 TraceCheckUtils]: 30: Hoare triple {27545#(<= main_~i~0 6)} assume true; {27545#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {27545#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27545#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,664 INFO L273 TraceCheckUtils]: 32: Hoare triple {27545#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27545#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,665 INFO L273 TraceCheckUtils]: 33: Hoare triple {27545#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {27546#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,665 INFO L273 TraceCheckUtils]: 34: Hoare triple {27546#(<= main_~i~0 7)} assume true; {27546#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,666 INFO L273 TraceCheckUtils]: 35: Hoare triple {27546#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27546#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {27546#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27546#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,667 INFO L273 TraceCheckUtils]: 37: Hoare triple {27546#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {27547#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,667 INFO L273 TraceCheckUtils]: 38: Hoare triple {27547#(<= main_~i~0 8)} assume true; {27547#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,668 INFO L273 TraceCheckUtils]: 39: Hoare triple {27547#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27547#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,668 INFO L273 TraceCheckUtils]: 40: Hoare triple {27547#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27547#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,669 INFO L273 TraceCheckUtils]: 41: Hoare triple {27547#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {27548#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,670 INFO L273 TraceCheckUtils]: 42: Hoare triple {27548#(<= main_~i~0 9)} assume true; {27548#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,670 INFO L273 TraceCheckUtils]: 43: Hoare triple {27548#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27548#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,671 INFO L273 TraceCheckUtils]: 44: Hoare triple {27548#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27548#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,671 INFO L273 TraceCheckUtils]: 45: Hoare triple {27548#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {27549#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,672 INFO L273 TraceCheckUtils]: 46: Hoare triple {27549#(<= main_~i~0 10)} assume true; {27549#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,672 INFO L273 TraceCheckUtils]: 47: Hoare triple {27549#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27549#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,673 INFO L273 TraceCheckUtils]: 48: Hoare triple {27549#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27549#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,674 INFO L273 TraceCheckUtils]: 49: Hoare triple {27549#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {27550#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,674 INFO L273 TraceCheckUtils]: 50: Hoare triple {27550#(<= main_~i~0 11)} assume true; {27550#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,674 INFO L273 TraceCheckUtils]: 51: Hoare triple {27550#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27550#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,675 INFO L273 TraceCheckUtils]: 52: Hoare triple {27550#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27550#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,676 INFO L273 TraceCheckUtils]: 53: Hoare triple {27550#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {27551#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,676 INFO L273 TraceCheckUtils]: 54: Hoare triple {27551#(<= main_~i~0 12)} assume true; {27551#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,677 INFO L273 TraceCheckUtils]: 55: Hoare triple {27551#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27551#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,677 INFO L273 TraceCheckUtils]: 56: Hoare triple {27551#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27551#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,678 INFO L273 TraceCheckUtils]: 57: Hoare triple {27551#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {27552#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,678 INFO L273 TraceCheckUtils]: 58: Hoare triple {27552#(<= main_~i~0 13)} assume true; {27552#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,679 INFO L273 TraceCheckUtils]: 59: Hoare triple {27552#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27552#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,679 INFO L273 TraceCheckUtils]: 60: Hoare triple {27552#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27552#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,680 INFO L273 TraceCheckUtils]: 61: Hoare triple {27552#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {27553#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,681 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#(<= main_~i~0 14)} assume true; {27553#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,681 INFO L273 TraceCheckUtils]: 63: Hoare triple {27553#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27553#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,682 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27553#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,682 INFO L273 TraceCheckUtils]: 65: Hoare triple {27553#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {27554#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,683 INFO L273 TraceCheckUtils]: 66: Hoare triple {27554#(<= main_~i~0 15)} assume true; {27554#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,683 INFO L273 TraceCheckUtils]: 67: Hoare triple {27554#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27554#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,684 INFO L273 TraceCheckUtils]: 68: Hoare triple {27554#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27554#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,684 INFO L273 TraceCheckUtils]: 69: Hoare triple {27554#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {27555#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,685 INFO L273 TraceCheckUtils]: 70: Hoare triple {27555#(<= main_~i~0 16)} assume true; {27555#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,685 INFO L273 TraceCheckUtils]: 71: Hoare triple {27555#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27555#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,686 INFO L273 TraceCheckUtils]: 72: Hoare triple {27555#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27555#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,687 INFO L273 TraceCheckUtils]: 73: Hoare triple {27555#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {27556#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,687 INFO L273 TraceCheckUtils]: 74: Hoare triple {27556#(<= main_~i~0 17)} assume true; {27556#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,688 INFO L273 TraceCheckUtils]: 75: Hoare triple {27556#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27556#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,688 INFO L273 TraceCheckUtils]: 76: Hoare triple {27556#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27556#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,689 INFO L273 TraceCheckUtils]: 77: Hoare triple {27556#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {27557#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,689 INFO L273 TraceCheckUtils]: 78: Hoare triple {27557#(<= main_~i~0 18)} assume true; {27557#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,690 INFO L273 TraceCheckUtils]: 79: Hoare triple {27557#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27557#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,690 INFO L273 TraceCheckUtils]: 80: Hoare triple {27557#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27557#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,691 INFO L273 TraceCheckUtils]: 81: Hoare triple {27557#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {27558#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,692 INFO L273 TraceCheckUtils]: 82: Hoare triple {27558#(<= main_~i~0 19)} assume true; {27558#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,692 INFO L273 TraceCheckUtils]: 83: Hoare triple {27558#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27558#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,693 INFO L273 TraceCheckUtils]: 84: Hoare triple {27558#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27558#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,693 INFO L273 TraceCheckUtils]: 85: Hoare triple {27558#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {27559#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,694 INFO L273 TraceCheckUtils]: 86: Hoare triple {27559#(<= main_~i~0 20)} assume true; {27559#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,694 INFO L273 TraceCheckUtils]: 87: Hoare triple {27559#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27559#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,695 INFO L273 TraceCheckUtils]: 88: Hoare triple {27559#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27559#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,695 INFO L273 TraceCheckUtils]: 89: Hoare triple {27559#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {27560#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,696 INFO L273 TraceCheckUtils]: 90: Hoare triple {27560#(<= main_~i~0 21)} assume true; {27560#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,696 INFO L273 TraceCheckUtils]: 91: Hoare triple {27560#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27560#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,697 INFO L273 TraceCheckUtils]: 92: Hoare triple {27560#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27560#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,698 INFO L273 TraceCheckUtils]: 93: Hoare triple {27560#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {27561#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,698 INFO L273 TraceCheckUtils]: 94: Hoare triple {27561#(<= main_~i~0 22)} assume true; {27561#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,699 INFO L273 TraceCheckUtils]: 95: Hoare triple {27561#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27561#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,699 INFO L273 TraceCheckUtils]: 96: Hoare triple {27561#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27561#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,700 INFO L273 TraceCheckUtils]: 97: Hoare triple {27561#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {27562#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,700 INFO L273 TraceCheckUtils]: 98: Hoare triple {27562#(<= main_~i~0 23)} assume true; {27562#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,701 INFO L273 TraceCheckUtils]: 99: Hoare triple {27562#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27562#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,701 INFO L273 TraceCheckUtils]: 100: Hoare triple {27562#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27562#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,702 INFO L273 TraceCheckUtils]: 101: Hoare triple {27562#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {27563#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,703 INFO L273 TraceCheckUtils]: 102: Hoare triple {27563#(<= main_~i~0 24)} assume true; {27563#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,703 INFO L273 TraceCheckUtils]: 103: Hoare triple {27563#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27563#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,704 INFO L273 TraceCheckUtils]: 104: Hoare triple {27563#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27563#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,704 INFO L273 TraceCheckUtils]: 105: Hoare triple {27563#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {27564#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,705 INFO L273 TraceCheckUtils]: 106: Hoare triple {27564#(<= main_~i~0 25)} assume true; {27564#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,705 INFO L273 TraceCheckUtils]: 107: Hoare triple {27564#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27564#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,706 INFO L273 TraceCheckUtils]: 108: Hoare triple {27564#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27564#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,706 INFO L273 TraceCheckUtils]: 109: Hoare triple {27564#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {27565#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,707 INFO L273 TraceCheckUtils]: 110: Hoare triple {27565#(<= main_~i~0 26)} assume true; {27565#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,707 INFO L273 TraceCheckUtils]: 111: Hoare triple {27565#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27565#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,708 INFO L273 TraceCheckUtils]: 112: Hoare triple {27565#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27565#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,709 INFO L273 TraceCheckUtils]: 113: Hoare triple {27565#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {27566#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:35,709 INFO L273 TraceCheckUtils]: 114: Hoare triple {27566#(<= main_~i~0 27)} assume true; {27566#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:35,710 INFO L273 TraceCheckUtils]: 115: Hoare triple {27566#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27566#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:35,710 INFO L273 TraceCheckUtils]: 116: Hoare triple {27566#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27566#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:35,711 INFO L273 TraceCheckUtils]: 117: Hoare triple {27566#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {27567#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:35,711 INFO L273 TraceCheckUtils]: 118: Hoare triple {27567#(<= main_~i~0 28)} assume true; {27567#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:35,712 INFO L273 TraceCheckUtils]: 119: Hoare triple {27567#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27567#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:35,712 INFO L273 TraceCheckUtils]: 120: Hoare triple {27567#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27567#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:35,713 INFO L273 TraceCheckUtils]: 121: Hoare triple {27567#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {27568#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:35,714 INFO L273 TraceCheckUtils]: 122: Hoare triple {27568#(<= main_~i~0 29)} assume true; {27568#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:35,714 INFO L273 TraceCheckUtils]: 123: Hoare triple {27568#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27568#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:35,714 INFO L273 TraceCheckUtils]: 124: Hoare triple {27568#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27568#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:35,715 INFO L273 TraceCheckUtils]: 125: Hoare triple {27568#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {27569#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:35,716 INFO L273 TraceCheckUtils]: 126: Hoare triple {27569#(<= main_~i~0 30)} assume true; {27569#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:35,716 INFO L273 TraceCheckUtils]: 127: Hoare triple {27569#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27569#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:35,717 INFO L273 TraceCheckUtils]: 128: Hoare triple {27569#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27569#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:35,717 INFO L273 TraceCheckUtils]: 129: Hoare triple {27569#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {27570#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:35,718 INFO L273 TraceCheckUtils]: 130: Hoare triple {27570#(<= main_~i~0 31)} assume true; {27570#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:35,718 INFO L273 TraceCheckUtils]: 131: Hoare triple {27570#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27570#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:35,719 INFO L273 TraceCheckUtils]: 132: Hoare triple {27570#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27570#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:35,719 INFO L273 TraceCheckUtils]: 133: Hoare triple {27570#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {27571#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:35,720 INFO L273 TraceCheckUtils]: 134: Hoare triple {27571#(<= main_~i~0 32)} assume true; {27571#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:35,720 INFO L273 TraceCheckUtils]: 135: Hoare triple {27571#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27571#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:35,721 INFO L273 TraceCheckUtils]: 136: Hoare triple {27571#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27571#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:35,722 INFO L273 TraceCheckUtils]: 137: Hoare triple {27571#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {27572#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:35,722 INFO L273 TraceCheckUtils]: 138: Hoare triple {27572#(<= main_~i~0 33)} assume true; {27572#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:35,723 INFO L273 TraceCheckUtils]: 139: Hoare triple {27572#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27572#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:35,723 INFO L273 TraceCheckUtils]: 140: Hoare triple {27572#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27572#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:35,724 INFO L273 TraceCheckUtils]: 141: Hoare triple {27572#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {27573#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:35,724 INFO L273 TraceCheckUtils]: 142: Hoare triple {27573#(<= main_~i~0 34)} assume true; {27573#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:35,725 INFO L273 TraceCheckUtils]: 143: Hoare triple {27573#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27573#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:35,725 INFO L273 TraceCheckUtils]: 144: Hoare triple {27573#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27573#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:35,726 INFO L273 TraceCheckUtils]: 145: Hoare triple {27573#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {27574#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:35,727 INFO L273 TraceCheckUtils]: 146: Hoare triple {27574#(<= main_~i~0 35)} assume true; {27574#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:35,727 INFO L273 TraceCheckUtils]: 147: Hoare triple {27574#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27574#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:35,728 INFO L273 TraceCheckUtils]: 148: Hoare triple {27574#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27574#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:35,728 INFO L273 TraceCheckUtils]: 149: Hoare triple {27574#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {27575#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:35,729 INFO L273 TraceCheckUtils]: 150: Hoare triple {27575#(<= main_~i~0 36)} assume true; {27575#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:35,729 INFO L273 TraceCheckUtils]: 151: Hoare triple {27575#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27575#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:35,730 INFO L273 TraceCheckUtils]: 152: Hoare triple {27575#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27575#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:35,730 INFO L273 TraceCheckUtils]: 153: Hoare triple {27575#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {27576#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:35,731 INFO L273 TraceCheckUtils]: 154: Hoare triple {27576#(<= main_~i~0 37)} assume true; {27576#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:35,732 INFO L273 TraceCheckUtils]: 155: Hoare triple {27576#(<= main_~i~0 37)} assume !(~i~0 < 100000); {27538#false} is VALID [2018-11-18 22:57:35,732 INFO L273 TraceCheckUtils]: 156: Hoare triple {27538#false} havoc ~x~0;~x~0 := 0; {27538#false} is VALID [2018-11-18 22:57:35,732 INFO L273 TraceCheckUtils]: 157: Hoare triple {27538#false} assume true; {27538#false} is VALID [2018-11-18 22:57:35,732 INFO L273 TraceCheckUtils]: 158: Hoare triple {27538#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {27538#false} is VALID [2018-11-18 22:57:35,732 INFO L256 TraceCheckUtils]: 159: Hoare triple {27538#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {27538#false} is VALID [2018-11-18 22:57:35,733 INFO L273 TraceCheckUtils]: 160: Hoare triple {27538#false} ~cond := #in~cond; {27538#false} is VALID [2018-11-18 22:57:35,733 INFO L273 TraceCheckUtils]: 161: Hoare triple {27538#false} assume 0 == ~cond; {27538#false} is VALID [2018-11-18 22:57:35,733 INFO L273 TraceCheckUtils]: 162: Hoare triple {27538#false} assume !false; {27538#false} is VALID [2018-11-18 22:57:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:35,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:35,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-18 22:57:35,772 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-11-18 22:57:35,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:35,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-18 22:57:35,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:35,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-18 22:57:35,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 22:57:35,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 22:57:35,951 INFO L87 Difference]: Start difference. First operand 168 states and 206 transitions. Second operand 41 states. [2018-11-18 22:57:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:37,304 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2018-11-18 22:57:37,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-18 22:57:37,304 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-11-18 22:57:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 22:57:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 227 transitions. [2018-11-18 22:57:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 22:57:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 227 transitions. [2018-11-18 22:57:37,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 227 transitions. [2018-11-18 22:57:37,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:37,514 INFO L225 Difference]: With dead ends: 186 [2018-11-18 22:57:37,515 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 22:57:37,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 22:57:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 22:57:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-18 22:57:37,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:37,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 172 states. [2018-11-18 22:57:37,549 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 172 states. [2018-11-18 22:57:37,549 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 172 states. [2018-11-18 22:57:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:37,553 INFO L93 Difference]: Finished difference Result 174 states and 214 transitions. [2018-11-18 22:57:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 214 transitions. [2018-11-18 22:57:37,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:37,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:37,553 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 174 states. [2018-11-18 22:57:37,553 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 174 states. [2018-11-18 22:57:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:37,555 INFO L93 Difference]: Finished difference Result 174 states and 214 transitions. [2018-11-18 22:57:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 214 transitions. [2018-11-18 22:57:37,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:37,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:37,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:37,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 22:57:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 211 transitions. [2018-11-18 22:57:37,558 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 211 transitions. Word has length 163 [2018-11-18 22:57:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:37,559 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 211 transitions. [2018-11-18 22:57:37,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-18 22:57:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 211 transitions. [2018-11-18 22:57:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-18 22:57:37,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:37,560 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:37,560 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:37,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1509586246, now seen corresponding path program 38 times [2018-11-18 22:57:37,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:37,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:37,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:40,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {28867#true} call ULTIMATE.init(); {28867#true} is VALID [2018-11-18 22:57:40,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {28867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28867#true} is VALID [2018-11-18 22:57:40,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {28867#true} assume true; {28867#true} is VALID [2018-11-18 22:57:40,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28867#true} {28867#true} #57#return; {28867#true} is VALID [2018-11-18 22:57:40,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {28867#true} call #t~ret4 := main(); {28867#true} is VALID [2018-11-18 22:57:40,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {28867#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {28869#(= main_~i~0 0)} is VALID [2018-11-18 22:57:40,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {28869#(= main_~i~0 0)} assume true; {28869#(= main_~i~0 0)} is VALID [2018-11-18 22:57:40,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {28869#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28869#(= main_~i~0 0)} is VALID [2018-11-18 22:57:40,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {28869#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28869#(= main_~i~0 0)} is VALID [2018-11-18 22:57:40,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {28869#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {28870#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {28870#(<= main_~i~0 1)} assume true; {28870#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {28870#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28870#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {28870#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28870#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {28870#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {28871#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {28871#(<= main_~i~0 2)} assume true; {28871#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {28871#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28871#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {28871#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28871#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {28871#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {28872#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,122 INFO L273 TraceCheckUtils]: 18: Hoare triple {28872#(<= main_~i~0 3)} assume true; {28872#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {28872#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28872#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {28872#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28872#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,124 INFO L273 TraceCheckUtils]: 21: Hoare triple {28872#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {28873#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {28873#(<= main_~i~0 4)} assume true; {28873#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,125 INFO L273 TraceCheckUtils]: 23: Hoare triple {28873#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28873#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {28873#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28873#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,126 INFO L273 TraceCheckUtils]: 25: Hoare triple {28873#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {28874#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,127 INFO L273 TraceCheckUtils]: 26: Hoare triple {28874#(<= main_~i~0 5)} assume true; {28874#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,127 INFO L273 TraceCheckUtils]: 27: Hoare triple {28874#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28874#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,128 INFO L273 TraceCheckUtils]: 28: Hoare triple {28874#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28874#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,128 INFO L273 TraceCheckUtils]: 29: Hoare triple {28874#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {28875#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,129 INFO L273 TraceCheckUtils]: 30: Hoare triple {28875#(<= main_~i~0 6)} assume true; {28875#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,129 INFO L273 TraceCheckUtils]: 31: Hoare triple {28875#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28875#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,130 INFO L273 TraceCheckUtils]: 32: Hoare triple {28875#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28875#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,131 INFO L273 TraceCheckUtils]: 33: Hoare triple {28875#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {28876#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,131 INFO L273 TraceCheckUtils]: 34: Hoare triple {28876#(<= main_~i~0 7)} assume true; {28876#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,132 INFO L273 TraceCheckUtils]: 35: Hoare triple {28876#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28876#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,132 INFO L273 TraceCheckUtils]: 36: Hoare triple {28876#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28876#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,133 INFO L273 TraceCheckUtils]: 37: Hoare triple {28876#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {28877#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {28877#(<= main_~i~0 8)} assume true; {28877#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,134 INFO L273 TraceCheckUtils]: 39: Hoare triple {28877#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28877#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {28877#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28877#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,135 INFO L273 TraceCheckUtils]: 41: Hoare triple {28877#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {28878#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,136 INFO L273 TraceCheckUtils]: 42: Hoare triple {28878#(<= main_~i~0 9)} assume true; {28878#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,136 INFO L273 TraceCheckUtils]: 43: Hoare triple {28878#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28878#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,137 INFO L273 TraceCheckUtils]: 44: Hoare triple {28878#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28878#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,137 INFO L273 TraceCheckUtils]: 45: Hoare triple {28878#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {28879#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,138 INFO L273 TraceCheckUtils]: 46: Hoare triple {28879#(<= main_~i~0 10)} assume true; {28879#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,138 INFO L273 TraceCheckUtils]: 47: Hoare triple {28879#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28879#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,139 INFO L273 TraceCheckUtils]: 48: Hoare triple {28879#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28879#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,139 INFO L273 TraceCheckUtils]: 49: Hoare triple {28879#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {28880#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,140 INFO L273 TraceCheckUtils]: 50: Hoare triple {28880#(<= main_~i~0 11)} assume true; {28880#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,140 INFO L273 TraceCheckUtils]: 51: Hoare triple {28880#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28880#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,141 INFO L273 TraceCheckUtils]: 52: Hoare triple {28880#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28880#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,142 INFO L273 TraceCheckUtils]: 53: Hoare triple {28880#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {28881#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,142 INFO L273 TraceCheckUtils]: 54: Hoare triple {28881#(<= main_~i~0 12)} assume true; {28881#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,143 INFO L273 TraceCheckUtils]: 55: Hoare triple {28881#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28881#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,143 INFO L273 TraceCheckUtils]: 56: Hoare triple {28881#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28881#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,144 INFO L273 TraceCheckUtils]: 57: Hoare triple {28881#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {28882#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,144 INFO L273 TraceCheckUtils]: 58: Hoare triple {28882#(<= main_~i~0 13)} assume true; {28882#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,145 INFO L273 TraceCheckUtils]: 59: Hoare triple {28882#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28882#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,145 INFO L273 TraceCheckUtils]: 60: Hoare triple {28882#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28882#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,146 INFO L273 TraceCheckUtils]: 61: Hoare triple {28882#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {28883#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,147 INFO L273 TraceCheckUtils]: 62: Hoare triple {28883#(<= main_~i~0 14)} assume true; {28883#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,147 INFO L273 TraceCheckUtils]: 63: Hoare triple {28883#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28883#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,148 INFO L273 TraceCheckUtils]: 64: Hoare triple {28883#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28883#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,148 INFO L273 TraceCheckUtils]: 65: Hoare triple {28883#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {28884#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,149 INFO L273 TraceCheckUtils]: 66: Hoare triple {28884#(<= main_~i~0 15)} assume true; {28884#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,149 INFO L273 TraceCheckUtils]: 67: Hoare triple {28884#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28884#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,150 INFO L273 TraceCheckUtils]: 68: Hoare triple {28884#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28884#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,151 INFO L273 TraceCheckUtils]: 69: Hoare triple {28884#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {28885#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,151 INFO L273 TraceCheckUtils]: 70: Hoare triple {28885#(<= main_~i~0 16)} assume true; {28885#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,151 INFO L273 TraceCheckUtils]: 71: Hoare triple {28885#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28885#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,152 INFO L273 TraceCheckUtils]: 72: Hoare triple {28885#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28885#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,153 INFO L273 TraceCheckUtils]: 73: Hoare triple {28885#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {28886#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,153 INFO L273 TraceCheckUtils]: 74: Hoare triple {28886#(<= main_~i~0 17)} assume true; {28886#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,154 INFO L273 TraceCheckUtils]: 75: Hoare triple {28886#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28886#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,154 INFO L273 TraceCheckUtils]: 76: Hoare triple {28886#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28886#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,155 INFO L273 TraceCheckUtils]: 77: Hoare triple {28886#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {28887#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,155 INFO L273 TraceCheckUtils]: 78: Hoare triple {28887#(<= main_~i~0 18)} assume true; {28887#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,156 INFO L273 TraceCheckUtils]: 79: Hoare triple {28887#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28887#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,156 INFO L273 TraceCheckUtils]: 80: Hoare triple {28887#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28887#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,157 INFO L273 TraceCheckUtils]: 81: Hoare triple {28887#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {28888#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,158 INFO L273 TraceCheckUtils]: 82: Hoare triple {28888#(<= main_~i~0 19)} assume true; {28888#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,158 INFO L273 TraceCheckUtils]: 83: Hoare triple {28888#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28888#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,159 INFO L273 TraceCheckUtils]: 84: Hoare triple {28888#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28888#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,159 INFO L273 TraceCheckUtils]: 85: Hoare triple {28888#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {28889#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,160 INFO L273 TraceCheckUtils]: 86: Hoare triple {28889#(<= main_~i~0 20)} assume true; {28889#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,160 INFO L273 TraceCheckUtils]: 87: Hoare triple {28889#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28889#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,161 INFO L273 TraceCheckUtils]: 88: Hoare triple {28889#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28889#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,162 INFO L273 TraceCheckUtils]: 89: Hoare triple {28889#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {28890#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,162 INFO L273 TraceCheckUtils]: 90: Hoare triple {28890#(<= main_~i~0 21)} assume true; {28890#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,163 INFO L273 TraceCheckUtils]: 91: Hoare triple {28890#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28890#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,163 INFO L273 TraceCheckUtils]: 92: Hoare triple {28890#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28890#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,164 INFO L273 TraceCheckUtils]: 93: Hoare triple {28890#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {28891#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,164 INFO L273 TraceCheckUtils]: 94: Hoare triple {28891#(<= main_~i~0 22)} assume true; {28891#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,165 INFO L273 TraceCheckUtils]: 95: Hoare triple {28891#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28891#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,165 INFO L273 TraceCheckUtils]: 96: Hoare triple {28891#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28891#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,166 INFO L273 TraceCheckUtils]: 97: Hoare triple {28891#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {28892#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,166 INFO L273 TraceCheckUtils]: 98: Hoare triple {28892#(<= main_~i~0 23)} assume true; {28892#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,167 INFO L273 TraceCheckUtils]: 99: Hoare triple {28892#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28892#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,167 INFO L273 TraceCheckUtils]: 100: Hoare triple {28892#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28892#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,168 INFO L273 TraceCheckUtils]: 101: Hoare triple {28892#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {28893#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,169 INFO L273 TraceCheckUtils]: 102: Hoare triple {28893#(<= main_~i~0 24)} assume true; {28893#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,169 INFO L273 TraceCheckUtils]: 103: Hoare triple {28893#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28893#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,170 INFO L273 TraceCheckUtils]: 104: Hoare triple {28893#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28893#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,170 INFO L273 TraceCheckUtils]: 105: Hoare triple {28893#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {28894#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,171 INFO L273 TraceCheckUtils]: 106: Hoare triple {28894#(<= main_~i~0 25)} assume true; {28894#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,171 INFO L273 TraceCheckUtils]: 107: Hoare triple {28894#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28894#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,172 INFO L273 TraceCheckUtils]: 108: Hoare triple {28894#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28894#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,173 INFO L273 TraceCheckUtils]: 109: Hoare triple {28894#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {28895#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,173 INFO L273 TraceCheckUtils]: 110: Hoare triple {28895#(<= main_~i~0 26)} assume true; {28895#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,174 INFO L273 TraceCheckUtils]: 111: Hoare triple {28895#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28895#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,174 INFO L273 TraceCheckUtils]: 112: Hoare triple {28895#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28895#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,175 INFO L273 TraceCheckUtils]: 113: Hoare triple {28895#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {28896#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,175 INFO L273 TraceCheckUtils]: 114: Hoare triple {28896#(<= main_~i~0 27)} assume true; {28896#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,176 INFO L273 TraceCheckUtils]: 115: Hoare triple {28896#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28896#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,176 INFO L273 TraceCheckUtils]: 116: Hoare triple {28896#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28896#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,177 INFO L273 TraceCheckUtils]: 117: Hoare triple {28896#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {28897#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:40,177 INFO L273 TraceCheckUtils]: 118: Hoare triple {28897#(<= main_~i~0 28)} assume true; {28897#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:40,178 INFO L273 TraceCheckUtils]: 119: Hoare triple {28897#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28897#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:40,178 INFO L273 TraceCheckUtils]: 120: Hoare triple {28897#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28897#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:40,179 INFO L273 TraceCheckUtils]: 121: Hoare triple {28897#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {28898#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:40,180 INFO L273 TraceCheckUtils]: 122: Hoare triple {28898#(<= main_~i~0 29)} assume true; {28898#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:40,180 INFO L273 TraceCheckUtils]: 123: Hoare triple {28898#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28898#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:40,180 INFO L273 TraceCheckUtils]: 124: Hoare triple {28898#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28898#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:40,181 INFO L273 TraceCheckUtils]: 125: Hoare triple {28898#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {28899#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:40,182 INFO L273 TraceCheckUtils]: 126: Hoare triple {28899#(<= main_~i~0 30)} assume true; {28899#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:40,182 INFO L273 TraceCheckUtils]: 127: Hoare triple {28899#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28899#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:40,183 INFO L273 TraceCheckUtils]: 128: Hoare triple {28899#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28899#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:40,183 INFO L273 TraceCheckUtils]: 129: Hoare triple {28899#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {28900#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:40,184 INFO L273 TraceCheckUtils]: 130: Hoare triple {28900#(<= main_~i~0 31)} assume true; {28900#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:40,184 INFO L273 TraceCheckUtils]: 131: Hoare triple {28900#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28900#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:40,185 INFO L273 TraceCheckUtils]: 132: Hoare triple {28900#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28900#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:40,185 INFO L273 TraceCheckUtils]: 133: Hoare triple {28900#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {28901#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:40,186 INFO L273 TraceCheckUtils]: 134: Hoare triple {28901#(<= main_~i~0 32)} assume true; {28901#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:40,186 INFO L273 TraceCheckUtils]: 135: Hoare triple {28901#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28901#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:40,187 INFO L273 TraceCheckUtils]: 136: Hoare triple {28901#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28901#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:40,187 INFO L273 TraceCheckUtils]: 137: Hoare triple {28901#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {28902#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:40,188 INFO L273 TraceCheckUtils]: 138: Hoare triple {28902#(<= main_~i~0 33)} assume true; {28902#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:40,188 INFO L273 TraceCheckUtils]: 139: Hoare triple {28902#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28902#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:40,189 INFO L273 TraceCheckUtils]: 140: Hoare triple {28902#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28902#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:40,190 INFO L273 TraceCheckUtils]: 141: Hoare triple {28902#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {28903#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:40,190 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#(<= main_~i~0 34)} assume true; {28903#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:40,190 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28903#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:40,191 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28903#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:40,192 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {28904#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:40,192 INFO L273 TraceCheckUtils]: 146: Hoare triple {28904#(<= main_~i~0 35)} assume true; {28904#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:40,193 INFO L273 TraceCheckUtils]: 147: Hoare triple {28904#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28904#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:40,193 INFO L273 TraceCheckUtils]: 148: Hoare triple {28904#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28904#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:40,194 INFO L273 TraceCheckUtils]: 149: Hoare triple {28904#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {28905#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:40,194 INFO L273 TraceCheckUtils]: 150: Hoare triple {28905#(<= main_~i~0 36)} assume true; {28905#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:40,195 INFO L273 TraceCheckUtils]: 151: Hoare triple {28905#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28905#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:40,195 INFO L273 TraceCheckUtils]: 152: Hoare triple {28905#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28905#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:40,196 INFO L273 TraceCheckUtils]: 153: Hoare triple {28905#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {28906#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:40,196 INFO L273 TraceCheckUtils]: 154: Hoare triple {28906#(<= main_~i~0 37)} assume true; {28906#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:40,197 INFO L273 TraceCheckUtils]: 155: Hoare triple {28906#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28906#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:40,197 INFO L273 TraceCheckUtils]: 156: Hoare triple {28906#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28906#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:40,198 INFO L273 TraceCheckUtils]: 157: Hoare triple {28906#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {28907#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:40,198 INFO L273 TraceCheckUtils]: 158: Hoare triple {28907#(<= main_~i~0 38)} assume true; {28907#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:40,199 INFO L273 TraceCheckUtils]: 159: Hoare triple {28907#(<= main_~i~0 38)} assume !(~i~0 < 100000); {28868#false} is VALID [2018-11-18 22:57:40,199 INFO L273 TraceCheckUtils]: 160: Hoare triple {28868#false} havoc ~x~0;~x~0 := 0; {28868#false} is VALID [2018-11-18 22:57:40,199 INFO L273 TraceCheckUtils]: 161: Hoare triple {28868#false} assume true; {28868#false} is VALID [2018-11-18 22:57:40,200 INFO L273 TraceCheckUtils]: 162: Hoare triple {28868#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {28868#false} is VALID [2018-11-18 22:57:40,200 INFO L256 TraceCheckUtils]: 163: Hoare triple {28868#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {28868#false} is VALID [2018-11-18 22:57:40,200 INFO L273 TraceCheckUtils]: 164: Hoare triple {28868#false} ~cond := #in~cond; {28868#false} is VALID [2018-11-18 22:57:40,200 INFO L273 TraceCheckUtils]: 165: Hoare triple {28868#false} assume 0 == ~cond; {28868#false} is VALID [2018-11-18 22:57:40,200 INFO L273 TraceCheckUtils]: 166: Hoare triple {28868#false} assume !false; {28868#false} is VALID [2018-11-18 22:57:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:40,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:40,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:40,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:57:40,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:57:40,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:40,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:40,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {28867#true} call ULTIMATE.init(); {28867#true} is VALID [2018-11-18 22:57:40,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {28867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28867#true} is VALID [2018-11-18 22:57:40,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {28867#true} assume true; {28867#true} is VALID [2018-11-18 22:57:40,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28867#true} {28867#true} #57#return; {28867#true} is VALID [2018-11-18 22:57:40,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {28867#true} call #t~ret4 := main(); {28867#true} is VALID [2018-11-18 22:57:40,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {28867#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {28926#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:40,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {28926#(<= main_~i~0 0)} assume true; {28926#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:40,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {28926#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28926#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:40,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {28926#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28926#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:40,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {28926#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {28870#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {28870#(<= main_~i~0 1)} assume true; {28870#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {28870#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28870#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {28870#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28870#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {28870#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {28871#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,721 INFO L273 TraceCheckUtils]: 14: Hoare triple {28871#(<= main_~i~0 2)} assume true; {28871#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {28871#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28871#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {28871#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28871#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {28871#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {28872#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {28872#(<= main_~i~0 3)} assume true; {28872#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {28872#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28872#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {28872#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28872#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {28872#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {28873#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,726 INFO L273 TraceCheckUtils]: 22: Hoare triple {28873#(<= main_~i~0 4)} assume true; {28873#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {28873#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28873#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {28873#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28873#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {28873#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {28874#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {28874#(<= main_~i~0 5)} assume true; {28874#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,728 INFO L273 TraceCheckUtils]: 27: Hoare triple {28874#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28874#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {28874#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28874#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {28874#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {28875#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {28875#(<= main_~i~0 6)} assume true; {28875#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,731 INFO L273 TraceCheckUtils]: 31: Hoare triple {28875#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28875#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,731 INFO L273 TraceCheckUtils]: 32: Hoare triple {28875#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28875#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {28875#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {28876#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,732 INFO L273 TraceCheckUtils]: 34: Hoare triple {28876#(<= main_~i~0 7)} assume true; {28876#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {28876#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28876#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {28876#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28876#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {28876#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {28877#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,735 INFO L273 TraceCheckUtils]: 38: Hoare triple {28877#(<= main_~i~0 8)} assume true; {28877#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {28877#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28877#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {28877#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28877#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {28877#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {28878#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {28878#(<= main_~i~0 9)} assume true; {28878#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {28878#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28878#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {28878#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28878#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,738 INFO L273 TraceCheckUtils]: 45: Hoare triple {28878#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {28879#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,739 INFO L273 TraceCheckUtils]: 46: Hoare triple {28879#(<= main_~i~0 10)} assume true; {28879#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {28879#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28879#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {28879#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28879#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {28879#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {28880#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,741 INFO L273 TraceCheckUtils]: 50: Hoare triple {28880#(<= main_~i~0 11)} assume true; {28880#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,742 INFO L273 TraceCheckUtils]: 51: Hoare triple {28880#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28880#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,742 INFO L273 TraceCheckUtils]: 52: Hoare triple {28880#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28880#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,743 INFO L273 TraceCheckUtils]: 53: Hoare triple {28880#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {28881#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,743 INFO L273 TraceCheckUtils]: 54: Hoare triple {28881#(<= main_~i~0 12)} assume true; {28881#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,744 INFO L273 TraceCheckUtils]: 55: Hoare triple {28881#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28881#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,744 INFO L273 TraceCheckUtils]: 56: Hoare triple {28881#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28881#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,745 INFO L273 TraceCheckUtils]: 57: Hoare triple {28881#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {28882#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,746 INFO L273 TraceCheckUtils]: 58: Hoare triple {28882#(<= main_~i~0 13)} assume true; {28882#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,746 INFO L273 TraceCheckUtils]: 59: Hoare triple {28882#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28882#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {28882#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28882#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,747 INFO L273 TraceCheckUtils]: 61: Hoare triple {28882#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {28883#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,748 INFO L273 TraceCheckUtils]: 62: Hoare triple {28883#(<= main_~i~0 14)} assume true; {28883#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,748 INFO L273 TraceCheckUtils]: 63: Hoare triple {28883#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28883#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,749 INFO L273 TraceCheckUtils]: 64: Hoare triple {28883#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28883#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {28883#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {28884#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {28884#(<= main_~i~0 15)} assume true; {28884#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,751 INFO L273 TraceCheckUtils]: 67: Hoare triple {28884#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28884#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,751 INFO L273 TraceCheckUtils]: 68: Hoare triple {28884#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28884#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,752 INFO L273 TraceCheckUtils]: 69: Hoare triple {28884#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {28885#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,752 INFO L273 TraceCheckUtils]: 70: Hoare triple {28885#(<= main_~i~0 16)} assume true; {28885#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,753 INFO L273 TraceCheckUtils]: 71: Hoare triple {28885#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28885#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,753 INFO L273 TraceCheckUtils]: 72: Hoare triple {28885#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28885#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,754 INFO L273 TraceCheckUtils]: 73: Hoare triple {28885#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {28886#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,754 INFO L273 TraceCheckUtils]: 74: Hoare triple {28886#(<= main_~i~0 17)} assume true; {28886#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,755 INFO L273 TraceCheckUtils]: 75: Hoare triple {28886#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28886#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,755 INFO L273 TraceCheckUtils]: 76: Hoare triple {28886#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28886#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,756 INFO L273 TraceCheckUtils]: 77: Hoare triple {28886#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {28887#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,757 INFO L273 TraceCheckUtils]: 78: Hoare triple {28887#(<= main_~i~0 18)} assume true; {28887#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,757 INFO L273 TraceCheckUtils]: 79: Hoare triple {28887#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28887#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,758 INFO L273 TraceCheckUtils]: 80: Hoare triple {28887#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28887#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,758 INFO L273 TraceCheckUtils]: 81: Hoare triple {28887#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {28888#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,759 INFO L273 TraceCheckUtils]: 82: Hoare triple {28888#(<= main_~i~0 19)} assume true; {28888#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,759 INFO L273 TraceCheckUtils]: 83: Hoare triple {28888#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28888#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,760 INFO L273 TraceCheckUtils]: 84: Hoare triple {28888#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28888#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,761 INFO L273 TraceCheckUtils]: 85: Hoare triple {28888#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {28889#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,761 INFO L273 TraceCheckUtils]: 86: Hoare triple {28889#(<= main_~i~0 20)} assume true; {28889#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,762 INFO L273 TraceCheckUtils]: 87: Hoare triple {28889#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28889#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,762 INFO L273 TraceCheckUtils]: 88: Hoare triple {28889#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28889#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,763 INFO L273 TraceCheckUtils]: 89: Hoare triple {28889#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {28890#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,763 INFO L273 TraceCheckUtils]: 90: Hoare triple {28890#(<= main_~i~0 21)} assume true; {28890#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,764 INFO L273 TraceCheckUtils]: 91: Hoare triple {28890#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28890#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,764 INFO L273 TraceCheckUtils]: 92: Hoare triple {28890#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28890#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,765 INFO L273 TraceCheckUtils]: 93: Hoare triple {28890#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {28891#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {28891#(<= main_~i~0 22)} assume true; {28891#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,766 INFO L273 TraceCheckUtils]: 95: Hoare triple {28891#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28891#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,767 INFO L273 TraceCheckUtils]: 96: Hoare triple {28891#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28891#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,767 INFO L273 TraceCheckUtils]: 97: Hoare triple {28891#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {28892#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,768 INFO L273 TraceCheckUtils]: 98: Hoare triple {28892#(<= main_~i~0 23)} assume true; {28892#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,768 INFO L273 TraceCheckUtils]: 99: Hoare triple {28892#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28892#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,769 INFO L273 TraceCheckUtils]: 100: Hoare triple {28892#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28892#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,769 INFO L273 TraceCheckUtils]: 101: Hoare triple {28892#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {28893#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,770 INFO L273 TraceCheckUtils]: 102: Hoare triple {28893#(<= main_~i~0 24)} assume true; {28893#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,770 INFO L273 TraceCheckUtils]: 103: Hoare triple {28893#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28893#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,771 INFO L273 TraceCheckUtils]: 104: Hoare triple {28893#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28893#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,772 INFO L273 TraceCheckUtils]: 105: Hoare triple {28893#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {28894#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,772 INFO L273 TraceCheckUtils]: 106: Hoare triple {28894#(<= main_~i~0 25)} assume true; {28894#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,773 INFO L273 TraceCheckUtils]: 107: Hoare triple {28894#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28894#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,773 INFO L273 TraceCheckUtils]: 108: Hoare triple {28894#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28894#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,774 INFO L273 TraceCheckUtils]: 109: Hoare triple {28894#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {28895#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,774 INFO L273 TraceCheckUtils]: 110: Hoare triple {28895#(<= main_~i~0 26)} assume true; {28895#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,775 INFO L273 TraceCheckUtils]: 111: Hoare triple {28895#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28895#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,775 INFO L273 TraceCheckUtils]: 112: Hoare triple {28895#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28895#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,776 INFO L273 TraceCheckUtils]: 113: Hoare triple {28895#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {28896#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,777 INFO L273 TraceCheckUtils]: 114: Hoare triple {28896#(<= main_~i~0 27)} assume true; {28896#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,777 INFO L273 TraceCheckUtils]: 115: Hoare triple {28896#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28896#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,778 INFO L273 TraceCheckUtils]: 116: Hoare triple {28896#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28896#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,778 INFO L273 TraceCheckUtils]: 117: Hoare triple {28896#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {28897#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:40,779 INFO L273 TraceCheckUtils]: 118: Hoare triple {28897#(<= main_~i~0 28)} assume true; {28897#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:40,779 INFO L273 TraceCheckUtils]: 119: Hoare triple {28897#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28897#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:40,780 INFO L273 TraceCheckUtils]: 120: Hoare triple {28897#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28897#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:40,781 INFO L273 TraceCheckUtils]: 121: Hoare triple {28897#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {28898#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:40,781 INFO L273 TraceCheckUtils]: 122: Hoare triple {28898#(<= main_~i~0 29)} assume true; {28898#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:40,782 INFO L273 TraceCheckUtils]: 123: Hoare triple {28898#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28898#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:40,782 INFO L273 TraceCheckUtils]: 124: Hoare triple {28898#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28898#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:40,783 INFO L273 TraceCheckUtils]: 125: Hoare triple {28898#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {28899#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:40,783 INFO L273 TraceCheckUtils]: 126: Hoare triple {28899#(<= main_~i~0 30)} assume true; {28899#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:40,784 INFO L273 TraceCheckUtils]: 127: Hoare triple {28899#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28899#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:40,784 INFO L273 TraceCheckUtils]: 128: Hoare triple {28899#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28899#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:40,785 INFO L273 TraceCheckUtils]: 129: Hoare triple {28899#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {28900#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:40,786 INFO L273 TraceCheckUtils]: 130: Hoare triple {28900#(<= main_~i~0 31)} assume true; {28900#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:40,786 INFO L273 TraceCheckUtils]: 131: Hoare triple {28900#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28900#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:40,786 INFO L273 TraceCheckUtils]: 132: Hoare triple {28900#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28900#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:40,787 INFO L273 TraceCheckUtils]: 133: Hoare triple {28900#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {28901#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:40,788 INFO L273 TraceCheckUtils]: 134: Hoare triple {28901#(<= main_~i~0 32)} assume true; {28901#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:40,788 INFO L273 TraceCheckUtils]: 135: Hoare triple {28901#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28901#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:40,789 INFO L273 TraceCheckUtils]: 136: Hoare triple {28901#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28901#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:40,789 INFO L273 TraceCheckUtils]: 137: Hoare triple {28901#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {28902#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:40,790 INFO L273 TraceCheckUtils]: 138: Hoare triple {28902#(<= main_~i~0 33)} assume true; {28902#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:40,790 INFO L273 TraceCheckUtils]: 139: Hoare triple {28902#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28902#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:40,791 INFO L273 TraceCheckUtils]: 140: Hoare triple {28902#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28902#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:40,792 INFO L273 TraceCheckUtils]: 141: Hoare triple {28902#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {28903#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:40,792 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#(<= main_~i~0 34)} assume true; {28903#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:40,793 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28903#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:40,793 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28903#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:40,794 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {28904#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:40,794 INFO L273 TraceCheckUtils]: 146: Hoare triple {28904#(<= main_~i~0 35)} assume true; {28904#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:40,795 INFO L273 TraceCheckUtils]: 147: Hoare triple {28904#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28904#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:40,795 INFO L273 TraceCheckUtils]: 148: Hoare triple {28904#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28904#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:40,796 INFO L273 TraceCheckUtils]: 149: Hoare triple {28904#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {28905#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:40,797 INFO L273 TraceCheckUtils]: 150: Hoare triple {28905#(<= main_~i~0 36)} assume true; {28905#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:40,797 INFO L273 TraceCheckUtils]: 151: Hoare triple {28905#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28905#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:40,798 INFO L273 TraceCheckUtils]: 152: Hoare triple {28905#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28905#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:40,798 INFO L273 TraceCheckUtils]: 153: Hoare triple {28905#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {28906#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:40,799 INFO L273 TraceCheckUtils]: 154: Hoare triple {28906#(<= main_~i~0 37)} assume true; {28906#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:40,799 INFO L273 TraceCheckUtils]: 155: Hoare triple {28906#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28906#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:40,800 INFO L273 TraceCheckUtils]: 156: Hoare triple {28906#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28906#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:40,800 INFO L273 TraceCheckUtils]: 157: Hoare triple {28906#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {28907#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:40,801 INFO L273 TraceCheckUtils]: 158: Hoare triple {28907#(<= main_~i~0 38)} assume true; {28907#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:40,802 INFO L273 TraceCheckUtils]: 159: Hoare triple {28907#(<= main_~i~0 38)} assume !(~i~0 < 100000); {28868#false} is VALID [2018-11-18 22:57:40,802 INFO L273 TraceCheckUtils]: 160: Hoare triple {28868#false} havoc ~x~0;~x~0 := 0; {28868#false} is VALID [2018-11-18 22:57:40,802 INFO L273 TraceCheckUtils]: 161: Hoare triple {28868#false} assume true; {28868#false} is VALID [2018-11-18 22:57:40,802 INFO L273 TraceCheckUtils]: 162: Hoare triple {28868#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {28868#false} is VALID [2018-11-18 22:57:40,802 INFO L256 TraceCheckUtils]: 163: Hoare triple {28868#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {28868#false} is VALID [2018-11-18 22:57:40,803 INFO L273 TraceCheckUtils]: 164: Hoare triple {28868#false} ~cond := #in~cond; {28868#false} is VALID [2018-11-18 22:57:40,803 INFO L273 TraceCheckUtils]: 165: Hoare triple {28868#false} assume 0 == ~cond; {28868#false} is VALID [2018-11-18 22:57:40,803 INFO L273 TraceCheckUtils]: 166: Hoare triple {28868#false} assume !false; {28868#false} is VALID [2018-11-18 22:57:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:40,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:40,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-18 22:57:40,845 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 167 [2018-11-18 22:57:40,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:40,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-18 22:57:41,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:41,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-18 22:57:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-18 22:57:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 22:57:41,005 INFO L87 Difference]: Start difference. First operand 172 states and 211 transitions. Second operand 42 states. [2018-11-18 22:57:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:42,142 INFO L93 Difference]: Finished difference Result 190 states and 232 transitions. [2018-11-18 22:57:42,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-18 22:57:42,143 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 167 [2018-11-18 22:57:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:57:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 232 transitions. [2018-11-18 22:57:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:57:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 232 transitions. [2018-11-18 22:57:42,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 232 transitions. [2018-11-18 22:57:42,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:42,363 INFO L225 Difference]: With dead ends: 190 [2018-11-18 22:57:42,363 INFO L226 Difference]: Without dead ends: 178 [2018-11-18 22:57:42,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 22:57:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-18 22:57:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-11-18 22:57:42,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:42,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 176 states. [2018-11-18 22:57:42,425 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 176 states. [2018-11-18 22:57:42,425 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 176 states. [2018-11-18 22:57:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:42,427 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2018-11-18 22:57:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 219 transitions. [2018-11-18 22:57:42,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:42,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:42,428 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 178 states. [2018-11-18 22:57:42,428 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 178 states. [2018-11-18 22:57:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:42,431 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2018-11-18 22:57:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 219 transitions. [2018-11-18 22:57:42,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:42,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:42,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:42,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 22:57:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 216 transitions. [2018-11-18 22:57:42,435 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 216 transitions. Word has length 167 [2018-11-18 22:57:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:42,435 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 216 transitions. [2018-11-18 22:57:42,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-18 22:57:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 216 transitions. [2018-11-18 22:57:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 22:57:42,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:42,436 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:42,437 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:42,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:42,437 INFO L82 PathProgramCache]: Analyzing trace with hash -642449764, now seen corresponding path program 39 times [2018-11-18 22:57:42,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:42,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:42,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:44,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {30228#true} call ULTIMATE.init(); {30228#true} is VALID [2018-11-18 22:57:44,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {30228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30228#true} is VALID [2018-11-18 22:57:44,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {30228#true} assume true; {30228#true} is VALID [2018-11-18 22:57:44,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30228#true} {30228#true} #57#return; {30228#true} is VALID [2018-11-18 22:57:44,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {30228#true} call #t~ret4 := main(); {30228#true} is VALID [2018-11-18 22:57:44,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {30228#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {30230#(= main_~i~0 0)} is VALID [2018-11-18 22:57:44,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {30230#(= main_~i~0 0)} assume true; {30230#(= main_~i~0 0)} is VALID [2018-11-18 22:57:44,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {30230#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30230#(= main_~i~0 0)} is VALID [2018-11-18 22:57:44,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {30230#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30230#(= main_~i~0 0)} is VALID [2018-11-18 22:57:44,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {30230#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {30231#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:44,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {30231#(<= main_~i~0 1)} assume true; {30231#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:44,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {30231#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30231#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:44,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {30231#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30231#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:44,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {30231#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {30232#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:44,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {30232#(<= main_~i~0 2)} assume true; {30232#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:44,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {30232#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30232#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:44,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {30232#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30232#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:44,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {30232#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {30233#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:44,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {30233#(<= main_~i~0 3)} assume true; {30233#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:44,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {30233#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30233#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:44,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {30233#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30233#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:44,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {30233#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {30234#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:44,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {30234#(<= main_~i~0 4)} assume true; {30234#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:44,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {30234#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30234#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:44,478 INFO L273 TraceCheckUtils]: 24: Hoare triple {30234#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30234#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:44,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {30234#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {30235#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:44,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {30235#(<= main_~i~0 5)} assume true; {30235#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:44,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {30235#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30235#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:44,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {30235#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30235#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:44,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {30235#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {30236#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:44,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {30236#(<= main_~i~0 6)} assume true; {30236#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:44,482 INFO L273 TraceCheckUtils]: 31: Hoare triple {30236#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30236#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:44,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {30236#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30236#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:44,483 INFO L273 TraceCheckUtils]: 33: Hoare triple {30236#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {30237#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:44,483 INFO L273 TraceCheckUtils]: 34: Hoare triple {30237#(<= main_~i~0 7)} assume true; {30237#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:44,484 INFO L273 TraceCheckUtils]: 35: Hoare triple {30237#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30237#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:44,484 INFO L273 TraceCheckUtils]: 36: Hoare triple {30237#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30237#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:44,485 INFO L273 TraceCheckUtils]: 37: Hoare triple {30237#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {30238#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:44,485 INFO L273 TraceCheckUtils]: 38: Hoare triple {30238#(<= main_~i~0 8)} assume true; {30238#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:44,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {30238#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30238#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:44,486 INFO L273 TraceCheckUtils]: 40: Hoare triple {30238#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30238#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:44,487 INFO L273 TraceCheckUtils]: 41: Hoare triple {30238#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {30239#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:44,488 INFO L273 TraceCheckUtils]: 42: Hoare triple {30239#(<= main_~i~0 9)} assume true; {30239#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:44,488 INFO L273 TraceCheckUtils]: 43: Hoare triple {30239#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30239#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:44,488 INFO L273 TraceCheckUtils]: 44: Hoare triple {30239#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30239#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:44,489 INFO L273 TraceCheckUtils]: 45: Hoare triple {30239#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {30240#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:44,490 INFO L273 TraceCheckUtils]: 46: Hoare triple {30240#(<= main_~i~0 10)} assume true; {30240#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:44,490 INFO L273 TraceCheckUtils]: 47: Hoare triple {30240#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30240#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:44,491 INFO L273 TraceCheckUtils]: 48: Hoare triple {30240#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30240#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:44,491 INFO L273 TraceCheckUtils]: 49: Hoare triple {30240#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {30241#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:44,492 INFO L273 TraceCheckUtils]: 50: Hoare triple {30241#(<= main_~i~0 11)} assume true; {30241#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:44,492 INFO L273 TraceCheckUtils]: 51: Hoare triple {30241#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30241#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:44,493 INFO L273 TraceCheckUtils]: 52: Hoare triple {30241#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30241#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:44,494 INFO L273 TraceCheckUtils]: 53: Hoare triple {30241#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {30242#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:44,494 INFO L273 TraceCheckUtils]: 54: Hoare triple {30242#(<= main_~i~0 12)} assume true; {30242#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:44,494 INFO L273 TraceCheckUtils]: 55: Hoare triple {30242#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30242#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:44,495 INFO L273 TraceCheckUtils]: 56: Hoare triple {30242#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30242#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:44,496 INFO L273 TraceCheckUtils]: 57: Hoare triple {30242#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {30243#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:44,496 INFO L273 TraceCheckUtils]: 58: Hoare triple {30243#(<= main_~i~0 13)} assume true; {30243#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:44,497 INFO L273 TraceCheckUtils]: 59: Hoare triple {30243#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30243#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:44,497 INFO L273 TraceCheckUtils]: 60: Hoare triple {30243#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30243#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:44,498 INFO L273 TraceCheckUtils]: 61: Hoare triple {30243#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {30244#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:44,498 INFO L273 TraceCheckUtils]: 62: Hoare triple {30244#(<= main_~i~0 14)} assume true; {30244#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:44,499 INFO L273 TraceCheckUtils]: 63: Hoare triple {30244#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30244#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:44,499 INFO L273 TraceCheckUtils]: 64: Hoare triple {30244#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30244#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:44,500 INFO L273 TraceCheckUtils]: 65: Hoare triple {30244#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {30245#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:44,500 INFO L273 TraceCheckUtils]: 66: Hoare triple {30245#(<= main_~i~0 15)} assume true; {30245#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:44,501 INFO L273 TraceCheckUtils]: 67: Hoare triple {30245#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30245#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:44,501 INFO L273 TraceCheckUtils]: 68: Hoare triple {30245#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30245#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:44,502 INFO L273 TraceCheckUtils]: 69: Hoare triple {30245#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {30246#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:44,503 INFO L273 TraceCheckUtils]: 70: Hoare triple {30246#(<= main_~i~0 16)} assume true; {30246#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:44,503 INFO L273 TraceCheckUtils]: 71: Hoare triple {30246#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30246#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:44,504 INFO L273 TraceCheckUtils]: 72: Hoare triple {30246#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30246#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:44,504 INFO L273 TraceCheckUtils]: 73: Hoare triple {30246#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {30247#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:44,505 INFO L273 TraceCheckUtils]: 74: Hoare triple {30247#(<= main_~i~0 17)} assume true; {30247#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:44,505 INFO L273 TraceCheckUtils]: 75: Hoare triple {30247#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30247#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:44,506 INFO L273 TraceCheckUtils]: 76: Hoare triple {30247#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30247#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:44,507 INFO L273 TraceCheckUtils]: 77: Hoare triple {30247#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {30248#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:44,507 INFO L273 TraceCheckUtils]: 78: Hoare triple {30248#(<= main_~i~0 18)} assume true; {30248#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:44,507 INFO L273 TraceCheckUtils]: 79: Hoare triple {30248#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30248#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:44,508 INFO L273 TraceCheckUtils]: 80: Hoare triple {30248#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30248#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:44,509 INFO L273 TraceCheckUtils]: 81: Hoare triple {30248#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {30249#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:44,509 INFO L273 TraceCheckUtils]: 82: Hoare triple {30249#(<= main_~i~0 19)} assume true; {30249#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:44,510 INFO L273 TraceCheckUtils]: 83: Hoare triple {30249#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30249#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:44,510 INFO L273 TraceCheckUtils]: 84: Hoare triple {30249#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30249#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:44,511 INFO L273 TraceCheckUtils]: 85: Hoare triple {30249#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {30250#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:44,511 INFO L273 TraceCheckUtils]: 86: Hoare triple {30250#(<= main_~i~0 20)} assume true; {30250#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:44,512 INFO L273 TraceCheckUtils]: 87: Hoare triple {30250#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30250#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:44,512 INFO L273 TraceCheckUtils]: 88: Hoare triple {30250#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30250#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:44,513 INFO L273 TraceCheckUtils]: 89: Hoare triple {30250#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {30251#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:44,514 INFO L273 TraceCheckUtils]: 90: Hoare triple {30251#(<= main_~i~0 21)} assume true; {30251#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:44,514 INFO L273 TraceCheckUtils]: 91: Hoare triple {30251#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30251#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:44,515 INFO L273 TraceCheckUtils]: 92: Hoare triple {30251#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30251#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:44,515 INFO L273 TraceCheckUtils]: 93: Hoare triple {30251#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {30252#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:44,516 INFO L273 TraceCheckUtils]: 94: Hoare triple {30252#(<= main_~i~0 22)} assume true; {30252#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:44,516 INFO L273 TraceCheckUtils]: 95: Hoare triple {30252#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30252#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:44,517 INFO L273 TraceCheckUtils]: 96: Hoare triple {30252#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30252#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:44,517 INFO L273 TraceCheckUtils]: 97: Hoare triple {30252#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {30253#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:44,518 INFO L273 TraceCheckUtils]: 98: Hoare triple {30253#(<= main_~i~0 23)} assume true; {30253#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:44,518 INFO L273 TraceCheckUtils]: 99: Hoare triple {30253#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30253#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:44,519 INFO L273 TraceCheckUtils]: 100: Hoare triple {30253#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30253#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:44,520 INFO L273 TraceCheckUtils]: 101: Hoare triple {30253#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {30254#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:44,520 INFO L273 TraceCheckUtils]: 102: Hoare triple {30254#(<= main_~i~0 24)} assume true; {30254#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:44,521 INFO L273 TraceCheckUtils]: 103: Hoare triple {30254#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30254#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:44,521 INFO L273 TraceCheckUtils]: 104: Hoare triple {30254#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30254#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:44,522 INFO L273 TraceCheckUtils]: 105: Hoare triple {30254#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {30255#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:44,522 INFO L273 TraceCheckUtils]: 106: Hoare triple {30255#(<= main_~i~0 25)} assume true; {30255#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:44,523 INFO L273 TraceCheckUtils]: 107: Hoare triple {30255#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30255#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:44,523 INFO L273 TraceCheckUtils]: 108: Hoare triple {30255#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30255#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:44,524 INFO L273 TraceCheckUtils]: 109: Hoare triple {30255#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {30256#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:44,524 INFO L273 TraceCheckUtils]: 110: Hoare triple {30256#(<= main_~i~0 26)} assume true; {30256#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:44,525 INFO L273 TraceCheckUtils]: 111: Hoare triple {30256#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30256#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:44,525 INFO L273 TraceCheckUtils]: 112: Hoare triple {30256#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30256#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:44,526 INFO L273 TraceCheckUtils]: 113: Hoare triple {30256#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {30257#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:44,527 INFO L273 TraceCheckUtils]: 114: Hoare triple {30257#(<= main_~i~0 27)} assume true; {30257#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:44,527 INFO L273 TraceCheckUtils]: 115: Hoare triple {30257#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30257#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:44,527 INFO L273 TraceCheckUtils]: 116: Hoare triple {30257#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30257#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:44,528 INFO L273 TraceCheckUtils]: 117: Hoare triple {30257#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {30258#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:44,529 INFO L273 TraceCheckUtils]: 118: Hoare triple {30258#(<= main_~i~0 28)} assume true; {30258#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:44,529 INFO L273 TraceCheckUtils]: 119: Hoare triple {30258#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30258#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:44,530 INFO L273 TraceCheckUtils]: 120: Hoare triple {30258#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30258#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:44,530 INFO L273 TraceCheckUtils]: 121: Hoare triple {30258#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {30259#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:44,531 INFO L273 TraceCheckUtils]: 122: Hoare triple {30259#(<= main_~i~0 29)} assume true; {30259#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:44,531 INFO L273 TraceCheckUtils]: 123: Hoare triple {30259#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30259#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:44,532 INFO L273 TraceCheckUtils]: 124: Hoare triple {30259#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30259#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:44,533 INFO L273 TraceCheckUtils]: 125: Hoare triple {30259#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {30260#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:44,533 INFO L273 TraceCheckUtils]: 126: Hoare triple {30260#(<= main_~i~0 30)} assume true; {30260#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:44,534 INFO L273 TraceCheckUtils]: 127: Hoare triple {30260#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30260#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:44,534 INFO L273 TraceCheckUtils]: 128: Hoare triple {30260#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30260#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:44,535 INFO L273 TraceCheckUtils]: 129: Hoare triple {30260#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {30261#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:44,535 INFO L273 TraceCheckUtils]: 130: Hoare triple {30261#(<= main_~i~0 31)} assume true; {30261#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:44,536 INFO L273 TraceCheckUtils]: 131: Hoare triple {30261#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30261#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:44,536 INFO L273 TraceCheckUtils]: 132: Hoare triple {30261#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30261#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:44,537 INFO L273 TraceCheckUtils]: 133: Hoare triple {30261#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {30262#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:44,537 INFO L273 TraceCheckUtils]: 134: Hoare triple {30262#(<= main_~i~0 32)} assume true; {30262#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:44,538 INFO L273 TraceCheckUtils]: 135: Hoare triple {30262#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30262#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:44,538 INFO L273 TraceCheckUtils]: 136: Hoare triple {30262#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30262#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:44,539 INFO L273 TraceCheckUtils]: 137: Hoare triple {30262#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {30263#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:44,540 INFO L273 TraceCheckUtils]: 138: Hoare triple {30263#(<= main_~i~0 33)} assume true; {30263#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:44,540 INFO L273 TraceCheckUtils]: 139: Hoare triple {30263#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30263#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:44,540 INFO L273 TraceCheckUtils]: 140: Hoare triple {30263#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30263#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:44,541 INFO L273 TraceCheckUtils]: 141: Hoare triple {30263#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {30264#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:44,542 INFO L273 TraceCheckUtils]: 142: Hoare triple {30264#(<= main_~i~0 34)} assume true; {30264#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:44,542 INFO L273 TraceCheckUtils]: 143: Hoare triple {30264#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30264#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:44,543 INFO L273 TraceCheckUtils]: 144: Hoare triple {30264#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30264#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:44,543 INFO L273 TraceCheckUtils]: 145: Hoare triple {30264#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {30265#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:44,544 INFO L273 TraceCheckUtils]: 146: Hoare triple {30265#(<= main_~i~0 35)} assume true; {30265#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:44,544 INFO L273 TraceCheckUtils]: 147: Hoare triple {30265#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30265#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:44,545 INFO L273 TraceCheckUtils]: 148: Hoare triple {30265#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30265#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:44,546 INFO L273 TraceCheckUtils]: 149: Hoare triple {30265#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {30266#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:44,546 INFO L273 TraceCheckUtils]: 150: Hoare triple {30266#(<= main_~i~0 36)} assume true; {30266#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:44,547 INFO L273 TraceCheckUtils]: 151: Hoare triple {30266#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30266#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:44,547 INFO L273 TraceCheckUtils]: 152: Hoare triple {30266#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30266#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:44,548 INFO L273 TraceCheckUtils]: 153: Hoare triple {30266#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {30267#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:44,548 INFO L273 TraceCheckUtils]: 154: Hoare triple {30267#(<= main_~i~0 37)} assume true; {30267#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:44,549 INFO L273 TraceCheckUtils]: 155: Hoare triple {30267#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30267#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:44,549 INFO L273 TraceCheckUtils]: 156: Hoare triple {30267#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30267#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:44,550 INFO L273 TraceCheckUtils]: 157: Hoare triple {30267#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {30268#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:44,550 INFO L273 TraceCheckUtils]: 158: Hoare triple {30268#(<= main_~i~0 38)} assume true; {30268#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:44,551 INFO L273 TraceCheckUtils]: 159: Hoare triple {30268#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30268#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:44,551 INFO L273 TraceCheckUtils]: 160: Hoare triple {30268#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30268#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:44,552 INFO L273 TraceCheckUtils]: 161: Hoare triple {30268#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {30269#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:44,552 INFO L273 TraceCheckUtils]: 162: Hoare triple {30269#(<= main_~i~0 39)} assume true; {30269#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:44,553 INFO L273 TraceCheckUtils]: 163: Hoare triple {30269#(<= main_~i~0 39)} assume !(~i~0 < 100000); {30229#false} is VALID [2018-11-18 22:57:44,553 INFO L273 TraceCheckUtils]: 164: Hoare triple {30229#false} havoc ~x~0;~x~0 := 0; {30229#false} is VALID [2018-11-18 22:57:44,554 INFO L273 TraceCheckUtils]: 165: Hoare triple {30229#false} assume true; {30229#false} is VALID [2018-11-18 22:57:44,554 INFO L273 TraceCheckUtils]: 166: Hoare triple {30229#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {30229#false} is VALID [2018-11-18 22:57:44,554 INFO L256 TraceCheckUtils]: 167: Hoare triple {30229#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {30229#false} is VALID [2018-11-18 22:57:44,554 INFO L273 TraceCheckUtils]: 168: Hoare triple {30229#false} ~cond := #in~cond; {30229#false} is VALID [2018-11-18 22:57:44,554 INFO L273 TraceCheckUtils]: 169: Hoare triple {30229#false} assume 0 == ~cond; {30229#false} is VALID [2018-11-18 22:57:44,554 INFO L273 TraceCheckUtils]: 170: Hoare triple {30229#false} assume !false; {30229#false} is VALID [2018-11-18 22:57:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:44,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:44,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:44,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:57:44,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-18 22:57:44,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:44,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:45,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {30228#true} call ULTIMATE.init(); {30228#true} is VALID [2018-11-18 22:57:45,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {30228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30228#true} is VALID [2018-11-18 22:57:45,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {30228#true} assume true; {30228#true} is VALID [2018-11-18 22:57:45,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30228#true} {30228#true} #57#return; {30228#true} is VALID [2018-11-18 22:57:45,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {30228#true} call #t~ret4 := main(); {30228#true} is VALID [2018-11-18 22:57:45,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {30228#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {30288#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:45,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {30288#(<= main_~i~0 0)} assume true; {30288#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:45,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {30288#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30288#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:45,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {30288#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30288#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:45,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {30288#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {30231#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:45,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {30231#(<= main_~i~0 1)} assume true; {30231#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:45,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {30231#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30231#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:45,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {30231#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30231#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:45,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {30231#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {30232#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:45,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {30232#(<= main_~i~0 2)} assume true; {30232#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:45,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {30232#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30232#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:45,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {30232#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30232#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:45,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {30232#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {30233#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:45,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {30233#(<= main_~i~0 3)} assume true; {30233#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:45,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {30233#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30233#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:45,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {30233#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30233#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:45,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {30233#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {30234#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:45,095 INFO L273 TraceCheckUtils]: 22: Hoare triple {30234#(<= main_~i~0 4)} assume true; {30234#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:45,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {30234#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30234#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:45,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {30234#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30234#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:45,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {30234#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {30235#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:45,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {30235#(<= main_~i~0 5)} assume true; {30235#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:45,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {30235#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30235#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:45,098 INFO L273 TraceCheckUtils]: 28: Hoare triple {30235#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30235#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:45,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {30235#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {30236#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:45,099 INFO L273 TraceCheckUtils]: 30: Hoare triple {30236#(<= main_~i~0 6)} assume true; {30236#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:45,100 INFO L273 TraceCheckUtils]: 31: Hoare triple {30236#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30236#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:45,100 INFO L273 TraceCheckUtils]: 32: Hoare triple {30236#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30236#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:45,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {30236#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {30237#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:45,102 INFO L273 TraceCheckUtils]: 34: Hoare triple {30237#(<= main_~i~0 7)} assume true; {30237#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:45,102 INFO L273 TraceCheckUtils]: 35: Hoare triple {30237#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30237#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:45,103 INFO L273 TraceCheckUtils]: 36: Hoare triple {30237#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30237#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:45,103 INFO L273 TraceCheckUtils]: 37: Hoare triple {30237#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {30238#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:45,104 INFO L273 TraceCheckUtils]: 38: Hoare triple {30238#(<= main_~i~0 8)} assume true; {30238#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:45,104 INFO L273 TraceCheckUtils]: 39: Hoare triple {30238#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30238#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:45,105 INFO L273 TraceCheckUtils]: 40: Hoare triple {30238#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30238#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:45,105 INFO L273 TraceCheckUtils]: 41: Hoare triple {30238#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {30239#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:45,106 INFO L273 TraceCheckUtils]: 42: Hoare triple {30239#(<= main_~i~0 9)} assume true; {30239#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:45,106 INFO L273 TraceCheckUtils]: 43: Hoare triple {30239#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30239#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:45,107 INFO L273 TraceCheckUtils]: 44: Hoare triple {30239#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30239#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:45,108 INFO L273 TraceCheckUtils]: 45: Hoare triple {30239#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {30240#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:45,108 INFO L273 TraceCheckUtils]: 46: Hoare triple {30240#(<= main_~i~0 10)} assume true; {30240#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:45,109 INFO L273 TraceCheckUtils]: 47: Hoare triple {30240#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30240#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:45,109 INFO L273 TraceCheckUtils]: 48: Hoare triple {30240#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30240#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:45,110 INFO L273 TraceCheckUtils]: 49: Hoare triple {30240#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {30241#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:45,110 INFO L273 TraceCheckUtils]: 50: Hoare triple {30241#(<= main_~i~0 11)} assume true; {30241#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:45,111 INFO L273 TraceCheckUtils]: 51: Hoare triple {30241#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30241#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:45,111 INFO L273 TraceCheckUtils]: 52: Hoare triple {30241#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30241#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:45,112 INFO L273 TraceCheckUtils]: 53: Hoare triple {30241#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {30242#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:45,113 INFO L273 TraceCheckUtils]: 54: Hoare triple {30242#(<= main_~i~0 12)} assume true; {30242#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:45,113 INFO L273 TraceCheckUtils]: 55: Hoare triple {30242#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30242#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:45,113 INFO L273 TraceCheckUtils]: 56: Hoare triple {30242#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30242#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:45,114 INFO L273 TraceCheckUtils]: 57: Hoare triple {30242#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {30243#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:45,115 INFO L273 TraceCheckUtils]: 58: Hoare triple {30243#(<= main_~i~0 13)} assume true; {30243#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:45,115 INFO L273 TraceCheckUtils]: 59: Hoare triple {30243#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30243#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:45,116 INFO L273 TraceCheckUtils]: 60: Hoare triple {30243#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30243#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:45,116 INFO L273 TraceCheckUtils]: 61: Hoare triple {30243#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {30244#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:45,117 INFO L273 TraceCheckUtils]: 62: Hoare triple {30244#(<= main_~i~0 14)} assume true; {30244#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:45,117 INFO L273 TraceCheckUtils]: 63: Hoare triple {30244#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30244#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:45,118 INFO L273 TraceCheckUtils]: 64: Hoare triple {30244#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30244#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:45,119 INFO L273 TraceCheckUtils]: 65: Hoare triple {30244#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {30245#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:45,119 INFO L273 TraceCheckUtils]: 66: Hoare triple {30245#(<= main_~i~0 15)} assume true; {30245#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:45,120 INFO L273 TraceCheckUtils]: 67: Hoare triple {30245#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30245#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:45,120 INFO L273 TraceCheckUtils]: 68: Hoare triple {30245#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30245#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:45,121 INFO L273 TraceCheckUtils]: 69: Hoare triple {30245#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {30246#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:45,121 INFO L273 TraceCheckUtils]: 70: Hoare triple {30246#(<= main_~i~0 16)} assume true; {30246#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:45,122 INFO L273 TraceCheckUtils]: 71: Hoare triple {30246#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30246#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:45,122 INFO L273 TraceCheckUtils]: 72: Hoare triple {30246#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30246#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:45,123 INFO L273 TraceCheckUtils]: 73: Hoare triple {30246#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {30247#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:45,123 INFO L273 TraceCheckUtils]: 74: Hoare triple {30247#(<= main_~i~0 17)} assume true; {30247#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:45,124 INFO L273 TraceCheckUtils]: 75: Hoare triple {30247#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30247#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:45,124 INFO L273 TraceCheckUtils]: 76: Hoare triple {30247#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30247#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:45,125 INFO L273 TraceCheckUtils]: 77: Hoare triple {30247#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {30248#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:45,126 INFO L273 TraceCheckUtils]: 78: Hoare triple {30248#(<= main_~i~0 18)} assume true; {30248#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:45,126 INFO L273 TraceCheckUtils]: 79: Hoare triple {30248#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30248#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:45,127 INFO L273 TraceCheckUtils]: 80: Hoare triple {30248#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30248#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:45,127 INFO L273 TraceCheckUtils]: 81: Hoare triple {30248#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {30249#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:45,128 INFO L273 TraceCheckUtils]: 82: Hoare triple {30249#(<= main_~i~0 19)} assume true; {30249#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:45,128 INFO L273 TraceCheckUtils]: 83: Hoare triple {30249#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30249#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:45,129 INFO L273 TraceCheckUtils]: 84: Hoare triple {30249#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30249#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:45,130 INFO L273 TraceCheckUtils]: 85: Hoare triple {30249#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {30250#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:45,130 INFO L273 TraceCheckUtils]: 86: Hoare triple {30250#(<= main_~i~0 20)} assume true; {30250#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:45,131 INFO L273 TraceCheckUtils]: 87: Hoare triple {30250#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30250#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:45,131 INFO L273 TraceCheckUtils]: 88: Hoare triple {30250#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30250#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:45,132 INFO L273 TraceCheckUtils]: 89: Hoare triple {30250#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {30251#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:45,132 INFO L273 TraceCheckUtils]: 90: Hoare triple {30251#(<= main_~i~0 21)} assume true; {30251#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:45,133 INFO L273 TraceCheckUtils]: 91: Hoare triple {30251#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30251#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:45,133 INFO L273 TraceCheckUtils]: 92: Hoare triple {30251#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30251#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:45,134 INFO L273 TraceCheckUtils]: 93: Hoare triple {30251#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {30252#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:45,134 INFO L273 TraceCheckUtils]: 94: Hoare triple {30252#(<= main_~i~0 22)} assume true; {30252#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:45,135 INFO L273 TraceCheckUtils]: 95: Hoare triple {30252#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30252#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:45,135 INFO L273 TraceCheckUtils]: 96: Hoare triple {30252#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30252#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:45,136 INFO L273 TraceCheckUtils]: 97: Hoare triple {30252#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {30253#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:45,137 INFO L273 TraceCheckUtils]: 98: Hoare triple {30253#(<= main_~i~0 23)} assume true; {30253#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:45,137 INFO L273 TraceCheckUtils]: 99: Hoare triple {30253#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30253#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:45,138 INFO L273 TraceCheckUtils]: 100: Hoare triple {30253#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30253#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:45,138 INFO L273 TraceCheckUtils]: 101: Hoare triple {30253#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {30254#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:45,139 INFO L273 TraceCheckUtils]: 102: Hoare triple {30254#(<= main_~i~0 24)} assume true; {30254#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:45,139 INFO L273 TraceCheckUtils]: 103: Hoare triple {30254#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30254#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:45,140 INFO L273 TraceCheckUtils]: 104: Hoare triple {30254#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30254#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:45,141 INFO L273 TraceCheckUtils]: 105: Hoare triple {30254#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {30255#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:45,141 INFO L273 TraceCheckUtils]: 106: Hoare triple {30255#(<= main_~i~0 25)} assume true; {30255#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:45,142 INFO L273 TraceCheckUtils]: 107: Hoare triple {30255#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30255#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:45,142 INFO L273 TraceCheckUtils]: 108: Hoare triple {30255#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30255#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:45,143 INFO L273 TraceCheckUtils]: 109: Hoare triple {30255#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {30256#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:45,143 INFO L273 TraceCheckUtils]: 110: Hoare triple {30256#(<= main_~i~0 26)} assume true; {30256#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:45,144 INFO L273 TraceCheckUtils]: 111: Hoare triple {30256#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30256#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:45,144 INFO L273 TraceCheckUtils]: 112: Hoare triple {30256#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30256#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:45,145 INFO L273 TraceCheckUtils]: 113: Hoare triple {30256#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {30257#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:45,146 INFO L273 TraceCheckUtils]: 114: Hoare triple {30257#(<= main_~i~0 27)} assume true; {30257#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:45,146 INFO L273 TraceCheckUtils]: 115: Hoare triple {30257#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30257#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:45,146 INFO L273 TraceCheckUtils]: 116: Hoare triple {30257#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30257#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:45,147 INFO L273 TraceCheckUtils]: 117: Hoare triple {30257#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {30258#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:45,148 INFO L273 TraceCheckUtils]: 118: Hoare triple {30258#(<= main_~i~0 28)} assume true; {30258#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:45,148 INFO L273 TraceCheckUtils]: 119: Hoare triple {30258#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30258#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:45,149 INFO L273 TraceCheckUtils]: 120: Hoare triple {30258#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30258#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:45,149 INFO L273 TraceCheckUtils]: 121: Hoare triple {30258#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {30259#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:45,150 INFO L273 TraceCheckUtils]: 122: Hoare triple {30259#(<= main_~i~0 29)} assume true; {30259#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:45,150 INFO L273 TraceCheckUtils]: 123: Hoare triple {30259#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30259#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:45,151 INFO L273 TraceCheckUtils]: 124: Hoare triple {30259#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30259#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:45,152 INFO L273 TraceCheckUtils]: 125: Hoare triple {30259#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {30260#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:45,152 INFO L273 TraceCheckUtils]: 126: Hoare triple {30260#(<= main_~i~0 30)} assume true; {30260#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:45,153 INFO L273 TraceCheckUtils]: 127: Hoare triple {30260#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30260#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:45,153 INFO L273 TraceCheckUtils]: 128: Hoare triple {30260#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30260#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:45,154 INFO L273 TraceCheckUtils]: 129: Hoare triple {30260#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {30261#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:45,154 INFO L273 TraceCheckUtils]: 130: Hoare triple {30261#(<= main_~i~0 31)} assume true; {30261#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:45,155 INFO L273 TraceCheckUtils]: 131: Hoare triple {30261#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30261#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:45,155 INFO L273 TraceCheckUtils]: 132: Hoare triple {30261#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30261#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:45,156 INFO L273 TraceCheckUtils]: 133: Hoare triple {30261#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {30262#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:45,156 INFO L273 TraceCheckUtils]: 134: Hoare triple {30262#(<= main_~i~0 32)} assume true; {30262#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:45,157 INFO L273 TraceCheckUtils]: 135: Hoare triple {30262#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30262#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:45,157 INFO L273 TraceCheckUtils]: 136: Hoare triple {30262#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30262#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:45,158 INFO L273 TraceCheckUtils]: 137: Hoare triple {30262#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {30263#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:45,159 INFO L273 TraceCheckUtils]: 138: Hoare triple {30263#(<= main_~i~0 33)} assume true; {30263#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:45,159 INFO L273 TraceCheckUtils]: 139: Hoare triple {30263#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30263#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:45,160 INFO L273 TraceCheckUtils]: 140: Hoare triple {30263#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30263#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:45,160 INFO L273 TraceCheckUtils]: 141: Hoare triple {30263#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {30264#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:45,161 INFO L273 TraceCheckUtils]: 142: Hoare triple {30264#(<= main_~i~0 34)} assume true; {30264#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:45,161 INFO L273 TraceCheckUtils]: 143: Hoare triple {30264#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30264#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:45,162 INFO L273 TraceCheckUtils]: 144: Hoare triple {30264#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30264#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:45,163 INFO L273 TraceCheckUtils]: 145: Hoare triple {30264#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {30265#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:45,163 INFO L273 TraceCheckUtils]: 146: Hoare triple {30265#(<= main_~i~0 35)} assume true; {30265#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:45,164 INFO L273 TraceCheckUtils]: 147: Hoare triple {30265#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30265#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:45,164 INFO L273 TraceCheckUtils]: 148: Hoare triple {30265#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30265#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:45,165 INFO L273 TraceCheckUtils]: 149: Hoare triple {30265#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {30266#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:45,165 INFO L273 TraceCheckUtils]: 150: Hoare triple {30266#(<= main_~i~0 36)} assume true; {30266#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:45,166 INFO L273 TraceCheckUtils]: 151: Hoare triple {30266#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30266#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:45,166 INFO L273 TraceCheckUtils]: 152: Hoare triple {30266#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30266#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:45,167 INFO L273 TraceCheckUtils]: 153: Hoare triple {30266#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {30267#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:45,167 INFO L273 TraceCheckUtils]: 154: Hoare triple {30267#(<= main_~i~0 37)} assume true; {30267#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:45,168 INFO L273 TraceCheckUtils]: 155: Hoare triple {30267#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30267#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:45,168 INFO L273 TraceCheckUtils]: 156: Hoare triple {30267#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30267#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:45,169 INFO L273 TraceCheckUtils]: 157: Hoare triple {30267#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {30268#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:45,170 INFO L273 TraceCheckUtils]: 158: Hoare triple {30268#(<= main_~i~0 38)} assume true; {30268#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:45,170 INFO L273 TraceCheckUtils]: 159: Hoare triple {30268#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30268#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:45,171 INFO L273 TraceCheckUtils]: 160: Hoare triple {30268#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30268#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:45,171 INFO L273 TraceCheckUtils]: 161: Hoare triple {30268#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {30269#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:45,172 INFO L273 TraceCheckUtils]: 162: Hoare triple {30269#(<= main_~i~0 39)} assume true; {30269#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:45,173 INFO L273 TraceCheckUtils]: 163: Hoare triple {30269#(<= main_~i~0 39)} assume !(~i~0 < 100000); {30229#false} is VALID [2018-11-18 22:57:45,173 INFO L273 TraceCheckUtils]: 164: Hoare triple {30229#false} havoc ~x~0;~x~0 := 0; {30229#false} is VALID [2018-11-18 22:57:45,173 INFO L273 TraceCheckUtils]: 165: Hoare triple {30229#false} assume true; {30229#false} is VALID [2018-11-18 22:57:45,173 INFO L273 TraceCheckUtils]: 166: Hoare triple {30229#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {30229#false} is VALID [2018-11-18 22:57:45,173 INFO L256 TraceCheckUtils]: 167: Hoare triple {30229#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {30229#false} is VALID [2018-11-18 22:57:45,173 INFO L273 TraceCheckUtils]: 168: Hoare triple {30229#false} ~cond := #in~cond; {30229#false} is VALID [2018-11-18 22:57:45,174 INFO L273 TraceCheckUtils]: 169: Hoare triple {30229#false} assume 0 == ~cond; {30229#false} is VALID [2018-11-18 22:57:45,174 INFO L273 TraceCheckUtils]: 170: Hoare triple {30229#false} assume !false; {30229#false} is VALID [2018-11-18 22:57:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:45,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:45,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-18 22:57:45,215 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 171 [2018-11-18 22:57:45,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:45,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-18 22:57:45,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:45,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-18 22:57:45,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-18 22:57:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 22:57:45,380 INFO L87 Difference]: Start difference. First operand 176 states and 216 transitions. Second operand 43 states. [2018-11-18 22:57:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:46,261 INFO L93 Difference]: Finished difference Result 194 states and 237 transitions. [2018-11-18 22:57:46,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-18 22:57:46,261 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 171 [2018-11-18 22:57:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:57:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 237 transitions. [2018-11-18 22:57:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:57:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 237 transitions. [2018-11-18 22:57:46,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 237 transitions. [2018-11-18 22:57:46,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:46,474 INFO L225 Difference]: With dead ends: 194 [2018-11-18 22:57:46,475 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 22:57:46,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 22:57:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 22:57:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-11-18 22:57:46,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:46,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 180 states. [2018-11-18 22:57:46,509 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 180 states. [2018-11-18 22:57:46,509 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 180 states. [2018-11-18 22:57:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:46,514 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2018-11-18 22:57:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2018-11-18 22:57:46,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:46,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:46,515 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 182 states. [2018-11-18 22:57:46,515 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 182 states. [2018-11-18 22:57:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:46,518 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2018-11-18 22:57:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2018-11-18 22:57:46,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:46,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:46,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:46,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-18 22:57:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 221 transitions. [2018-11-18 22:57:46,521 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 221 transitions. Word has length 171 [2018-11-18 22:57:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:46,521 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 221 transitions. [2018-11-18 22:57:46,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-18 22:57:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 221 transitions. [2018-11-18 22:57:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 22:57:46,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:46,522 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:46,522 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:46,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:46,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2076110066, now seen corresponding path program 40 times [2018-11-18 22:57:46,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:46,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:46,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:46,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:46,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:47,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {31620#true} call ULTIMATE.init(); {31620#true} is VALID [2018-11-18 22:57:47,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {31620#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31620#true} is VALID [2018-11-18 22:57:47,736 INFO L273 TraceCheckUtils]: 2: Hoare triple {31620#true} assume true; {31620#true} is VALID [2018-11-18 22:57:47,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31620#true} {31620#true} #57#return; {31620#true} is VALID [2018-11-18 22:57:47,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {31620#true} call #t~ret4 := main(); {31620#true} is VALID [2018-11-18 22:57:47,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {31620#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {31622#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {31622#(= main_~i~0 0)} assume true; {31622#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {31622#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31622#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {31622#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31622#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,739 INFO L273 TraceCheckUtils]: 9: Hoare triple {31622#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {31623#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:47,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {31623#(<= main_~i~0 1)} assume true; {31623#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:47,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {31623#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31623#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:47,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {31623#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31623#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:47,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {31623#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {31624#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:47,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {31624#(<= main_~i~0 2)} assume true; {31624#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:47,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {31624#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31624#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:47,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {31624#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31624#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:47,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {31624#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {31625#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:47,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {31625#(<= main_~i~0 3)} assume true; {31625#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:47,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {31625#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31625#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:47,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {31625#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31625#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:47,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {31625#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {31626#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:47,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {31626#(<= main_~i~0 4)} assume true; {31626#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:47,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {31626#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31626#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:47,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {31626#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31626#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:47,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {31626#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {31627#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:47,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {31627#(<= main_~i~0 5)} assume true; {31627#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:47,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {31627#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31627#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:47,749 INFO L273 TraceCheckUtils]: 28: Hoare triple {31627#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31627#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:47,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {31627#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {31628#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:47,750 INFO L273 TraceCheckUtils]: 30: Hoare triple {31628#(<= main_~i~0 6)} assume true; {31628#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:47,751 INFO L273 TraceCheckUtils]: 31: Hoare triple {31628#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31628#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:47,751 INFO L273 TraceCheckUtils]: 32: Hoare triple {31628#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31628#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:47,752 INFO L273 TraceCheckUtils]: 33: Hoare triple {31628#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {31629#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:47,753 INFO L273 TraceCheckUtils]: 34: Hoare triple {31629#(<= main_~i~0 7)} assume true; {31629#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:47,753 INFO L273 TraceCheckUtils]: 35: Hoare triple {31629#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31629#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:47,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {31629#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31629#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:47,754 INFO L273 TraceCheckUtils]: 37: Hoare triple {31629#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {31630#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:47,755 INFO L273 TraceCheckUtils]: 38: Hoare triple {31630#(<= main_~i~0 8)} assume true; {31630#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:47,755 INFO L273 TraceCheckUtils]: 39: Hoare triple {31630#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31630#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:47,756 INFO L273 TraceCheckUtils]: 40: Hoare triple {31630#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31630#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:47,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {31630#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {31631#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:47,757 INFO L273 TraceCheckUtils]: 42: Hoare triple {31631#(<= main_~i~0 9)} assume true; {31631#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:47,757 INFO L273 TraceCheckUtils]: 43: Hoare triple {31631#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31631#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:47,758 INFO L273 TraceCheckUtils]: 44: Hoare triple {31631#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31631#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:47,759 INFO L273 TraceCheckUtils]: 45: Hoare triple {31631#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {31632#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:47,759 INFO L273 TraceCheckUtils]: 46: Hoare triple {31632#(<= main_~i~0 10)} assume true; {31632#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:47,760 INFO L273 TraceCheckUtils]: 47: Hoare triple {31632#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31632#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:47,760 INFO L273 TraceCheckUtils]: 48: Hoare triple {31632#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31632#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:47,761 INFO L273 TraceCheckUtils]: 49: Hoare triple {31632#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {31633#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:47,761 INFO L273 TraceCheckUtils]: 50: Hoare triple {31633#(<= main_~i~0 11)} assume true; {31633#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:47,762 INFO L273 TraceCheckUtils]: 51: Hoare triple {31633#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31633#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:47,762 INFO L273 TraceCheckUtils]: 52: Hoare triple {31633#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31633#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:47,763 INFO L273 TraceCheckUtils]: 53: Hoare triple {31633#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {31634#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:47,764 INFO L273 TraceCheckUtils]: 54: Hoare triple {31634#(<= main_~i~0 12)} assume true; {31634#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:47,764 INFO L273 TraceCheckUtils]: 55: Hoare triple {31634#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31634#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:47,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {31634#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31634#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:47,765 INFO L273 TraceCheckUtils]: 57: Hoare triple {31634#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {31635#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:47,766 INFO L273 TraceCheckUtils]: 58: Hoare triple {31635#(<= main_~i~0 13)} assume true; {31635#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:47,766 INFO L273 TraceCheckUtils]: 59: Hoare triple {31635#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31635#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:47,767 INFO L273 TraceCheckUtils]: 60: Hoare triple {31635#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31635#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:47,767 INFO L273 TraceCheckUtils]: 61: Hoare triple {31635#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {31636#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:47,768 INFO L273 TraceCheckUtils]: 62: Hoare triple {31636#(<= main_~i~0 14)} assume true; {31636#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:47,768 INFO L273 TraceCheckUtils]: 63: Hoare triple {31636#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31636#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:47,769 INFO L273 TraceCheckUtils]: 64: Hoare triple {31636#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31636#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:47,770 INFO L273 TraceCheckUtils]: 65: Hoare triple {31636#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {31637#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:47,770 INFO L273 TraceCheckUtils]: 66: Hoare triple {31637#(<= main_~i~0 15)} assume true; {31637#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:47,771 INFO L273 TraceCheckUtils]: 67: Hoare triple {31637#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31637#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:47,771 INFO L273 TraceCheckUtils]: 68: Hoare triple {31637#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31637#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:47,772 INFO L273 TraceCheckUtils]: 69: Hoare triple {31637#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {31638#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:47,772 INFO L273 TraceCheckUtils]: 70: Hoare triple {31638#(<= main_~i~0 16)} assume true; {31638#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:47,773 INFO L273 TraceCheckUtils]: 71: Hoare triple {31638#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31638#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:47,773 INFO L273 TraceCheckUtils]: 72: Hoare triple {31638#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31638#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:47,774 INFO L273 TraceCheckUtils]: 73: Hoare triple {31638#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {31639#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:47,775 INFO L273 TraceCheckUtils]: 74: Hoare triple {31639#(<= main_~i~0 17)} assume true; {31639#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:47,775 INFO L273 TraceCheckUtils]: 75: Hoare triple {31639#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31639#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:47,776 INFO L273 TraceCheckUtils]: 76: Hoare triple {31639#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31639#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:47,776 INFO L273 TraceCheckUtils]: 77: Hoare triple {31639#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {31640#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:47,777 INFO L273 TraceCheckUtils]: 78: Hoare triple {31640#(<= main_~i~0 18)} assume true; {31640#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:47,777 INFO L273 TraceCheckUtils]: 79: Hoare triple {31640#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31640#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:47,778 INFO L273 TraceCheckUtils]: 80: Hoare triple {31640#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31640#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:47,778 INFO L273 TraceCheckUtils]: 81: Hoare triple {31640#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {31641#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:47,779 INFO L273 TraceCheckUtils]: 82: Hoare triple {31641#(<= main_~i~0 19)} assume true; {31641#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:47,779 INFO L273 TraceCheckUtils]: 83: Hoare triple {31641#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31641#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:47,780 INFO L273 TraceCheckUtils]: 84: Hoare triple {31641#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31641#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:47,781 INFO L273 TraceCheckUtils]: 85: Hoare triple {31641#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {31642#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:47,781 INFO L273 TraceCheckUtils]: 86: Hoare triple {31642#(<= main_~i~0 20)} assume true; {31642#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:47,782 INFO L273 TraceCheckUtils]: 87: Hoare triple {31642#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31642#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:47,782 INFO L273 TraceCheckUtils]: 88: Hoare triple {31642#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31642#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:47,783 INFO L273 TraceCheckUtils]: 89: Hoare triple {31642#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {31643#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:47,783 INFO L273 TraceCheckUtils]: 90: Hoare triple {31643#(<= main_~i~0 21)} assume true; {31643#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:47,784 INFO L273 TraceCheckUtils]: 91: Hoare triple {31643#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31643#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:47,784 INFO L273 TraceCheckUtils]: 92: Hoare triple {31643#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31643#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:47,785 INFO L273 TraceCheckUtils]: 93: Hoare triple {31643#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {31644#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:47,786 INFO L273 TraceCheckUtils]: 94: Hoare triple {31644#(<= main_~i~0 22)} assume true; {31644#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:47,786 INFO L273 TraceCheckUtils]: 95: Hoare triple {31644#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31644#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:47,787 INFO L273 TraceCheckUtils]: 96: Hoare triple {31644#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31644#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:47,787 INFO L273 TraceCheckUtils]: 97: Hoare triple {31644#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {31645#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:47,788 INFO L273 TraceCheckUtils]: 98: Hoare triple {31645#(<= main_~i~0 23)} assume true; {31645#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:47,788 INFO L273 TraceCheckUtils]: 99: Hoare triple {31645#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31645#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:47,789 INFO L273 TraceCheckUtils]: 100: Hoare triple {31645#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31645#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:47,789 INFO L273 TraceCheckUtils]: 101: Hoare triple {31645#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {31646#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:47,790 INFO L273 TraceCheckUtils]: 102: Hoare triple {31646#(<= main_~i~0 24)} assume true; {31646#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:47,790 INFO L273 TraceCheckUtils]: 103: Hoare triple {31646#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31646#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:47,791 INFO L273 TraceCheckUtils]: 104: Hoare triple {31646#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31646#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:47,792 INFO L273 TraceCheckUtils]: 105: Hoare triple {31646#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {31647#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:47,792 INFO L273 TraceCheckUtils]: 106: Hoare triple {31647#(<= main_~i~0 25)} assume true; {31647#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:47,793 INFO L273 TraceCheckUtils]: 107: Hoare triple {31647#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31647#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:47,793 INFO L273 TraceCheckUtils]: 108: Hoare triple {31647#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31647#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:47,794 INFO L273 TraceCheckUtils]: 109: Hoare triple {31647#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {31648#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:47,794 INFO L273 TraceCheckUtils]: 110: Hoare triple {31648#(<= main_~i~0 26)} assume true; {31648#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:47,795 INFO L273 TraceCheckUtils]: 111: Hoare triple {31648#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31648#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:47,795 INFO L273 TraceCheckUtils]: 112: Hoare triple {31648#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31648#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:47,796 INFO L273 TraceCheckUtils]: 113: Hoare triple {31648#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {31649#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:47,797 INFO L273 TraceCheckUtils]: 114: Hoare triple {31649#(<= main_~i~0 27)} assume true; {31649#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:47,797 INFO L273 TraceCheckUtils]: 115: Hoare triple {31649#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31649#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:47,798 INFO L273 TraceCheckUtils]: 116: Hoare triple {31649#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31649#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:47,798 INFO L273 TraceCheckUtils]: 117: Hoare triple {31649#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {31650#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:47,799 INFO L273 TraceCheckUtils]: 118: Hoare triple {31650#(<= main_~i~0 28)} assume true; {31650#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:47,799 INFO L273 TraceCheckUtils]: 119: Hoare triple {31650#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31650#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:47,800 INFO L273 TraceCheckUtils]: 120: Hoare triple {31650#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31650#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:47,800 INFO L273 TraceCheckUtils]: 121: Hoare triple {31650#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {31651#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:47,801 INFO L273 TraceCheckUtils]: 122: Hoare triple {31651#(<= main_~i~0 29)} assume true; {31651#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:47,801 INFO L273 TraceCheckUtils]: 123: Hoare triple {31651#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31651#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:47,802 INFO L273 TraceCheckUtils]: 124: Hoare triple {31651#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31651#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:47,803 INFO L273 TraceCheckUtils]: 125: Hoare triple {31651#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {31652#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:47,803 INFO L273 TraceCheckUtils]: 126: Hoare triple {31652#(<= main_~i~0 30)} assume true; {31652#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:47,804 INFO L273 TraceCheckUtils]: 127: Hoare triple {31652#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31652#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:47,804 INFO L273 TraceCheckUtils]: 128: Hoare triple {31652#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31652#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:47,805 INFO L273 TraceCheckUtils]: 129: Hoare triple {31652#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {31653#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:47,805 INFO L273 TraceCheckUtils]: 130: Hoare triple {31653#(<= main_~i~0 31)} assume true; {31653#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:47,806 INFO L273 TraceCheckUtils]: 131: Hoare triple {31653#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31653#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:47,806 INFO L273 TraceCheckUtils]: 132: Hoare triple {31653#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31653#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:47,807 INFO L273 TraceCheckUtils]: 133: Hoare triple {31653#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {31654#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:47,808 INFO L273 TraceCheckUtils]: 134: Hoare triple {31654#(<= main_~i~0 32)} assume true; {31654#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:47,808 INFO L273 TraceCheckUtils]: 135: Hoare triple {31654#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31654#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:47,809 INFO L273 TraceCheckUtils]: 136: Hoare triple {31654#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31654#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:47,809 INFO L273 TraceCheckUtils]: 137: Hoare triple {31654#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {31655#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:47,810 INFO L273 TraceCheckUtils]: 138: Hoare triple {31655#(<= main_~i~0 33)} assume true; {31655#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:47,810 INFO L273 TraceCheckUtils]: 139: Hoare triple {31655#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31655#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:47,811 INFO L273 TraceCheckUtils]: 140: Hoare triple {31655#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31655#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:47,812 INFO L273 TraceCheckUtils]: 141: Hoare triple {31655#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {31656#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:47,812 INFO L273 TraceCheckUtils]: 142: Hoare triple {31656#(<= main_~i~0 34)} assume true; {31656#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:47,813 INFO L273 TraceCheckUtils]: 143: Hoare triple {31656#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31656#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:47,813 INFO L273 TraceCheckUtils]: 144: Hoare triple {31656#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31656#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:47,814 INFO L273 TraceCheckUtils]: 145: Hoare triple {31656#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {31657#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:47,814 INFO L273 TraceCheckUtils]: 146: Hoare triple {31657#(<= main_~i~0 35)} assume true; {31657#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:47,815 INFO L273 TraceCheckUtils]: 147: Hoare triple {31657#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31657#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:47,815 INFO L273 TraceCheckUtils]: 148: Hoare triple {31657#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31657#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:47,816 INFO L273 TraceCheckUtils]: 149: Hoare triple {31657#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {31658#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:47,817 INFO L273 TraceCheckUtils]: 150: Hoare triple {31658#(<= main_~i~0 36)} assume true; {31658#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:47,817 INFO L273 TraceCheckUtils]: 151: Hoare triple {31658#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31658#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:47,818 INFO L273 TraceCheckUtils]: 152: Hoare triple {31658#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31658#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:47,818 INFO L273 TraceCheckUtils]: 153: Hoare triple {31658#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {31659#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:47,819 INFO L273 TraceCheckUtils]: 154: Hoare triple {31659#(<= main_~i~0 37)} assume true; {31659#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:47,819 INFO L273 TraceCheckUtils]: 155: Hoare triple {31659#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31659#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:47,820 INFO L273 TraceCheckUtils]: 156: Hoare triple {31659#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31659#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:47,820 INFO L273 TraceCheckUtils]: 157: Hoare triple {31659#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {31660#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:47,821 INFO L273 TraceCheckUtils]: 158: Hoare triple {31660#(<= main_~i~0 38)} assume true; {31660#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:47,822 INFO L273 TraceCheckUtils]: 159: Hoare triple {31660#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31660#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:47,822 INFO L273 TraceCheckUtils]: 160: Hoare triple {31660#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31660#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:47,823 INFO L273 TraceCheckUtils]: 161: Hoare triple {31660#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {31661#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:47,823 INFO L273 TraceCheckUtils]: 162: Hoare triple {31661#(<= main_~i~0 39)} assume true; {31661#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:47,824 INFO L273 TraceCheckUtils]: 163: Hoare triple {31661#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31661#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:47,824 INFO L273 TraceCheckUtils]: 164: Hoare triple {31661#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31661#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:47,825 INFO L273 TraceCheckUtils]: 165: Hoare triple {31661#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {31662#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:47,825 INFO L273 TraceCheckUtils]: 166: Hoare triple {31662#(<= main_~i~0 40)} assume true; {31662#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:47,826 INFO L273 TraceCheckUtils]: 167: Hoare triple {31662#(<= main_~i~0 40)} assume !(~i~0 < 100000); {31621#false} is VALID [2018-11-18 22:57:47,826 INFO L273 TraceCheckUtils]: 168: Hoare triple {31621#false} havoc ~x~0;~x~0 := 0; {31621#false} is VALID [2018-11-18 22:57:47,826 INFO L273 TraceCheckUtils]: 169: Hoare triple {31621#false} assume true; {31621#false} is VALID [2018-11-18 22:57:47,827 INFO L273 TraceCheckUtils]: 170: Hoare triple {31621#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {31621#false} is VALID [2018-11-18 22:57:47,827 INFO L256 TraceCheckUtils]: 171: Hoare triple {31621#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {31621#false} is VALID [2018-11-18 22:57:47,827 INFO L273 TraceCheckUtils]: 172: Hoare triple {31621#false} ~cond := #in~cond; {31621#false} is VALID [2018-11-18 22:57:47,827 INFO L273 TraceCheckUtils]: 173: Hoare triple {31621#false} assume 0 == ~cond; {31621#false} is VALID [2018-11-18 22:57:47,827 INFO L273 TraceCheckUtils]: 174: Hoare triple {31621#false} assume !false; {31621#false} is VALID [2018-11-18 22:57:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:47,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:47,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:47,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:57:47,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:57:47,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:47,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:48,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {31620#true} call ULTIMATE.init(); {31620#true} is VALID [2018-11-18 22:57:48,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {31620#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31620#true} is VALID [2018-11-18 22:57:48,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {31620#true} assume true; {31620#true} is VALID [2018-11-18 22:57:48,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31620#true} {31620#true} #57#return; {31620#true} is VALID [2018-11-18 22:57:48,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {31620#true} call #t~ret4 := main(); {31620#true} is VALID [2018-11-18 22:57:48,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {31620#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {31681#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:48,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {31681#(<= main_~i~0 0)} assume true; {31681#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:48,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {31681#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31681#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:48,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {31681#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31681#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:48,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {31681#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {31623#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:48,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {31623#(<= main_~i~0 1)} assume true; {31623#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:48,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {31623#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31623#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:48,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {31623#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31623#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:48,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {31623#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {31624#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:48,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {31624#(<= main_~i~0 2)} assume true; {31624#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:48,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {31624#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31624#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:48,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {31624#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31624#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:48,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {31624#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {31625#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:48,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {31625#(<= main_~i~0 3)} assume true; {31625#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:48,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {31625#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31625#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:48,270 INFO L273 TraceCheckUtils]: 20: Hoare triple {31625#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31625#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:48,271 INFO L273 TraceCheckUtils]: 21: Hoare triple {31625#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {31626#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:48,271 INFO L273 TraceCheckUtils]: 22: Hoare triple {31626#(<= main_~i~0 4)} assume true; {31626#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:48,272 INFO L273 TraceCheckUtils]: 23: Hoare triple {31626#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31626#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:48,272 INFO L273 TraceCheckUtils]: 24: Hoare triple {31626#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31626#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:48,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {31626#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {31627#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:48,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {31627#(<= main_~i~0 5)} assume true; {31627#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:48,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {31627#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31627#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:48,275 INFO L273 TraceCheckUtils]: 28: Hoare triple {31627#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31627#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:48,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {31627#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {31628#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:48,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {31628#(<= main_~i~0 6)} assume true; {31628#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:48,276 INFO L273 TraceCheckUtils]: 31: Hoare triple {31628#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31628#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:48,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {31628#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31628#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:48,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {31628#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {31629#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:48,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {31629#(<= main_~i~0 7)} assume true; {31629#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:48,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {31629#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31629#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:48,279 INFO L273 TraceCheckUtils]: 36: Hoare triple {31629#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31629#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:48,280 INFO L273 TraceCheckUtils]: 37: Hoare triple {31629#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {31630#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:48,280 INFO L273 TraceCheckUtils]: 38: Hoare triple {31630#(<= main_~i~0 8)} assume true; {31630#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:48,281 INFO L273 TraceCheckUtils]: 39: Hoare triple {31630#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31630#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:48,281 INFO L273 TraceCheckUtils]: 40: Hoare triple {31630#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31630#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:48,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {31630#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {31631#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:48,282 INFO L273 TraceCheckUtils]: 42: Hoare triple {31631#(<= main_~i~0 9)} assume true; {31631#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:48,283 INFO L273 TraceCheckUtils]: 43: Hoare triple {31631#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31631#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:48,283 INFO L273 TraceCheckUtils]: 44: Hoare triple {31631#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31631#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:48,284 INFO L273 TraceCheckUtils]: 45: Hoare triple {31631#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {31632#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:48,285 INFO L273 TraceCheckUtils]: 46: Hoare triple {31632#(<= main_~i~0 10)} assume true; {31632#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:48,285 INFO L273 TraceCheckUtils]: 47: Hoare triple {31632#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31632#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:48,286 INFO L273 TraceCheckUtils]: 48: Hoare triple {31632#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31632#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:48,286 INFO L273 TraceCheckUtils]: 49: Hoare triple {31632#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {31633#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:48,287 INFO L273 TraceCheckUtils]: 50: Hoare triple {31633#(<= main_~i~0 11)} assume true; {31633#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:48,287 INFO L273 TraceCheckUtils]: 51: Hoare triple {31633#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31633#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:48,288 INFO L273 TraceCheckUtils]: 52: Hoare triple {31633#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31633#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:48,288 INFO L273 TraceCheckUtils]: 53: Hoare triple {31633#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {31634#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:48,289 INFO L273 TraceCheckUtils]: 54: Hoare triple {31634#(<= main_~i~0 12)} assume true; {31634#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:48,289 INFO L273 TraceCheckUtils]: 55: Hoare triple {31634#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31634#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:48,290 INFO L273 TraceCheckUtils]: 56: Hoare triple {31634#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31634#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:48,291 INFO L273 TraceCheckUtils]: 57: Hoare triple {31634#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {31635#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:48,291 INFO L273 TraceCheckUtils]: 58: Hoare triple {31635#(<= main_~i~0 13)} assume true; {31635#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:48,292 INFO L273 TraceCheckUtils]: 59: Hoare triple {31635#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31635#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:48,292 INFO L273 TraceCheckUtils]: 60: Hoare triple {31635#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31635#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:48,293 INFO L273 TraceCheckUtils]: 61: Hoare triple {31635#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {31636#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:48,293 INFO L273 TraceCheckUtils]: 62: Hoare triple {31636#(<= main_~i~0 14)} assume true; {31636#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:48,294 INFO L273 TraceCheckUtils]: 63: Hoare triple {31636#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31636#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:48,294 INFO L273 TraceCheckUtils]: 64: Hoare triple {31636#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31636#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:48,295 INFO L273 TraceCheckUtils]: 65: Hoare triple {31636#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {31637#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:48,296 INFO L273 TraceCheckUtils]: 66: Hoare triple {31637#(<= main_~i~0 15)} assume true; {31637#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:48,296 INFO L273 TraceCheckUtils]: 67: Hoare triple {31637#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31637#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:48,297 INFO L273 TraceCheckUtils]: 68: Hoare triple {31637#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31637#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:48,297 INFO L273 TraceCheckUtils]: 69: Hoare triple {31637#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {31638#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:48,298 INFO L273 TraceCheckUtils]: 70: Hoare triple {31638#(<= main_~i~0 16)} assume true; {31638#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:48,298 INFO L273 TraceCheckUtils]: 71: Hoare triple {31638#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31638#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:48,299 INFO L273 TraceCheckUtils]: 72: Hoare triple {31638#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31638#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:48,299 INFO L273 TraceCheckUtils]: 73: Hoare triple {31638#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {31639#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:48,300 INFO L273 TraceCheckUtils]: 74: Hoare triple {31639#(<= main_~i~0 17)} assume true; {31639#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:48,300 INFO L273 TraceCheckUtils]: 75: Hoare triple {31639#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31639#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:48,301 INFO L273 TraceCheckUtils]: 76: Hoare triple {31639#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31639#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:48,302 INFO L273 TraceCheckUtils]: 77: Hoare triple {31639#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {31640#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:48,302 INFO L273 TraceCheckUtils]: 78: Hoare triple {31640#(<= main_~i~0 18)} assume true; {31640#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:48,303 INFO L273 TraceCheckUtils]: 79: Hoare triple {31640#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31640#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:48,303 INFO L273 TraceCheckUtils]: 80: Hoare triple {31640#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31640#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:48,304 INFO L273 TraceCheckUtils]: 81: Hoare triple {31640#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {31641#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:48,304 INFO L273 TraceCheckUtils]: 82: Hoare triple {31641#(<= main_~i~0 19)} assume true; {31641#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:48,305 INFO L273 TraceCheckUtils]: 83: Hoare triple {31641#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31641#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:48,305 INFO L273 TraceCheckUtils]: 84: Hoare triple {31641#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31641#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:48,306 INFO L273 TraceCheckUtils]: 85: Hoare triple {31641#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {31642#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:48,307 INFO L273 TraceCheckUtils]: 86: Hoare triple {31642#(<= main_~i~0 20)} assume true; {31642#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:48,307 INFO L273 TraceCheckUtils]: 87: Hoare triple {31642#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31642#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:48,308 INFO L273 TraceCheckUtils]: 88: Hoare triple {31642#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31642#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:48,308 INFO L273 TraceCheckUtils]: 89: Hoare triple {31642#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {31643#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:48,309 INFO L273 TraceCheckUtils]: 90: Hoare triple {31643#(<= main_~i~0 21)} assume true; {31643#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:48,309 INFO L273 TraceCheckUtils]: 91: Hoare triple {31643#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31643#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:48,310 INFO L273 TraceCheckUtils]: 92: Hoare triple {31643#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31643#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:48,310 INFO L273 TraceCheckUtils]: 93: Hoare triple {31643#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {31644#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:48,311 INFO L273 TraceCheckUtils]: 94: Hoare triple {31644#(<= main_~i~0 22)} assume true; {31644#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:48,311 INFO L273 TraceCheckUtils]: 95: Hoare triple {31644#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31644#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:48,312 INFO L273 TraceCheckUtils]: 96: Hoare triple {31644#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31644#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:48,313 INFO L273 TraceCheckUtils]: 97: Hoare triple {31644#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {31645#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:48,313 INFO L273 TraceCheckUtils]: 98: Hoare triple {31645#(<= main_~i~0 23)} assume true; {31645#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:48,314 INFO L273 TraceCheckUtils]: 99: Hoare triple {31645#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31645#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:48,314 INFO L273 TraceCheckUtils]: 100: Hoare triple {31645#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31645#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:48,315 INFO L273 TraceCheckUtils]: 101: Hoare triple {31645#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {31646#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:48,315 INFO L273 TraceCheckUtils]: 102: Hoare triple {31646#(<= main_~i~0 24)} assume true; {31646#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:48,316 INFO L273 TraceCheckUtils]: 103: Hoare triple {31646#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31646#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:48,316 INFO L273 TraceCheckUtils]: 104: Hoare triple {31646#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31646#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:48,317 INFO L273 TraceCheckUtils]: 105: Hoare triple {31646#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {31647#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:48,318 INFO L273 TraceCheckUtils]: 106: Hoare triple {31647#(<= main_~i~0 25)} assume true; {31647#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:48,318 INFO L273 TraceCheckUtils]: 107: Hoare triple {31647#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31647#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:48,319 INFO L273 TraceCheckUtils]: 108: Hoare triple {31647#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31647#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:48,319 INFO L273 TraceCheckUtils]: 109: Hoare triple {31647#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {31648#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:48,320 INFO L273 TraceCheckUtils]: 110: Hoare triple {31648#(<= main_~i~0 26)} assume true; {31648#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:48,320 INFO L273 TraceCheckUtils]: 111: Hoare triple {31648#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31648#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:48,321 INFO L273 TraceCheckUtils]: 112: Hoare triple {31648#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31648#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:48,321 INFO L273 TraceCheckUtils]: 113: Hoare triple {31648#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {31649#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:48,322 INFO L273 TraceCheckUtils]: 114: Hoare triple {31649#(<= main_~i~0 27)} assume true; {31649#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:48,322 INFO L273 TraceCheckUtils]: 115: Hoare triple {31649#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31649#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:48,323 INFO L273 TraceCheckUtils]: 116: Hoare triple {31649#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31649#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:48,324 INFO L273 TraceCheckUtils]: 117: Hoare triple {31649#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {31650#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:48,324 INFO L273 TraceCheckUtils]: 118: Hoare triple {31650#(<= main_~i~0 28)} assume true; {31650#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:48,325 INFO L273 TraceCheckUtils]: 119: Hoare triple {31650#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31650#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:48,325 INFO L273 TraceCheckUtils]: 120: Hoare triple {31650#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31650#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:48,326 INFO L273 TraceCheckUtils]: 121: Hoare triple {31650#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {31651#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:48,326 INFO L273 TraceCheckUtils]: 122: Hoare triple {31651#(<= main_~i~0 29)} assume true; {31651#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:48,327 INFO L273 TraceCheckUtils]: 123: Hoare triple {31651#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31651#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:48,327 INFO L273 TraceCheckUtils]: 124: Hoare triple {31651#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31651#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:48,328 INFO L273 TraceCheckUtils]: 125: Hoare triple {31651#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {31652#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:48,329 INFO L273 TraceCheckUtils]: 126: Hoare triple {31652#(<= main_~i~0 30)} assume true; {31652#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:48,329 INFO L273 TraceCheckUtils]: 127: Hoare triple {31652#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31652#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:48,330 INFO L273 TraceCheckUtils]: 128: Hoare triple {31652#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31652#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:48,330 INFO L273 TraceCheckUtils]: 129: Hoare triple {31652#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {31653#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:48,331 INFO L273 TraceCheckUtils]: 130: Hoare triple {31653#(<= main_~i~0 31)} assume true; {31653#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:48,331 INFO L273 TraceCheckUtils]: 131: Hoare triple {31653#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31653#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:48,332 INFO L273 TraceCheckUtils]: 132: Hoare triple {31653#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31653#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:48,332 INFO L273 TraceCheckUtils]: 133: Hoare triple {31653#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {31654#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:48,333 INFO L273 TraceCheckUtils]: 134: Hoare triple {31654#(<= main_~i~0 32)} assume true; {31654#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:48,333 INFO L273 TraceCheckUtils]: 135: Hoare triple {31654#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31654#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:48,334 INFO L273 TraceCheckUtils]: 136: Hoare triple {31654#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31654#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:48,335 INFO L273 TraceCheckUtils]: 137: Hoare triple {31654#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {31655#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:48,335 INFO L273 TraceCheckUtils]: 138: Hoare triple {31655#(<= main_~i~0 33)} assume true; {31655#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:48,336 INFO L273 TraceCheckUtils]: 139: Hoare triple {31655#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31655#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:48,336 INFO L273 TraceCheckUtils]: 140: Hoare triple {31655#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31655#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:48,337 INFO L273 TraceCheckUtils]: 141: Hoare triple {31655#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {31656#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:48,337 INFO L273 TraceCheckUtils]: 142: Hoare triple {31656#(<= main_~i~0 34)} assume true; {31656#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:48,338 INFO L273 TraceCheckUtils]: 143: Hoare triple {31656#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31656#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:48,338 INFO L273 TraceCheckUtils]: 144: Hoare triple {31656#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31656#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:48,339 INFO L273 TraceCheckUtils]: 145: Hoare triple {31656#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {31657#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:48,339 INFO L273 TraceCheckUtils]: 146: Hoare triple {31657#(<= main_~i~0 35)} assume true; {31657#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:48,340 INFO L273 TraceCheckUtils]: 147: Hoare triple {31657#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31657#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:48,340 INFO L273 TraceCheckUtils]: 148: Hoare triple {31657#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31657#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:48,341 INFO L273 TraceCheckUtils]: 149: Hoare triple {31657#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {31658#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:48,342 INFO L273 TraceCheckUtils]: 150: Hoare triple {31658#(<= main_~i~0 36)} assume true; {31658#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:48,342 INFO L273 TraceCheckUtils]: 151: Hoare triple {31658#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31658#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:48,343 INFO L273 TraceCheckUtils]: 152: Hoare triple {31658#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31658#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:48,343 INFO L273 TraceCheckUtils]: 153: Hoare triple {31658#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {31659#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:48,344 INFO L273 TraceCheckUtils]: 154: Hoare triple {31659#(<= main_~i~0 37)} assume true; {31659#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:48,344 INFO L273 TraceCheckUtils]: 155: Hoare triple {31659#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31659#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:48,345 INFO L273 TraceCheckUtils]: 156: Hoare triple {31659#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31659#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:48,346 INFO L273 TraceCheckUtils]: 157: Hoare triple {31659#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {31660#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:48,346 INFO L273 TraceCheckUtils]: 158: Hoare triple {31660#(<= main_~i~0 38)} assume true; {31660#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:48,347 INFO L273 TraceCheckUtils]: 159: Hoare triple {31660#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31660#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:48,347 INFO L273 TraceCheckUtils]: 160: Hoare triple {31660#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31660#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:48,348 INFO L273 TraceCheckUtils]: 161: Hoare triple {31660#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {31661#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:48,348 INFO L273 TraceCheckUtils]: 162: Hoare triple {31661#(<= main_~i~0 39)} assume true; {31661#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:48,349 INFO L273 TraceCheckUtils]: 163: Hoare triple {31661#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31661#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:48,349 INFO L273 TraceCheckUtils]: 164: Hoare triple {31661#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31661#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:48,350 INFO L273 TraceCheckUtils]: 165: Hoare triple {31661#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {31662#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:48,350 INFO L273 TraceCheckUtils]: 166: Hoare triple {31662#(<= main_~i~0 40)} assume true; {31662#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:48,351 INFO L273 TraceCheckUtils]: 167: Hoare triple {31662#(<= main_~i~0 40)} assume !(~i~0 < 100000); {31621#false} is VALID [2018-11-18 22:57:48,351 INFO L273 TraceCheckUtils]: 168: Hoare triple {31621#false} havoc ~x~0;~x~0 := 0; {31621#false} is VALID [2018-11-18 22:57:48,352 INFO L273 TraceCheckUtils]: 169: Hoare triple {31621#false} assume true; {31621#false} is VALID [2018-11-18 22:57:48,352 INFO L273 TraceCheckUtils]: 170: Hoare triple {31621#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {31621#false} is VALID [2018-11-18 22:57:48,352 INFO L256 TraceCheckUtils]: 171: Hoare triple {31621#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {31621#false} is VALID [2018-11-18 22:57:48,352 INFO L273 TraceCheckUtils]: 172: Hoare triple {31621#false} ~cond := #in~cond; {31621#false} is VALID [2018-11-18 22:57:48,352 INFO L273 TraceCheckUtils]: 173: Hoare triple {31621#false} assume 0 == ~cond; {31621#false} is VALID [2018-11-18 22:57:48,352 INFO L273 TraceCheckUtils]: 174: Hoare triple {31621#false} assume !false; {31621#false} is VALID [2018-11-18 22:57:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:48,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:48,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-18 22:57:48,394 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 175 [2018-11-18 22:57:48,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:48,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-18 22:57:48,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:48,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-18 22:57:48,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-18 22:57:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 22:57:48,563 INFO L87 Difference]: Start difference. First operand 180 states and 221 transitions. Second operand 44 states. [2018-11-18 22:57:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:49,516 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2018-11-18 22:57:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-18 22:57:49,516 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 175 [2018-11-18 22:57:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:57:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 242 transitions. [2018-11-18 22:57:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:57:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 242 transitions. [2018-11-18 22:57:49,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 242 transitions. [2018-11-18 22:57:49,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:49,794 INFO L225 Difference]: With dead ends: 198 [2018-11-18 22:57:49,794 INFO L226 Difference]: Without dead ends: 186 [2018-11-18 22:57:49,795 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 22:57:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-18 22:57:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-18 22:57:49,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:49,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 184 states. [2018-11-18 22:57:49,831 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 184 states. [2018-11-18 22:57:49,831 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 184 states. [2018-11-18 22:57:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:49,834 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2018-11-18 22:57:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 229 transitions. [2018-11-18 22:57:49,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:49,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:49,835 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 186 states. [2018-11-18 22:57:49,835 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 186 states. [2018-11-18 22:57:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:49,838 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2018-11-18 22:57:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 229 transitions. [2018-11-18 22:57:49,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:49,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:49,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:49,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-18 22:57:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 226 transitions. [2018-11-18 22:57:49,842 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 226 transitions. Word has length 175 [2018-11-18 22:57:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:49,842 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 226 transitions. [2018-11-18 22:57:49,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-18 22:57:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 226 transitions. [2018-11-18 22:57:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 22:57:49,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:49,844 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:49,844 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:49,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:49,844 INFO L82 PathProgramCache]: Analyzing trace with hash 266190920, now seen corresponding path program 41 times [2018-11-18 22:57:49,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:49,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:49,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:49,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:49,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:50,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {33043#true} call ULTIMATE.init(); {33043#true} is VALID [2018-11-18 22:57:50,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {33043#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33043#true} is VALID [2018-11-18 22:57:50,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {33043#true} assume true; {33043#true} is VALID [2018-11-18 22:57:50,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33043#true} {33043#true} #57#return; {33043#true} is VALID [2018-11-18 22:57:50,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {33043#true} call #t~ret4 := main(); {33043#true} is VALID [2018-11-18 22:57:50,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {33043#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {33045#(= main_~i~0 0)} is VALID [2018-11-18 22:57:50,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {33045#(= main_~i~0 0)} assume true; {33045#(= main_~i~0 0)} is VALID [2018-11-18 22:57:50,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {33045#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33045#(= main_~i~0 0)} is VALID [2018-11-18 22:57:50,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {33045#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33045#(= main_~i~0 0)} is VALID [2018-11-18 22:57:50,838 INFO L273 TraceCheckUtils]: 9: Hoare triple {33045#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {33046#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:50,838 INFO L273 TraceCheckUtils]: 10: Hoare triple {33046#(<= main_~i~0 1)} assume true; {33046#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:50,839 INFO L273 TraceCheckUtils]: 11: Hoare triple {33046#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33046#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:50,839 INFO L273 TraceCheckUtils]: 12: Hoare triple {33046#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33046#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:50,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {33046#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {33047#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:50,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {33047#(<= main_~i~0 2)} assume true; {33047#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:50,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {33047#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33047#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:50,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {33047#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33047#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:50,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {33047#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {33048#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:50,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {33048#(<= main_~i~0 3)} assume true; {33048#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:50,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {33048#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33048#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:50,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {33048#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33048#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:50,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {33048#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {33049#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:50,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {33049#(<= main_~i~0 4)} assume true; {33049#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:50,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {33049#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33049#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:50,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {33049#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33049#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:50,845 INFO L273 TraceCheckUtils]: 25: Hoare triple {33049#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {33050#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:50,846 INFO L273 TraceCheckUtils]: 26: Hoare triple {33050#(<= main_~i~0 5)} assume true; {33050#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:50,846 INFO L273 TraceCheckUtils]: 27: Hoare triple {33050#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33050#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:50,847 INFO L273 TraceCheckUtils]: 28: Hoare triple {33050#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33050#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:50,847 INFO L273 TraceCheckUtils]: 29: Hoare triple {33050#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {33051#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:50,848 INFO L273 TraceCheckUtils]: 30: Hoare triple {33051#(<= main_~i~0 6)} assume true; {33051#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:50,848 INFO L273 TraceCheckUtils]: 31: Hoare triple {33051#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33051#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:50,849 INFO L273 TraceCheckUtils]: 32: Hoare triple {33051#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33051#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:50,850 INFO L273 TraceCheckUtils]: 33: Hoare triple {33051#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {33052#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:50,850 INFO L273 TraceCheckUtils]: 34: Hoare triple {33052#(<= main_~i~0 7)} assume true; {33052#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:50,851 INFO L273 TraceCheckUtils]: 35: Hoare triple {33052#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33052#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:50,851 INFO L273 TraceCheckUtils]: 36: Hoare triple {33052#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33052#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:50,852 INFO L273 TraceCheckUtils]: 37: Hoare triple {33052#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {33053#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:50,852 INFO L273 TraceCheckUtils]: 38: Hoare triple {33053#(<= main_~i~0 8)} assume true; {33053#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:50,853 INFO L273 TraceCheckUtils]: 39: Hoare triple {33053#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33053#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:50,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {33053#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33053#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:50,854 INFO L273 TraceCheckUtils]: 41: Hoare triple {33053#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {33054#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:50,855 INFO L273 TraceCheckUtils]: 42: Hoare triple {33054#(<= main_~i~0 9)} assume true; {33054#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:50,855 INFO L273 TraceCheckUtils]: 43: Hoare triple {33054#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33054#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:50,856 INFO L273 TraceCheckUtils]: 44: Hoare triple {33054#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33054#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:50,856 INFO L273 TraceCheckUtils]: 45: Hoare triple {33054#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {33055#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:50,857 INFO L273 TraceCheckUtils]: 46: Hoare triple {33055#(<= main_~i~0 10)} assume true; {33055#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:50,857 INFO L273 TraceCheckUtils]: 47: Hoare triple {33055#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33055#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:50,858 INFO L273 TraceCheckUtils]: 48: Hoare triple {33055#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33055#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:50,858 INFO L273 TraceCheckUtils]: 49: Hoare triple {33055#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {33056#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:50,859 INFO L273 TraceCheckUtils]: 50: Hoare triple {33056#(<= main_~i~0 11)} assume true; {33056#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:50,859 INFO L273 TraceCheckUtils]: 51: Hoare triple {33056#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33056#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:50,860 INFO L273 TraceCheckUtils]: 52: Hoare triple {33056#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33056#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:50,861 INFO L273 TraceCheckUtils]: 53: Hoare triple {33056#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {33057#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:50,861 INFO L273 TraceCheckUtils]: 54: Hoare triple {33057#(<= main_~i~0 12)} assume true; {33057#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:50,862 INFO L273 TraceCheckUtils]: 55: Hoare triple {33057#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33057#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:50,862 INFO L273 TraceCheckUtils]: 56: Hoare triple {33057#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33057#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:50,863 INFO L273 TraceCheckUtils]: 57: Hoare triple {33057#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {33058#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:50,863 INFO L273 TraceCheckUtils]: 58: Hoare triple {33058#(<= main_~i~0 13)} assume true; {33058#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:50,864 INFO L273 TraceCheckUtils]: 59: Hoare triple {33058#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33058#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:50,864 INFO L273 TraceCheckUtils]: 60: Hoare triple {33058#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33058#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:50,865 INFO L273 TraceCheckUtils]: 61: Hoare triple {33058#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {33059#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:50,866 INFO L273 TraceCheckUtils]: 62: Hoare triple {33059#(<= main_~i~0 14)} assume true; {33059#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:50,866 INFO L273 TraceCheckUtils]: 63: Hoare triple {33059#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33059#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:50,867 INFO L273 TraceCheckUtils]: 64: Hoare triple {33059#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33059#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:50,867 INFO L273 TraceCheckUtils]: 65: Hoare triple {33059#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {33060#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:50,868 INFO L273 TraceCheckUtils]: 66: Hoare triple {33060#(<= main_~i~0 15)} assume true; {33060#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:50,868 INFO L273 TraceCheckUtils]: 67: Hoare triple {33060#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33060#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:50,869 INFO L273 TraceCheckUtils]: 68: Hoare triple {33060#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33060#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:50,870 INFO L273 TraceCheckUtils]: 69: Hoare triple {33060#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {33061#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:50,870 INFO L273 TraceCheckUtils]: 70: Hoare triple {33061#(<= main_~i~0 16)} assume true; {33061#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:50,871 INFO L273 TraceCheckUtils]: 71: Hoare triple {33061#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33061#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:50,871 INFO L273 TraceCheckUtils]: 72: Hoare triple {33061#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33061#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:50,872 INFO L273 TraceCheckUtils]: 73: Hoare triple {33061#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {33062#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:50,872 INFO L273 TraceCheckUtils]: 74: Hoare triple {33062#(<= main_~i~0 17)} assume true; {33062#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:50,873 INFO L273 TraceCheckUtils]: 75: Hoare triple {33062#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33062#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:50,873 INFO L273 TraceCheckUtils]: 76: Hoare triple {33062#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33062#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:50,874 INFO L273 TraceCheckUtils]: 77: Hoare triple {33062#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {33063#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:50,874 INFO L273 TraceCheckUtils]: 78: Hoare triple {33063#(<= main_~i~0 18)} assume true; {33063#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:50,875 INFO L273 TraceCheckUtils]: 79: Hoare triple {33063#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33063#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:50,875 INFO L273 TraceCheckUtils]: 80: Hoare triple {33063#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33063#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:50,876 INFO L273 TraceCheckUtils]: 81: Hoare triple {33063#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {33064#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:50,877 INFO L273 TraceCheckUtils]: 82: Hoare triple {33064#(<= main_~i~0 19)} assume true; {33064#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:50,877 INFO L273 TraceCheckUtils]: 83: Hoare triple {33064#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33064#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:50,878 INFO L273 TraceCheckUtils]: 84: Hoare triple {33064#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33064#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:50,878 INFO L273 TraceCheckUtils]: 85: Hoare triple {33064#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {33065#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:50,879 INFO L273 TraceCheckUtils]: 86: Hoare triple {33065#(<= main_~i~0 20)} assume true; {33065#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:50,879 INFO L273 TraceCheckUtils]: 87: Hoare triple {33065#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33065#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:50,880 INFO L273 TraceCheckUtils]: 88: Hoare triple {33065#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33065#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:50,881 INFO L273 TraceCheckUtils]: 89: Hoare triple {33065#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {33066#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:50,881 INFO L273 TraceCheckUtils]: 90: Hoare triple {33066#(<= main_~i~0 21)} assume true; {33066#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:50,882 INFO L273 TraceCheckUtils]: 91: Hoare triple {33066#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33066#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:50,882 INFO L273 TraceCheckUtils]: 92: Hoare triple {33066#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33066#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:50,883 INFO L273 TraceCheckUtils]: 93: Hoare triple {33066#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {33067#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:50,883 INFO L273 TraceCheckUtils]: 94: Hoare triple {33067#(<= main_~i~0 22)} assume true; {33067#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:50,884 INFO L273 TraceCheckUtils]: 95: Hoare triple {33067#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33067#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:50,884 INFO L273 TraceCheckUtils]: 96: Hoare triple {33067#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33067#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:50,885 INFO L273 TraceCheckUtils]: 97: Hoare triple {33067#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {33068#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:50,885 INFO L273 TraceCheckUtils]: 98: Hoare triple {33068#(<= main_~i~0 23)} assume true; {33068#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:50,886 INFO L273 TraceCheckUtils]: 99: Hoare triple {33068#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33068#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:50,886 INFO L273 TraceCheckUtils]: 100: Hoare triple {33068#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33068#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:50,887 INFO L273 TraceCheckUtils]: 101: Hoare triple {33068#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {33069#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:50,888 INFO L273 TraceCheckUtils]: 102: Hoare triple {33069#(<= main_~i~0 24)} assume true; {33069#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:50,888 INFO L273 TraceCheckUtils]: 103: Hoare triple {33069#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33069#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:50,889 INFO L273 TraceCheckUtils]: 104: Hoare triple {33069#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33069#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:50,889 INFO L273 TraceCheckUtils]: 105: Hoare triple {33069#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {33070#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:50,890 INFO L273 TraceCheckUtils]: 106: Hoare triple {33070#(<= main_~i~0 25)} assume true; {33070#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:50,890 INFO L273 TraceCheckUtils]: 107: Hoare triple {33070#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33070#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:50,891 INFO L273 TraceCheckUtils]: 108: Hoare triple {33070#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33070#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:50,892 INFO L273 TraceCheckUtils]: 109: Hoare triple {33070#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {33071#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:50,892 INFO L273 TraceCheckUtils]: 110: Hoare triple {33071#(<= main_~i~0 26)} assume true; {33071#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:50,893 INFO L273 TraceCheckUtils]: 111: Hoare triple {33071#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33071#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:50,893 INFO L273 TraceCheckUtils]: 112: Hoare triple {33071#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33071#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:50,894 INFO L273 TraceCheckUtils]: 113: Hoare triple {33071#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {33072#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:50,894 INFO L273 TraceCheckUtils]: 114: Hoare triple {33072#(<= main_~i~0 27)} assume true; {33072#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:50,895 INFO L273 TraceCheckUtils]: 115: Hoare triple {33072#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33072#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:50,895 INFO L273 TraceCheckUtils]: 116: Hoare triple {33072#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33072#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:50,896 INFO L273 TraceCheckUtils]: 117: Hoare triple {33072#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {33073#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:50,897 INFO L273 TraceCheckUtils]: 118: Hoare triple {33073#(<= main_~i~0 28)} assume true; {33073#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:50,897 INFO L273 TraceCheckUtils]: 119: Hoare triple {33073#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33073#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:50,898 INFO L273 TraceCheckUtils]: 120: Hoare triple {33073#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33073#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:50,898 INFO L273 TraceCheckUtils]: 121: Hoare triple {33073#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {33074#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:50,899 INFO L273 TraceCheckUtils]: 122: Hoare triple {33074#(<= main_~i~0 29)} assume true; {33074#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:50,899 INFO L273 TraceCheckUtils]: 123: Hoare triple {33074#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33074#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:50,900 INFO L273 TraceCheckUtils]: 124: Hoare triple {33074#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33074#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:50,901 INFO L273 TraceCheckUtils]: 125: Hoare triple {33074#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {33075#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:50,901 INFO L273 TraceCheckUtils]: 126: Hoare triple {33075#(<= main_~i~0 30)} assume true; {33075#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:50,902 INFO L273 TraceCheckUtils]: 127: Hoare triple {33075#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33075#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:50,902 INFO L273 TraceCheckUtils]: 128: Hoare triple {33075#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33075#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:50,903 INFO L273 TraceCheckUtils]: 129: Hoare triple {33075#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {33076#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:50,903 INFO L273 TraceCheckUtils]: 130: Hoare triple {33076#(<= main_~i~0 31)} assume true; {33076#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:50,904 INFO L273 TraceCheckUtils]: 131: Hoare triple {33076#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33076#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:50,904 INFO L273 TraceCheckUtils]: 132: Hoare triple {33076#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33076#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:50,905 INFO L273 TraceCheckUtils]: 133: Hoare triple {33076#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {33077#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:50,905 INFO L273 TraceCheckUtils]: 134: Hoare triple {33077#(<= main_~i~0 32)} assume true; {33077#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:50,906 INFO L273 TraceCheckUtils]: 135: Hoare triple {33077#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33077#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:50,906 INFO L273 TraceCheckUtils]: 136: Hoare triple {33077#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33077#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:50,907 INFO L273 TraceCheckUtils]: 137: Hoare triple {33077#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {33078#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:50,908 INFO L273 TraceCheckUtils]: 138: Hoare triple {33078#(<= main_~i~0 33)} assume true; {33078#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:50,908 INFO L273 TraceCheckUtils]: 139: Hoare triple {33078#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33078#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:50,909 INFO L273 TraceCheckUtils]: 140: Hoare triple {33078#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33078#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:50,909 INFO L273 TraceCheckUtils]: 141: Hoare triple {33078#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {33079#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:50,910 INFO L273 TraceCheckUtils]: 142: Hoare triple {33079#(<= main_~i~0 34)} assume true; {33079#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:50,910 INFO L273 TraceCheckUtils]: 143: Hoare triple {33079#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33079#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:50,911 INFO L273 TraceCheckUtils]: 144: Hoare triple {33079#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33079#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:50,912 INFO L273 TraceCheckUtils]: 145: Hoare triple {33079#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {33080#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:50,912 INFO L273 TraceCheckUtils]: 146: Hoare triple {33080#(<= main_~i~0 35)} assume true; {33080#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:50,913 INFO L273 TraceCheckUtils]: 147: Hoare triple {33080#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33080#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:50,913 INFO L273 TraceCheckUtils]: 148: Hoare triple {33080#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33080#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:50,914 INFO L273 TraceCheckUtils]: 149: Hoare triple {33080#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {33081#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:50,914 INFO L273 TraceCheckUtils]: 150: Hoare triple {33081#(<= main_~i~0 36)} assume true; {33081#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:50,915 INFO L273 TraceCheckUtils]: 151: Hoare triple {33081#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33081#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:50,915 INFO L273 TraceCheckUtils]: 152: Hoare triple {33081#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33081#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:50,916 INFO L273 TraceCheckUtils]: 153: Hoare triple {33081#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {33082#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:50,916 INFO L273 TraceCheckUtils]: 154: Hoare triple {33082#(<= main_~i~0 37)} assume true; {33082#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:50,917 INFO L273 TraceCheckUtils]: 155: Hoare triple {33082#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33082#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:50,917 INFO L273 TraceCheckUtils]: 156: Hoare triple {33082#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33082#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:50,918 INFO L273 TraceCheckUtils]: 157: Hoare triple {33082#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {33083#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:50,919 INFO L273 TraceCheckUtils]: 158: Hoare triple {33083#(<= main_~i~0 38)} assume true; {33083#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:50,919 INFO L273 TraceCheckUtils]: 159: Hoare triple {33083#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33083#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:50,920 INFO L273 TraceCheckUtils]: 160: Hoare triple {33083#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33083#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:50,920 INFO L273 TraceCheckUtils]: 161: Hoare triple {33083#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {33084#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:50,921 INFO L273 TraceCheckUtils]: 162: Hoare triple {33084#(<= main_~i~0 39)} assume true; {33084#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:50,921 INFO L273 TraceCheckUtils]: 163: Hoare triple {33084#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33084#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:50,922 INFO L273 TraceCheckUtils]: 164: Hoare triple {33084#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33084#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:50,923 INFO L273 TraceCheckUtils]: 165: Hoare triple {33084#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {33085#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:50,923 INFO L273 TraceCheckUtils]: 166: Hoare triple {33085#(<= main_~i~0 40)} assume true; {33085#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:50,924 INFO L273 TraceCheckUtils]: 167: Hoare triple {33085#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33085#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:50,924 INFO L273 TraceCheckUtils]: 168: Hoare triple {33085#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33085#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:50,925 INFO L273 TraceCheckUtils]: 169: Hoare triple {33085#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {33086#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:50,925 INFO L273 TraceCheckUtils]: 170: Hoare triple {33086#(<= main_~i~0 41)} assume true; {33086#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:50,926 INFO L273 TraceCheckUtils]: 171: Hoare triple {33086#(<= main_~i~0 41)} assume !(~i~0 < 100000); {33044#false} is VALID [2018-11-18 22:57:50,926 INFO L273 TraceCheckUtils]: 172: Hoare triple {33044#false} havoc ~x~0;~x~0 := 0; {33044#false} is VALID [2018-11-18 22:57:50,926 INFO L273 TraceCheckUtils]: 173: Hoare triple {33044#false} assume true; {33044#false} is VALID [2018-11-18 22:57:50,927 INFO L273 TraceCheckUtils]: 174: Hoare triple {33044#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {33044#false} is VALID [2018-11-18 22:57:50,927 INFO L256 TraceCheckUtils]: 175: Hoare triple {33044#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {33044#false} is VALID [2018-11-18 22:57:50,927 INFO L273 TraceCheckUtils]: 176: Hoare triple {33044#false} ~cond := #in~cond; {33044#false} is VALID [2018-11-18 22:57:50,927 INFO L273 TraceCheckUtils]: 177: Hoare triple {33044#false} assume 0 == ~cond; {33044#false} is VALID [2018-11-18 22:57:50,927 INFO L273 TraceCheckUtils]: 178: Hoare triple {33044#false} assume !false; {33044#false} is VALID [2018-11-18 22:57:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:50,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:50,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:50,969 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:57:51,156 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-11-18 22:57:51,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:51,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:51,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {33043#true} call ULTIMATE.init(); {33043#true} is VALID [2018-11-18 22:57:51,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {33043#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33043#true} is VALID [2018-11-18 22:57:51,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {33043#true} assume true; {33043#true} is VALID [2018-11-18 22:57:51,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33043#true} {33043#true} #57#return; {33043#true} is VALID [2018-11-18 22:57:51,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {33043#true} call #t~ret4 := main(); {33043#true} is VALID [2018-11-18 22:57:51,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {33043#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {33105#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:51,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {33105#(<= main_~i~0 0)} assume true; {33105#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:51,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {33105#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33105#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:51,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {33105#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33105#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:51,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {33105#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {33046#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:51,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {33046#(<= main_~i~0 1)} assume true; {33046#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:51,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {33046#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33046#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:51,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {33046#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33046#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:51,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {33046#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {33047#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:51,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {33047#(<= main_~i~0 2)} assume true; {33047#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:51,514 INFO L273 TraceCheckUtils]: 15: Hoare triple {33047#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33047#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:51,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {33047#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33047#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:51,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {33047#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {33048#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:51,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {33048#(<= main_~i~0 3)} assume true; {33048#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:51,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {33048#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33048#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:51,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {33048#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33048#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:51,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {33048#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {33049#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:51,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {33049#(<= main_~i~0 4)} assume true; {33049#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:51,519 INFO L273 TraceCheckUtils]: 23: Hoare triple {33049#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33049#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:51,519 INFO L273 TraceCheckUtils]: 24: Hoare triple {33049#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33049#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:51,520 INFO L273 TraceCheckUtils]: 25: Hoare triple {33049#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {33050#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:51,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {33050#(<= main_~i~0 5)} assume true; {33050#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:51,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {33050#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33050#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:51,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {33050#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33050#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:51,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {33050#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {33051#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:51,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {33051#(<= main_~i~0 6)} assume true; {33051#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:51,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {33051#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33051#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:51,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {33051#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33051#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:51,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {33051#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {33052#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:51,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {33052#(<= main_~i~0 7)} assume true; {33052#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:51,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {33052#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33052#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:51,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {33052#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33052#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:51,527 INFO L273 TraceCheckUtils]: 37: Hoare triple {33052#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {33053#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:51,527 INFO L273 TraceCheckUtils]: 38: Hoare triple {33053#(<= main_~i~0 8)} assume true; {33053#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:51,528 INFO L273 TraceCheckUtils]: 39: Hoare triple {33053#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33053#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:51,528 INFO L273 TraceCheckUtils]: 40: Hoare triple {33053#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33053#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:51,529 INFO L273 TraceCheckUtils]: 41: Hoare triple {33053#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {33054#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:51,529 INFO L273 TraceCheckUtils]: 42: Hoare triple {33054#(<= main_~i~0 9)} assume true; {33054#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:51,530 INFO L273 TraceCheckUtils]: 43: Hoare triple {33054#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33054#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:51,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {33054#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33054#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:51,531 INFO L273 TraceCheckUtils]: 45: Hoare triple {33054#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {33055#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:51,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {33055#(<= main_~i~0 10)} assume true; {33055#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:51,532 INFO L273 TraceCheckUtils]: 47: Hoare triple {33055#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33055#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:51,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {33055#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33055#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:51,533 INFO L273 TraceCheckUtils]: 49: Hoare triple {33055#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {33056#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:51,534 INFO L273 TraceCheckUtils]: 50: Hoare triple {33056#(<= main_~i~0 11)} assume true; {33056#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:51,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {33056#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33056#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:51,535 INFO L273 TraceCheckUtils]: 52: Hoare triple {33056#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33056#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:51,536 INFO L273 TraceCheckUtils]: 53: Hoare triple {33056#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {33057#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:51,536 INFO L273 TraceCheckUtils]: 54: Hoare triple {33057#(<= main_~i~0 12)} assume true; {33057#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:51,537 INFO L273 TraceCheckUtils]: 55: Hoare triple {33057#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33057#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:51,537 INFO L273 TraceCheckUtils]: 56: Hoare triple {33057#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33057#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:51,538 INFO L273 TraceCheckUtils]: 57: Hoare triple {33057#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {33058#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:51,538 INFO L273 TraceCheckUtils]: 58: Hoare triple {33058#(<= main_~i~0 13)} assume true; {33058#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:51,539 INFO L273 TraceCheckUtils]: 59: Hoare triple {33058#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33058#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:51,539 INFO L273 TraceCheckUtils]: 60: Hoare triple {33058#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33058#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:51,540 INFO L273 TraceCheckUtils]: 61: Hoare triple {33058#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {33059#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:51,540 INFO L273 TraceCheckUtils]: 62: Hoare triple {33059#(<= main_~i~0 14)} assume true; {33059#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:51,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {33059#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33059#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:51,541 INFO L273 TraceCheckUtils]: 64: Hoare triple {33059#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33059#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:51,542 INFO L273 TraceCheckUtils]: 65: Hoare triple {33059#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {33060#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:51,543 INFO L273 TraceCheckUtils]: 66: Hoare triple {33060#(<= main_~i~0 15)} assume true; {33060#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:51,543 INFO L273 TraceCheckUtils]: 67: Hoare triple {33060#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33060#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:51,544 INFO L273 TraceCheckUtils]: 68: Hoare triple {33060#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33060#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:51,544 INFO L273 TraceCheckUtils]: 69: Hoare triple {33060#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {33061#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:51,545 INFO L273 TraceCheckUtils]: 70: Hoare triple {33061#(<= main_~i~0 16)} assume true; {33061#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:51,545 INFO L273 TraceCheckUtils]: 71: Hoare triple {33061#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33061#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:51,546 INFO L273 TraceCheckUtils]: 72: Hoare triple {33061#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33061#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:51,547 INFO L273 TraceCheckUtils]: 73: Hoare triple {33061#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {33062#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:51,547 INFO L273 TraceCheckUtils]: 74: Hoare triple {33062#(<= main_~i~0 17)} assume true; {33062#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:51,548 INFO L273 TraceCheckUtils]: 75: Hoare triple {33062#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33062#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:51,548 INFO L273 TraceCheckUtils]: 76: Hoare triple {33062#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33062#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:51,549 INFO L273 TraceCheckUtils]: 77: Hoare triple {33062#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {33063#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:51,549 INFO L273 TraceCheckUtils]: 78: Hoare triple {33063#(<= main_~i~0 18)} assume true; {33063#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:51,550 INFO L273 TraceCheckUtils]: 79: Hoare triple {33063#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33063#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:51,550 INFO L273 TraceCheckUtils]: 80: Hoare triple {33063#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33063#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:51,551 INFO L273 TraceCheckUtils]: 81: Hoare triple {33063#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {33064#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:51,552 INFO L273 TraceCheckUtils]: 82: Hoare triple {33064#(<= main_~i~0 19)} assume true; {33064#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:51,552 INFO L273 TraceCheckUtils]: 83: Hoare triple {33064#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33064#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:51,553 INFO L273 TraceCheckUtils]: 84: Hoare triple {33064#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33064#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:51,553 INFO L273 TraceCheckUtils]: 85: Hoare triple {33064#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {33065#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:51,554 INFO L273 TraceCheckUtils]: 86: Hoare triple {33065#(<= main_~i~0 20)} assume true; {33065#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:51,554 INFO L273 TraceCheckUtils]: 87: Hoare triple {33065#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33065#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:51,555 INFO L273 TraceCheckUtils]: 88: Hoare triple {33065#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33065#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:51,556 INFO L273 TraceCheckUtils]: 89: Hoare triple {33065#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {33066#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:51,556 INFO L273 TraceCheckUtils]: 90: Hoare triple {33066#(<= main_~i~0 21)} assume true; {33066#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:51,557 INFO L273 TraceCheckUtils]: 91: Hoare triple {33066#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33066#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:51,557 INFO L273 TraceCheckUtils]: 92: Hoare triple {33066#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33066#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:51,558 INFO L273 TraceCheckUtils]: 93: Hoare triple {33066#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {33067#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:51,558 INFO L273 TraceCheckUtils]: 94: Hoare triple {33067#(<= main_~i~0 22)} assume true; {33067#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:51,559 INFO L273 TraceCheckUtils]: 95: Hoare triple {33067#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33067#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:51,559 INFO L273 TraceCheckUtils]: 96: Hoare triple {33067#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33067#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:51,560 INFO L273 TraceCheckUtils]: 97: Hoare triple {33067#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {33068#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:51,561 INFO L273 TraceCheckUtils]: 98: Hoare triple {33068#(<= main_~i~0 23)} assume true; {33068#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:51,561 INFO L273 TraceCheckUtils]: 99: Hoare triple {33068#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33068#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:51,562 INFO L273 TraceCheckUtils]: 100: Hoare triple {33068#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33068#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:51,562 INFO L273 TraceCheckUtils]: 101: Hoare triple {33068#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {33069#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:51,563 INFO L273 TraceCheckUtils]: 102: Hoare triple {33069#(<= main_~i~0 24)} assume true; {33069#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:51,563 INFO L273 TraceCheckUtils]: 103: Hoare triple {33069#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33069#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:51,564 INFO L273 TraceCheckUtils]: 104: Hoare triple {33069#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33069#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:51,564 INFO L273 TraceCheckUtils]: 105: Hoare triple {33069#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {33070#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:51,565 INFO L273 TraceCheckUtils]: 106: Hoare triple {33070#(<= main_~i~0 25)} assume true; {33070#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:51,565 INFO L273 TraceCheckUtils]: 107: Hoare triple {33070#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33070#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:51,566 INFO L273 TraceCheckUtils]: 108: Hoare triple {33070#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33070#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:51,567 INFO L273 TraceCheckUtils]: 109: Hoare triple {33070#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {33071#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:51,567 INFO L273 TraceCheckUtils]: 110: Hoare triple {33071#(<= main_~i~0 26)} assume true; {33071#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:51,568 INFO L273 TraceCheckUtils]: 111: Hoare triple {33071#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33071#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:51,568 INFO L273 TraceCheckUtils]: 112: Hoare triple {33071#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33071#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:51,569 INFO L273 TraceCheckUtils]: 113: Hoare triple {33071#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {33072#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:51,569 INFO L273 TraceCheckUtils]: 114: Hoare triple {33072#(<= main_~i~0 27)} assume true; {33072#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:51,570 INFO L273 TraceCheckUtils]: 115: Hoare triple {33072#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33072#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:51,570 INFO L273 TraceCheckUtils]: 116: Hoare triple {33072#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33072#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:51,571 INFO L273 TraceCheckUtils]: 117: Hoare triple {33072#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {33073#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:51,572 INFO L273 TraceCheckUtils]: 118: Hoare triple {33073#(<= main_~i~0 28)} assume true; {33073#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:51,572 INFO L273 TraceCheckUtils]: 119: Hoare triple {33073#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33073#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:51,573 INFO L273 TraceCheckUtils]: 120: Hoare triple {33073#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33073#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:51,573 INFO L273 TraceCheckUtils]: 121: Hoare triple {33073#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {33074#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:51,574 INFO L273 TraceCheckUtils]: 122: Hoare triple {33074#(<= main_~i~0 29)} assume true; {33074#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:51,574 INFO L273 TraceCheckUtils]: 123: Hoare triple {33074#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33074#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:51,575 INFO L273 TraceCheckUtils]: 124: Hoare triple {33074#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33074#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:51,576 INFO L273 TraceCheckUtils]: 125: Hoare triple {33074#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {33075#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:51,576 INFO L273 TraceCheckUtils]: 126: Hoare triple {33075#(<= main_~i~0 30)} assume true; {33075#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:51,577 INFO L273 TraceCheckUtils]: 127: Hoare triple {33075#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33075#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:51,577 INFO L273 TraceCheckUtils]: 128: Hoare triple {33075#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33075#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:51,578 INFO L273 TraceCheckUtils]: 129: Hoare triple {33075#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {33076#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:51,578 INFO L273 TraceCheckUtils]: 130: Hoare triple {33076#(<= main_~i~0 31)} assume true; {33076#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:51,579 INFO L273 TraceCheckUtils]: 131: Hoare triple {33076#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33076#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:51,579 INFO L273 TraceCheckUtils]: 132: Hoare triple {33076#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33076#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:51,580 INFO L273 TraceCheckUtils]: 133: Hoare triple {33076#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {33077#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:51,580 INFO L273 TraceCheckUtils]: 134: Hoare triple {33077#(<= main_~i~0 32)} assume true; {33077#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:51,581 INFO L273 TraceCheckUtils]: 135: Hoare triple {33077#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33077#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:51,581 INFO L273 TraceCheckUtils]: 136: Hoare triple {33077#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33077#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:51,582 INFO L273 TraceCheckUtils]: 137: Hoare triple {33077#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {33078#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:51,583 INFO L273 TraceCheckUtils]: 138: Hoare triple {33078#(<= main_~i~0 33)} assume true; {33078#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:51,583 INFO L273 TraceCheckUtils]: 139: Hoare triple {33078#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33078#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:51,584 INFO L273 TraceCheckUtils]: 140: Hoare triple {33078#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33078#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:51,584 INFO L273 TraceCheckUtils]: 141: Hoare triple {33078#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {33079#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:51,585 INFO L273 TraceCheckUtils]: 142: Hoare triple {33079#(<= main_~i~0 34)} assume true; {33079#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:51,585 INFO L273 TraceCheckUtils]: 143: Hoare triple {33079#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33079#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:51,586 INFO L273 TraceCheckUtils]: 144: Hoare triple {33079#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33079#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:51,587 INFO L273 TraceCheckUtils]: 145: Hoare triple {33079#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {33080#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:51,587 INFO L273 TraceCheckUtils]: 146: Hoare triple {33080#(<= main_~i~0 35)} assume true; {33080#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:51,588 INFO L273 TraceCheckUtils]: 147: Hoare triple {33080#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33080#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:51,588 INFO L273 TraceCheckUtils]: 148: Hoare triple {33080#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33080#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:51,589 INFO L273 TraceCheckUtils]: 149: Hoare triple {33080#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {33081#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:51,589 INFO L273 TraceCheckUtils]: 150: Hoare triple {33081#(<= main_~i~0 36)} assume true; {33081#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:51,590 INFO L273 TraceCheckUtils]: 151: Hoare triple {33081#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33081#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:51,590 INFO L273 TraceCheckUtils]: 152: Hoare triple {33081#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33081#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:51,591 INFO L273 TraceCheckUtils]: 153: Hoare triple {33081#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {33082#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:51,592 INFO L273 TraceCheckUtils]: 154: Hoare triple {33082#(<= main_~i~0 37)} assume true; {33082#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:51,592 INFO L273 TraceCheckUtils]: 155: Hoare triple {33082#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33082#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:51,593 INFO L273 TraceCheckUtils]: 156: Hoare triple {33082#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33082#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:51,593 INFO L273 TraceCheckUtils]: 157: Hoare triple {33082#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {33083#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:51,594 INFO L273 TraceCheckUtils]: 158: Hoare triple {33083#(<= main_~i~0 38)} assume true; {33083#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:51,594 INFO L273 TraceCheckUtils]: 159: Hoare triple {33083#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33083#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:51,595 INFO L273 TraceCheckUtils]: 160: Hoare triple {33083#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33083#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:51,595 INFO L273 TraceCheckUtils]: 161: Hoare triple {33083#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {33084#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:51,596 INFO L273 TraceCheckUtils]: 162: Hoare triple {33084#(<= main_~i~0 39)} assume true; {33084#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:51,596 INFO L273 TraceCheckUtils]: 163: Hoare triple {33084#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33084#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:51,597 INFO L273 TraceCheckUtils]: 164: Hoare triple {33084#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33084#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:51,598 INFO L273 TraceCheckUtils]: 165: Hoare triple {33084#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {33085#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:51,598 INFO L273 TraceCheckUtils]: 166: Hoare triple {33085#(<= main_~i~0 40)} assume true; {33085#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:51,599 INFO L273 TraceCheckUtils]: 167: Hoare triple {33085#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33085#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:51,599 INFO L273 TraceCheckUtils]: 168: Hoare triple {33085#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33085#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:51,600 INFO L273 TraceCheckUtils]: 169: Hoare triple {33085#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {33086#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:51,600 INFO L273 TraceCheckUtils]: 170: Hoare triple {33086#(<= main_~i~0 41)} assume true; {33086#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:51,601 INFO L273 TraceCheckUtils]: 171: Hoare triple {33086#(<= main_~i~0 41)} assume !(~i~0 < 100000); {33044#false} is VALID [2018-11-18 22:57:51,601 INFO L273 TraceCheckUtils]: 172: Hoare triple {33044#false} havoc ~x~0;~x~0 := 0; {33044#false} is VALID [2018-11-18 22:57:51,601 INFO L273 TraceCheckUtils]: 173: Hoare triple {33044#false} assume true; {33044#false} is VALID [2018-11-18 22:57:51,602 INFO L273 TraceCheckUtils]: 174: Hoare triple {33044#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {33044#false} is VALID [2018-11-18 22:57:51,602 INFO L256 TraceCheckUtils]: 175: Hoare triple {33044#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {33044#false} is VALID [2018-11-18 22:57:51,602 INFO L273 TraceCheckUtils]: 176: Hoare triple {33044#false} ~cond := #in~cond; {33044#false} is VALID [2018-11-18 22:57:51,602 INFO L273 TraceCheckUtils]: 177: Hoare triple {33044#false} assume 0 == ~cond; {33044#false} is VALID [2018-11-18 22:57:51,602 INFO L273 TraceCheckUtils]: 178: Hoare triple {33044#false} assume !false; {33044#false} is VALID [2018-11-18 22:57:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:51,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:51,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-18 22:57:51,647 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 179 [2018-11-18 22:57:51,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:51,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-18 22:57:51,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:51,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-18 22:57:51,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-18 22:57:51,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 22:57:51,860 INFO L87 Difference]: Start difference. First operand 184 states and 226 transitions. Second operand 45 states. [2018-11-18 22:57:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:53,025 INFO L93 Difference]: Finished difference Result 202 states and 247 transitions. [2018-11-18 22:57:53,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-18 22:57:53,025 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 179 [2018-11-18 22:57:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 22:57:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 247 transitions. [2018-11-18 22:57:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 22:57:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 247 transitions. [2018-11-18 22:57:53,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 247 transitions. [2018-11-18 22:57:53,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:53,302 INFO L225 Difference]: With dead ends: 202 [2018-11-18 22:57:53,302 INFO L226 Difference]: Without dead ends: 190 [2018-11-18 22:57:53,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 22:57:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-18 22:57:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-11-18 22:57:53,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:53,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 188 states. [2018-11-18 22:57:53,476 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 188 states. [2018-11-18 22:57:53,476 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 188 states. [2018-11-18 22:57:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:53,479 INFO L93 Difference]: Finished difference Result 190 states and 234 transitions. [2018-11-18 22:57:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 234 transitions. [2018-11-18 22:57:53,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:53,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:53,480 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 190 states. [2018-11-18 22:57:53,480 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 190 states. [2018-11-18 22:57:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:53,483 INFO L93 Difference]: Finished difference Result 190 states and 234 transitions. [2018-11-18 22:57:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 234 transitions. [2018-11-18 22:57:53,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:53,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:53,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:53,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-18 22:57:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 231 transitions. [2018-11-18 22:57:53,486 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 231 transitions. Word has length 179 [2018-11-18 22:57:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:53,486 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 231 transitions. [2018-11-18 22:57:53,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-18 22:57:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 231 transitions. [2018-11-18 22:57:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 22:57:53,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:53,487 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:53,487 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:53,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash 118945950, now seen corresponding path program 42 times [2018-11-18 22:57:53,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:53,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:53,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:54,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {34497#true} call ULTIMATE.init(); {34497#true} is VALID [2018-11-18 22:57:54,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {34497#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34497#true} is VALID [2018-11-18 22:57:54,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {34497#true} assume true; {34497#true} is VALID [2018-11-18 22:57:54,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34497#true} {34497#true} #57#return; {34497#true} is VALID [2018-11-18 22:57:54,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {34497#true} call #t~ret4 := main(); {34497#true} is VALID [2018-11-18 22:57:54,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {34497#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {34499#(= main_~i~0 0)} is VALID [2018-11-18 22:57:54,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {34499#(= main_~i~0 0)} assume true; {34499#(= main_~i~0 0)} is VALID [2018-11-18 22:57:54,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {34499#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34499#(= main_~i~0 0)} is VALID [2018-11-18 22:57:54,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {34499#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34499#(= main_~i~0 0)} is VALID [2018-11-18 22:57:54,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {34499#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {34500#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:54,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {34500#(<= main_~i~0 1)} assume true; {34500#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:54,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {34500#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34500#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:54,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {34500#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34500#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:54,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {34500#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {34501#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:54,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {34501#(<= main_~i~0 2)} assume true; {34501#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:54,556 INFO L273 TraceCheckUtils]: 15: Hoare triple {34501#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34501#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:54,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {34501#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34501#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:54,559 INFO L273 TraceCheckUtils]: 17: Hoare triple {34501#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {34502#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:54,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {34502#(<= main_~i~0 3)} assume true; {34502#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:54,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {34502#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34502#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:54,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {34502#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34502#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:54,563 INFO L273 TraceCheckUtils]: 21: Hoare triple {34502#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {34503#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:54,565 INFO L273 TraceCheckUtils]: 22: Hoare triple {34503#(<= main_~i~0 4)} assume true; {34503#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:54,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {34503#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34503#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:54,567 INFO L273 TraceCheckUtils]: 24: Hoare triple {34503#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34503#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:54,567 INFO L273 TraceCheckUtils]: 25: Hoare triple {34503#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {34504#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:54,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {34504#(<= main_~i~0 5)} assume true; {34504#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:54,568 INFO L273 TraceCheckUtils]: 27: Hoare triple {34504#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34504#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:54,568 INFO L273 TraceCheckUtils]: 28: Hoare triple {34504#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34504#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:54,568 INFO L273 TraceCheckUtils]: 29: Hoare triple {34504#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {34505#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:54,569 INFO L273 TraceCheckUtils]: 30: Hoare triple {34505#(<= main_~i~0 6)} assume true; {34505#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:54,569 INFO L273 TraceCheckUtils]: 31: Hoare triple {34505#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34505#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:54,569 INFO L273 TraceCheckUtils]: 32: Hoare triple {34505#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34505#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:54,570 INFO L273 TraceCheckUtils]: 33: Hoare triple {34505#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {34506#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:54,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {34506#(<= main_~i~0 7)} assume true; {34506#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:54,570 INFO L273 TraceCheckUtils]: 35: Hoare triple {34506#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34506#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:54,571 INFO L273 TraceCheckUtils]: 36: Hoare triple {34506#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34506#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:54,571 INFO L273 TraceCheckUtils]: 37: Hoare triple {34506#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {34507#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:54,572 INFO L273 TraceCheckUtils]: 38: Hoare triple {34507#(<= main_~i~0 8)} assume true; {34507#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:54,572 INFO L273 TraceCheckUtils]: 39: Hoare triple {34507#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34507#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:54,573 INFO L273 TraceCheckUtils]: 40: Hoare triple {34507#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34507#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:54,573 INFO L273 TraceCheckUtils]: 41: Hoare triple {34507#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {34508#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:54,574 INFO L273 TraceCheckUtils]: 42: Hoare triple {34508#(<= main_~i~0 9)} assume true; {34508#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:54,574 INFO L273 TraceCheckUtils]: 43: Hoare triple {34508#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34508#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:54,575 INFO L273 TraceCheckUtils]: 44: Hoare triple {34508#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34508#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:54,576 INFO L273 TraceCheckUtils]: 45: Hoare triple {34508#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {34509#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:54,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {34509#(<= main_~i~0 10)} assume true; {34509#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:54,577 INFO L273 TraceCheckUtils]: 47: Hoare triple {34509#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34509#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:54,577 INFO L273 TraceCheckUtils]: 48: Hoare triple {34509#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34509#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:54,578 INFO L273 TraceCheckUtils]: 49: Hoare triple {34509#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {34510#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:54,578 INFO L273 TraceCheckUtils]: 50: Hoare triple {34510#(<= main_~i~0 11)} assume true; {34510#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:54,579 INFO L273 TraceCheckUtils]: 51: Hoare triple {34510#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34510#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:54,579 INFO L273 TraceCheckUtils]: 52: Hoare triple {34510#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34510#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:54,580 INFO L273 TraceCheckUtils]: 53: Hoare triple {34510#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {34511#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:54,580 INFO L273 TraceCheckUtils]: 54: Hoare triple {34511#(<= main_~i~0 12)} assume true; {34511#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:54,581 INFO L273 TraceCheckUtils]: 55: Hoare triple {34511#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34511#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:54,581 INFO L273 TraceCheckUtils]: 56: Hoare triple {34511#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34511#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:54,582 INFO L273 TraceCheckUtils]: 57: Hoare triple {34511#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {34512#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:54,583 INFO L273 TraceCheckUtils]: 58: Hoare triple {34512#(<= main_~i~0 13)} assume true; {34512#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:54,583 INFO L273 TraceCheckUtils]: 59: Hoare triple {34512#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34512#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:54,584 INFO L273 TraceCheckUtils]: 60: Hoare triple {34512#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34512#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:54,584 INFO L273 TraceCheckUtils]: 61: Hoare triple {34512#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {34513#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:54,585 INFO L273 TraceCheckUtils]: 62: Hoare triple {34513#(<= main_~i~0 14)} assume true; {34513#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:54,585 INFO L273 TraceCheckUtils]: 63: Hoare triple {34513#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34513#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:54,586 INFO L273 TraceCheckUtils]: 64: Hoare triple {34513#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34513#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:54,587 INFO L273 TraceCheckUtils]: 65: Hoare triple {34513#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {34514#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:54,587 INFO L273 TraceCheckUtils]: 66: Hoare triple {34514#(<= main_~i~0 15)} assume true; {34514#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:54,588 INFO L273 TraceCheckUtils]: 67: Hoare triple {34514#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34514#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:54,588 INFO L273 TraceCheckUtils]: 68: Hoare triple {34514#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34514#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:54,589 INFO L273 TraceCheckUtils]: 69: Hoare triple {34514#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {34515#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:54,589 INFO L273 TraceCheckUtils]: 70: Hoare triple {34515#(<= main_~i~0 16)} assume true; {34515#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:54,590 INFO L273 TraceCheckUtils]: 71: Hoare triple {34515#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34515#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:54,590 INFO L273 TraceCheckUtils]: 72: Hoare triple {34515#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34515#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:54,591 INFO L273 TraceCheckUtils]: 73: Hoare triple {34515#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {34516#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:54,591 INFO L273 TraceCheckUtils]: 74: Hoare triple {34516#(<= main_~i~0 17)} assume true; {34516#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:54,592 INFO L273 TraceCheckUtils]: 75: Hoare triple {34516#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34516#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:54,592 INFO L273 TraceCheckUtils]: 76: Hoare triple {34516#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34516#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:54,593 INFO L273 TraceCheckUtils]: 77: Hoare triple {34516#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {34517#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:54,594 INFO L273 TraceCheckUtils]: 78: Hoare triple {34517#(<= main_~i~0 18)} assume true; {34517#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:54,594 INFO L273 TraceCheckUtils]: 79: Hoare triple {34517#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34517#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:54,595 INFO L273 TraceCheckUtils]: 80: Hoare triple {34517#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34517#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:54,595 INFO L273 TraceCheckUtils]: 81: Hoare triple {34517#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {34518#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:54,596 INFO L273 TraceCheckUtils]: 82: Hoare triple {34518#(<= main_~i~0 19)} assume true; {34518#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:54,596 INFO L273 TraceCheckUtils]: 83: Hoare triple {34518#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34518#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:54,597 INFO L273 TraceCheckUtils]: 84: Hoare triple {34518#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34518#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:54,598 INFO L273 TraceCheckUtils]: 85: Hoare triple {34518#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {34519#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:54,598 INFO L273 TraceCheckUtils]: 86: Hoare triple {34519#(<= main_~i~0 20)} assume true; {34519#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:54,599 INFO L273 TraceCheckUtils]: 87: Hoare triple {34519#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34519#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:54,599 INFO L273 TraceCheckUtils]: 88: Hoare triple {34519#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34519#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:54,600 INFO L273 TraceCheckUtils]: 89: Hoare triple {34519#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {34520#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:54,600 INFO L273 TraceCheckUtils]: 90: Hoare triple {34520#(<= main_~i~0 21)} assume true; {34520#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:54,601 INFO L273 TraceCheckUtils]: 91: Hoare triple {34520#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34520#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:54,601 INFO L273 TraceCheckUtils]: 92: Hoare triple {34520#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34520#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:54,602 INFO L273 TraceCheckUtils]: 93: Hoare triple {34520#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {34521#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:54,603 INFO L273 TraceCheckUtils]: 94: Hoare triple {34521#(<= main_~i~0 22)} assume true; {34521#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:54,603 INFO L273 TraceCheckUtils]: 95: Hoare triple {34521#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34521#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:54,604 INFO L273 TraceCheckUtils]: 96: Hoare triple {34521#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34521#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:54,604 INFO L273 TraceCheckUtils]: 97: Hoare triple {34521#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {34522#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:54,605 INFO L273 TraceCheckUtils]: 98: Hoare triple {34522#(<= main_~i~0 23)} assume true; {34522#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:54,605 INFO L273 TraceCheckUtils]: 99: Hoare triple {34522#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34522#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:54,606 INFO L273 TraceCheckUtils]: 100: Hoare triple {34522#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34522#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:54,606 INFO L273 TraceCheckUtils]: 101: Hoare triple {34522#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {34523#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:54,607 INFO L273 TraceCheckUtils]: 102: Hoare triple {34523#(<= main_~i~0 24)} assume true; {34523#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:54,607 INFO L273 TraceCheckUtils]: 103: Hoare triple {34523#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34523#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:54,608 INFO L273 TraceCheckUtils]: 104: Hoare triple {34523#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34523#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:54,609 INFO L273 TraceCheckUtils]: 105: Hoare triple {34523#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {34524#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:54,609 INFO L273 TraceCheckUtils]: 106: Hoare triple {34524#(<= main_~i~0 25)} assume true; {34524#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:54,610 INFO L273 TraceCheckUtils]: 107: Hoare triple {34524#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34524#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:54,610 INFO L273 TraceCheckUtils]: 108: Hoare triple {34524#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34524#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:54,611 INFO L273 TraceCheckUtils]: 109: Hoare triple {34524#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {34525#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:54,611 INFO L273 TraceCheckUtils]: 110: Hoare triple {34525#(<= main_~i~0 26)} assume true; {34525#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:54,612 INFO L273 TraceCheckUtils]: 111: Hoare triple {34525#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34525#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:54,612 INFO L273 TraceCheckUtils]: 112: Hoare triple {34525#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34525#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:54,613 INFO L273 TraceCheckUtils]: 113: Hoare triple {34525#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {34526#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:54,614 INFO L273 TraceCheckUtils]: 114: Hoare triple {34526#(<= main_~i~0 27)} assume true; {34526#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:54,614 INFO L273 TraceCheckUtils]: 115: Hoare triple {34526#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34526#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:54,615 INFO L273 TraceCheckUtils]: 116: Hoare triple {34526#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34526#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:54,615 INFO L273 TraceCheckUtils]: 117: Hoare triple {34526#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {34527#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:54,616 INFO L273 TraceCheckUtils]: 118: Hoare triple {34527#(<= main_~i~0 28)} assume true; {34527#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:54,616 INFO L273 TraceCheckUtils]: 119: Hoare triple {34527#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34527#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:54,617 INFO L273 TraceCheckUtils]: 120: Hoare triple {34527#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34527#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:54,618 INFO L273 TraceCheckUtils]: 121: Hoare triple {34527#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {34528#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:54,618 INFO L273 TraceCheckUtils]: 122: Hoare triple {34528#(<= main_~i~0 29)} assume true; {34528#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:54,619 INFO L273 TraceCheckUtils]: 123: Hoare triple {34528#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34528#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:54,619 INFO L273 TraceCheckUtils]: 124: Hoare triple {34528#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34528#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:54,620 INFO L273 TraceCheckUtils]: 125: Hoare triple {34528#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {34529#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:54,620 INFO L273 TraceCheckUtils]: 126: Hoare triple {34529#(<= main_~i~0 30)} assume true; {34529#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:54,621 INFO L273 TraceCheckUtils]: 127: Hoare triple {34529#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34529#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:54,621 INFO L273 TraceCheckUtils]: 128: Hoare triple {34529#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34529#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:54,622 INFO L273 TraceCheckUtils]: 129: Hoare triple {34529#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {34530#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:54,622 INFO L273 TraceCheckUtils]: 130: Hoare triple {34530#(<= main_~i~0 31)} assume true; {34530#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:54,623 INFO L273 TraceCheckUtils]: 131: Hoare triple {34530#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34530#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:54,623 INFO L273 TraceCheckUtils]: 132: Hoare triple {34530#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34530#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:54,624 INFO L273 TraceCheckUtils]: 133: Hoare triple {34530#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {34531#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:54,625 INFO L273 TraceCheckUtils]: 134: Hoare triple {34531#(<= main_~i~0 32)} assume true; {34531#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:54,625 INFO L273 TraceCheckUtils]: 135: Hoare triple {34531#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34531#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:54,626 INFO L273 TraceCheckUtils]: 136: Hoare triple {34531#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34531#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:54,626 INFO L273 TraceCheckUtils]: 137: Hoare triple {34531#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {34532#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:54,627 INFO L273 TraceCheckUtils]: 138: Hoare triple {34532#(<= main_~i~0 33)} assume true; {34532#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:54,627 INFO L273 TraceCheckUtils]: 139: Hoare triple {34532#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34532#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:54,628 INFO L273 TraceCheckUtils]: 140: Hoare triple {34532#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34532#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:54,629 INFO L273 TraceCheckUtils]: 141: Hoare triple {34532#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {34533#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:54,629 INFO L273 TraceCheckUtils]: 142: Hoare triple {34533#(<= main_~i~0 34)} assume true; {34533#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:54,630 INFO L273 TraceCheckUtils]: 143: Hoare triple {34533#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34533#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:54,630 INFO L273 TraceCheckUtils]: 144: Hoare triple {34533#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34533#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:54,631 INFO L273 TraceCheckUtils]: 145: Hoare triple {34533#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {34534#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:54,631 INFO L273 TraceCheckUtils]: 146: Hoare triple {34534#(<= main_~i~0 35)} assume true; {34534#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:54,632 INFO L273 TraceCheckUtils]: 147: Hoare triple {34534#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34534#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:54,632 INFO L273 TraceCheckUtils]: 148: Hoare triple {34534#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34534#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:54,633 INFO L273 TraceCheckUtils]: 149: Hoare triple {34534#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {34535#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:54,634 INFO L273 TraceCheckUtils]: 150: Hoare triple {34535#(<= main_~i~0 36)} assume true; {34535#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:54,634 INFO L273 TraceCheckUtils]: 151: Hoare triple {34535#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34535#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:54,635 INFO L273 TraceCheckUtils]: 152: Hoare triple {34535#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34535#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:54,635 INFO L273 TraceCheckUtils]: 153: Hoare triple {34535#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {34536#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:54,636 INFO L273 TraceCheckUtils]: 154: Hoare triple {34536#(<= main_~i~0 37)} assume true; {34536#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:54,636 INFO L273 TraceCheckUtils]: 155: Hoare triple {34536#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34536#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:54,637 INFO L273 TraceCheckUtils]: 156: Hoare triple {34536#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34536#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:54,637 INFO L273 TraceCheckUtils]: 157: Hoare triple {34536#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {34537#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:54,638 INFO L273 TraceCheckUtils]: 158: Hoare triple {34537#(<= main_~i~0 38)} assume true; {34537#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:54,639 INFO L273 TraceCheckUtils]: 159: Hoare triple {34537#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34537#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:54,639 INFO L273 TraceCheckUtils]: 160: Hoare triple {34537#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34537#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:54,640 INFO L273 TraceCheckUtils]: 161: Hoare triple {34537#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {34538#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:54,640 INFO L273 TraceCheckUtils]: 162: Hoare triple {34538#(<= main_~i~0 39)} assume true; {34538#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:54,641 INFO L273 TraceCheckUtils]: 163: Hoare triple {34538#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34538#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:54,641 INFO L273 TraceCheckUtils]: 164: Hoare triple {34538#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34538#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:54,642 INFO L273 TraceCheckUtils]: 165: Hoare triple {34538#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {34539#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:54,642 INFO L273 TraceCheckUtils]: 166: Hoare triple {34539#(<= main_~i~0 40)} assume true; {34539#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:54,643 INFO L273 TraceCheckUtils]: 167: Hoare triple {34539#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34539#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:54,643 INFO L273 TraceCheckUtils]: 168: Hoare triple {34539#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34539#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:54,644 INFO L273 TraceCheckUtils]: 169: Hoare triple {34539#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {34540#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:54,645 INFO L273 TraceCheckUtils]: 170: Hoare triple {34540#(<= main_~i~0 41)} assume true; {34540#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:54,645 INFO L273 TraceCheckUtils]: 171: Hoare triple {34540#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34540#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:54,646 INFO L273 TraceCheckUtils]: 172: Hoare triple {34540#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34540#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:54,646 INFO L273 TraceCheckUtils]: 173: Hoare triple {34540#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {34541#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:54,647 INFO L273 TraceCheckUtils]: 174: Hoare triple {34541#(<= main_~i~0 42)} assume true; {34541#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:54,648 INFO L273 TraceCheckUtils]: 175: Hoare triple {34541#(<= main_~i~0 42)} assume !(~i~0 < 100000); {34498#false} is VALID [2018-11-18 22:57:54,648 INFO L273 TraceCheckUtils]: 176: Hoare triple {34498#false} havoc ~x~0;~x~0 := 0; {34498#false} is VALID [2018-11-18 22:57:54,648 INFO L273 TraceCheckUtils]: 177: Hoare triple {34498#false} assume true; {34498#false} is VALID [2018-11-18 22:57:54,648 INFO L273 TraceCheckUtils]: 178: Hoare triple {34498#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {34498#false} is VALID [2018-11-18 22:57:54,648 INFO L256 TraceCheckUtils]: 179: Hoare triple {34498#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {34498#false} is VALID [2018-11-18 22:57:54,648 INFO L273 TraceCheckUtils]: 180: Hoare triple {34498#false} ~cond := #in~cond; {34498#false} is VALID [2018-11-18 22:57:54,649 INFO L273 TraceCheckUtils]: 181: Hoare triple {34498#false} assume 0 == ~cond; {34498#false} is VALID [2018-11-18 22:57:54,649 INFO L273 TraceCheckUtils]: 182: Hoare triple {34498#false} assume !false; {34498#false} is VALID [2018-11-18 22:57:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:54,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:54,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:54,682 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:57:54,803 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-11-18 22:57:54,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:54,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:55,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {34497#true} call ULTIMATE.init(); {34497#true} is VALID [2018-11-18 22:57:55,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {34497#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34497#true} is VALID [2018-11-18 22:57:55,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {34497#true} assume true; {34497#true} is VALID [2018-11-18 22:57:55,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34497#true} {34497#true} #57#return; {34497#true} is VALID [2018-11-18 22:57:55,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {34497#true} call #t~ret4 := main(); {34497#true} is VALID [2018-11-18 22:57:55,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {34497#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {34560#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:55,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {34560#(<= main_~i~0 0)} assume true; {34560#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:55,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {34560#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34560#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:55,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {34560#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34560#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:55,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {34560#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {34500#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:55,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {34500#(<= main_~i~0 1)} assume true; {34500#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:55,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {34500#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34500#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:55,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {34500#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34500#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:55,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {34500#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {34501#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:55,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {34501#(<= main_~i~0 2)} assume true; {34501#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:55,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {34501#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34501#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:55,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {34501#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34501#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:55,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {34501#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {34502#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:55,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {34502#(<= main_~i~0 3)} assume true; {34502#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:55,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {34502#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34502#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:55,371 INFO L273 TraceCheckUtils]: 20: Hoare triple {34502#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34502#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:55,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {34502#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {34503#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:55,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {34503#(<= main_~i~0 4)} assume true; {34503#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:55,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {34503#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34503#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:55,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {34503#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34503#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:55,374 INFO L273 TraceCheckUtils]: 25: Hoare triple {34503#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {34504#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:55,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {34504#(<= main_~i~0 5)} assume true; {34504#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:55,375 INFO L273 TraceCheckUtils]: 27: Hoare triple {34504#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34504#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:55,375 INFO L273 TraceCheckUtils]: 28: Hoare triple {34504#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34504#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:55,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {34504#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {34505#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:55,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {34505#(<= main_~i~0 6)} assume true; {34505#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:55,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {34505#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34505#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:55,378 INFO L273 TraceCheckUtils]: 32: Hoare triple {34505#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34505#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:55,378 INFO L273 TraceCheckUtils]: 33: Hoare triple {34505#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {34506#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:55,379 INFO L273 TraceCheckUtils]: 34: Hoare triple {34506#(<= main_~i~0 7)} assume true; {34506#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:55,379 INFO L273 TraceCheckUtils]: 35: Hoare triple {34506#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34506#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:55,380 INFO L273 TraceCheckUtils]: 36: Hoare triple {34506#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34506#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:55,381 INFO L273 TraceCheckUtils]: 37: Hoare triple {34506#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {34507#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:55,381 INFO L273 TraceCheckUtils]: 38: Hoare triple {34507#(<= main_~i~0 8)} assume true; {34507#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:55,382 INFO L273 TraceCheckUtils]: 39: Hoare triple {34507#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34507#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:55,382 INFO L273 TraceCheckUtils]: 40: Hoare triple {34507#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34507#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:55,383 INFO L273 TraceCheckUtils]: 41: Hoare triple {34507#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {34508#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:55,383 INFO L273 TraceCheckUtils]: 42: Hoare triple {34508#(<= main_~i~0 9)} assume true; {34508#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:55,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {34508#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34508#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:55,384 INFO L273 TraceCheckUtils]: 44: Hoare triple {34508#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34508#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:55,385 INFO L273 TraceCheckUtils]: 45: Hoare triple {34508#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {34509#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:55,385 INFO L273 TraceCheckUtils]: 46: Hoare triple {34509#(<= main_~i~0 10)} assume true; {34509#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:55,386 INFO L273 TraceCheckUtils]: 47: Hoare triple {34509#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34509#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:55,386 INFO L273 TraceCheckUtils]: 48: Hoare triple {34509#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34509#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:55,387 INFO L273 TraceCheckUtils]: 49: Hoare triple {34509#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {34510#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:55,388 INFO L273 TraceCheckUtils]: 50: Hoare triple {34510#(<= main_~i~0 11)} assume true; {34510#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:55,388 INFO L273 TraceCheckUtils]: 51: Hoare triple {34510#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34510#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:55,389 INFO L273 TraceCheckUtils]: 52: Hoare triple {34510#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34510#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:55,389 INFO L273 TraceCheckUtils]: 53: Hoare triple {34510#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {34511#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:55,390 INFO L273 TraceCheckUtils]: 54: Hoare triple {34511#(<= main_~i~0 12)} assume true; {34511#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:55,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {34511#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34511#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:55,391 INFO L273 TraceCheckUtils]: 56: Hoare triple {34511#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34511#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:55,392 INFO L273 TraceCheckUtils]: 57: Hoare triple {34511#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {34512#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:55,392 INFO L273 TraceCheckUtils]: 58: Hoare triple {34512#(<= main_~i~0 13)} assume true; {34512#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:55,393 INFO L273 TraceCheckUtils]: 59: Hoare triple {34512#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34512#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:55,393 INFO L273 TraceCheckUtils]: 60: Hoare triple {34512#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34512#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:55,394 INFO L273 TraceCheckUtils]: 61: Hoare triple {34512#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {34513#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:55,394 INFO L273 TraceCheckUtils]: 62: Hoare triple {34513#(<= main_~i~0 14)} assume true; {34513#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:55,395 INFO L273 TraceCheckUtils]: 63: Hoare triple {34513#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34513#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:55,395 INFO L273 TraceCheckUtils]: 64: Hoare triple {34513#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34513#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:55,396 INFO L273 TraceCheckUtils]: 65: Hoare triple {34513#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {34514#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:55,397 INFO L273 TraceCheckUtils]: 66: Hoare triple {34514#(<= main_~i~0 15)} assume true; {34514#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:55,397 INFO L273 TraceCheckUtils]: 67: Hoare triple {34514#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34514#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:55,397 INFO L273 TraceCheckUtils]: 68: Hoare triple {34514#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34514#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:55,398 INFO L273 TraceCheckUtils]: 69: Hoare triple {34514#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {34515#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:55,399 INFO L273 TraceCheckUtils]: 70: Hoare triple {34515#(<= main_~i~0 16)} assume true; {34515#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:55,399 INFO L273 TraceCheckUtils]: 71: Hoare triple {34515#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34515#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:55,400 INFO L273 TraceCheckUtils]: 72: Hoare triple {34515#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34515#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:55,400 INFO L273 TraceCheckUtils]: 73: Hoare triple {34515#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {34516#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:55,401 INFO L273 TraceCheckUtils]: 74: Hoare triple {34516#(<= main_~i~0 17)} assume true; {34516#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:55,401 INFO L273 TraceCheckUtils]: 75: Hoare triple {34516#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34516#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:55,402 INFO L273 TraceCheckUtils]: 76: Hoare triple {34516#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34516#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:55,403 INFO L273 TraceCheckUtils]: 77: Hoare triple {34516#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {34517#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:55,403 INFO L273 TraceCheckUtils]: 78: Hoare triple {34517#(<= main_~i~0 18)} assume true; {34517#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:55,404 INFO L273 TraceCheckUtils]: 79: Hoare triple {34517#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34517#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:55,404 INFO L273 TraceCheckUtils]: 80: Hoare triple {34517#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34517#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:55,405 INFO L273 TraceCheckUtils]: 81: Hoare triple {34517#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {34518#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:55,405 INFO L273 TraceCheckUtils]: 82: Hoare triple {34518#(<= main_~i~0 19)} assume true; {34518#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:55,406 INFO L273 TraceCheckUtils]: 83: Hoare triple {34518#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34518#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:55,406 INFO L273 TraceCheckUtils]: 84: Hoare triple {34518#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34518#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:55,407 INFO L273 TraceCheckUtils]: 85: Hoare triple {34518#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {34519#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:55,408 INFO L273 TraceCheckUtils]: 86: Hoare triple {34519#(<= main_~i~0 20)} assume true; {34519#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:55,408 INFO L273 TraceCheckUtils]: 87: Hoare triple {34519#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34519#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:55,409 INFO L273 TraceCheckUtils]: 88: Hoare triple {34519#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34519#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:55,409 INFO L273 TraceCheckUtils]: 89: Hoare triple {34519#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {34520#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:55,410 INFO L273 TraceCheckUtils]: 90: Hoare triple {34520#(<= main_~i~0 21)} assume true; {34520#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:55,410 INFO L273 TraceCheckUtils]: 91: Hoare triple {34520#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34520#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:55,411 INFO L273 TraceCheckUtils]: 92: Hoare triple {34520#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34520#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:55,411 INFO L273 TraceCheckUtils]: 93: Hoare triple {34520#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {34521#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:55,412 INFO L273 TraceCheckUtils]: 94: Hoare triple {34521#(<= main_~i~0 22)} assume true; {34521#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:55,412 INFO L273 TraceCheckUtils]: 95: Hoare triple {34521#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34521#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:55,413 INFO L273 TraceCheckUtils]: 96: Hoare triple {34521#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34521#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:55,414 INFO L273 TraceCheckUtils]: 97: Hoare triple {34521#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {34522#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:55,414 INFO L273 TraceCheckUtils]: 98: Hoare triple {34522#(<= main_~i~0 23)} assume true; {34522#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:55,415 INFO L273 TraceCheckUtils]: 99: Hoare triple {34522#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34522#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:55,415 INFO L273 TraceCheckUtils]: 100: Hoare triple {34522#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34522#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:55,416 INFO L273 TraceCheckUtils]: 101: Hoare triple {34522#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {34523#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:55,416 INFO L273 TraceCheckUtils]: 102: Hoare triple {34523#(<= main_~i~0 24)} assume true; {34523#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:55,417 INFO L273 TraceCheckUtils]: 103: Hoare triple {34523#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34523#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:55,417 INFO L273 TraceCheckUtils]: 104: Hoare triple {34523#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34523#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:55,418 INFO L273 TraceCheckUtils]: 105: Hoare triple {34523#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {34524#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:55,419 INFO L273 TraceCheckUtils]: 106: Hoare triple {34524#(<= main_~i~0 25)} assume true; {34524#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:55,419 INFO L273 TraceCheckUtils]: 107: Hoare triple {34524#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34524#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:55,420 INFO L273 TraceCheckUtils]: 108: Hoare triple {34524#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34524#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:55,420 INFO L273 TraceCheckUtils]: 109: Hoare triple {34524#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {34525#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:55,421 INFO L273 TraceCheckUtils]: 110: Hoare triple {34525#(<= main_~i~0 26)} assume true; {34525#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:55,421 INFO L273 TraceCheckUtils]: 111: Hoare triple {34525#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34525#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:55,422 INFO L273 TraceCheckUtils]: 112: Hoare triple {34525#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34525#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:55,423 INFO L273 TraceCheckUtils]: 113: Hoare triple {34525#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {34526#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:55,423 INFO L273 TraceCheckUtils]: 114: Hoare triple {34526#(<= main_~i~0 27)} assume true; {34526#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:55,424 INFO L273 TraceCheckUtils]: 115: Hoare triple {34526#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34526#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:55,424 INFO L273 TraceCheckUtils]: 116: Hoare triple {34526#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34526#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:55,425 INFO L273 TraceCheckUtils]: 117: Hoare triple {34526#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {34527#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:55,425 INFO L273 TraceCheckUtils]: 118: Hoare triple {34527#(<= main_~i~0 28)} assume true; {34527#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:55,426 INFO L273 TraceCheckUtils]: 119: Hoare triple {34527#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34527#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:55,426 INFO L273 TraceCheckUtils]: 120: Hoare triple {34527#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34527#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:55,427 INFO L273 TraceCheckUtils]: 121: Hoare triple {34527#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {34528#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:55,427 INFO L273 TraceCheckUtils]: 122: Hoare triple {34528#(<= main_~i~0 29)} assume true; {34528#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:55,428 INFO L273 TraceCheckUtils]: 123: Hoare triple {34528#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34528#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:55,428 INFO L273 TraceCheckUtils]: 124: Hoare triple {34528#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34528#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:55,429 INFO L273 TraceCheckUtils]: 125: Hoare triple {34528#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {34529#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:55,430 INFO L273 TraceCheckUtils]: 126: Hoare triple {34529#(<= main_~i~0 30)} assume true; {34529#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:55,430 INFO L273 TraceCheckUtils]: 127: Hoare triple {34529#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34529#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:55,431 INFO L273 TraceCheckUtils]: 128: Hoare triple {34529#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34529#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:55,431 INFO L273 TraceCheckUtils]: 129: Hoare triple {34529#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {34530#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:55,432 INFO L273 TraceCheckUtils]: 130: Hoare triple {34530#(<= main_~i~0 31)} assume true; {34530#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:55,432 INFO L273 TraceCheckUtils]: 131: Hoare triple {34530#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34530#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:55,433 INFO L273 TraceCheckUtils]: 132: Hoare triple {34530#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34530#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:55,434 INFO L273 TraceCheckUtils]: 133: Hoare triple {34530#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {34531#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:55,434 INFO L273 TraceCheckUtils]: 134: Hoare triple {34531#(<= main_~i~0 32)} assume true; {34531#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:55,435 INFO L273 TraceCheckUtils]: 135: Hoare triple {34531#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34531#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:55,435 INFO L273 TraceCheckUtils]: 136: Hoare triple {34531#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34531#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:55,436 INFO L273 TraceCheckUtils]: 137: Hoare triple {34531#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {34532#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:55,436 INFO L273 TraceCheckUtils]: 138: Hoare triple {34532#(<= main_~i~0 33)} assume true; {34532#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:55,437 INFO L273 TraceCheckUtils]: 139: Hoare triple {34532#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34532#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:55,437 INFO L273 TraceCheckUtils]: 140: Hoare triple {34532#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34532#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:55,438 INFO L273 TraceCheckUtils]: 141: Hoare triple {34532#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {34533#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:55,438 INFO L273 TraceCheckUtils]: 142: Hoare triple {34533#(<= main_~i~0 34)} assume true; {34533#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:55,439 INFO L273 TraceCheckUtils]: 143: Hoare triple {34533#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34533#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:55,439 INFO L273 TraceCheckUtils]: 144: Hoare triple {34533#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34533#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:55,440 INFO L273 TraceCheckUtils]: 145: Hoare triple {34533#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {34534#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:55,441 INFO L273 TraceCheckUtils]: 146: Hoare triple {34534#(<= main_~i~0 35)} assume true; {34534#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:55,441 INFO L273 TraceCheckUtils]: 147: Hoare triple {34534#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34534#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:55,442 INFO L273 TraceCheckUtils]: 148: Hoare triple {34534#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34534#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:55,442 INFO L273 TraceCheckUtils]: 149: Hoare triple {34534#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {34535#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:55,443 INFO L273 TraceCheckUtils]: 150: Hoare triple {34535#(<= main_~i~0 36)} assume true; {34535#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:55,443 INFO L273 TraceCheckUtils]: 151: Hoare triple {34535#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34535#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:55,444 INFO L273 TraceCheckUtils]: 152: Hoare triple {34535#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34535#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:55,445 INFO L273 TraceCheckUtils]: 153: Hoare triple {34535#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {34536#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:55,445 INFO L273 TraceCheckUtils]: 154: Hoare triple {34536#(<= main_~i~0 37)} assume true; {34536#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:55,446 INFO L273 TraceCheckUtils]: 155: Hoare triple {34536#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34536#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:55,446 INFO L273 TraceCheckUtils]: 156: Hoare triple {34536#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34536#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:55,447 INFO L273 TraceCheckUtils]: 157: Hoare triple {34536#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {34537#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:55,447 INFO L273 TraceCheckUtils]: 158: Hoare triple {34537#(<= main_~i~0 38)} assume true; {34537#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:55,448 INFO L273 TraceCheckUtils]: 159: Hoare triple {34537#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34537#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:55,448 INFO L273 TraceCheckUtils]: 160: Hoare triple {34537#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34537#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:55,449 INFO L273 TraceCheckUtils]: 161: Hoare triple {34537#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {34538#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:55,449 INFO L273 TraceCheckUtils]: 162: Hoare triple {34538#(<= main_~i~0 39)} assume true; {34538#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:55,450 INFO L273 TraceCheckUtils]: 163: Hoare triple {34538#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34538#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:55,450 INFO L273 TraceCheckUtils]: 164: Hoare triple {34538#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34538#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:55,451 INFO L273 TraceCheckUtils]: 165: Hoare triple {34538#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {34539#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:55,452 INFO L273 TraceCheckUtils]: 166: Hoare triple {34539#(<= main_~i~0 40)} assume true; {34539#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:55,452 INFO L273 TraceCheckUtils]: 167: Hoare triple {34539#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34539#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:55,453 INFO L273 TraceCheckUtils]: 168: Hoare triple {34539#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34539#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:55,453 INFO L273 TraceCheckUtils]: 169: Hoare triple {34539#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {34540#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:55,454 INFO L273 TraceCheckUtils]: 170: Hoare triple {34540#(<= main_~i~0 41)} assume true; {34540#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:55,454 INFO L273 TraceCheckUtils]: 171: Hoare triple {34540#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34540#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:55,455 INFO L273 TraceCheckUtils]: 172: Hoare triple {34540#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {34540#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:55,456 INFO L273 TraceCheckUtils]: 173: Hoare triple {34540#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {34541#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:55,456 INFO L273 TraceCheckUtils]: 174: Hoare triple {34541#(<= main_~i~0 42)} assume true; {34541#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:55,457 INFO L273 TraceCheckUtils]: 175: Hoare triple {34541#(<= main_~i~0 42)} assume !(~i~0 < 100000); {34498#false} is VALID [2018-11-18 22:57:55,457 INFO L273 TraceCheckUtils]: 176: Hoare triple {34498#false} havoc ~x~0;~x~0 := 0; {34498#false} is VALID [2018-11-18 22:57:55,457 INFO L273 TraceCheckUtils]: 177: Hoare triple {34498#false} assume true; {34498#false} is VALID [2018-11-18 22:57:55,457 INFO L273 TraceCheckUtils]: 178: Hoare triple {34498#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {34498#false} is VALID [2018-11-18 22:57:55,458 INFO L256 TraceCheckUtils]: 179: Hoare triple {34498#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {34498#false} is VALID [2018-11-18 22:57:55,458 INFO L273 TraceCheckUtils]: 180: Hoare triple {34498#false} ~cond := #in~cond; {34498#false} is VALID [2018-11-18 22:57:55,458 INFO L273 TraceCheckUtils]: 181: Hoare triple {34498#false} assume 0 == ~cond; {34498#false} is VALID [2018-11-18 22:57:55,458 INFO L273 TraceCheckUtils]: 182: Hoare triple {34498#false} assume !false; {34498#false} is VALID [2018-11-18 22:57:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:55,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:55,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-11-18 22:57:55,513 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 183 [2018-11-18 22:57:55,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:55,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-18 22:57:55,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:55,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-18 22:57:55,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-18 22:57:55,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 22:57:55,803 INFO L87 Difference]: Start difference. First operand 188 states and 231 transitions. Second operand 46 states. [2018-11-18 22:57:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:56,779 INFO L93 Difference]: Finished difference Result 206 states and 252 transitions. [2018-11-18 22:57:56,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-18 22:57:56,779 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 183 [2018-11-18 22:57:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 22:57:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 252 transitions. [2018-11-18 22:57:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 22:57:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 252 transitions. [2018-11-18 22:57:56,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 252 transitions. [2018-11-18 22:57:57,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:57,075 INFO L225 Difference]: With dead ends: 206 [2018-11-18 22:57:57,075 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 22:57:57,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 22:57:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 22:57:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-11-18 22:57:57,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:57,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 192 states. [2018-11-18 22:57:57,213 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 192 states. [2018-11-18 22:57:57,213 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 192 states. [2018-11-18 22:57:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:57,216 INFO L93 Difference]: Finished difference Result 194 states and 239 transitions. [2018-11-18 22:57:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2018-11-18 22:57:57,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:57,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:57,217 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 194 states. [2018-11-18 22:57:57,217 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 194 states. [2018-11-18 22:57:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:57,220 INFO L93 Difference]: Finished difference Result 194 states and 239 transitions. [2018-11-18 22:57:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2018-11-18 22:57:57,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:57,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:57,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:57,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-18 22:57:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 236 transitions. [2018-11-18 22:57:57,224 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 236 transitions. Word has length 183 [2018-11-18 22:57:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:57,225 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 236 transitions. [2018-11-18 22:57:57,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-18 22:57:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 236 transitions. [2018-11-18 22:57:57,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-18 22:57:57,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:57,226 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:57,226 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:57,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash -743434764, now seen corresponding path program 43 times [2018-11-18 22:57:57,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:57,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:57,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:58,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {35982#true} call ULTIMATE.init(); {35982#true} is VALID [2018-11-18 22:57:58,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {35982#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35982#true} is VALID [2018-11-18 22:57:58,449 INFO L273 TraceCheckUtils]: 2: Hoare triple {35982#true} assume true; {35982#true} is VALID [2018-11-18 22:57:58,449 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35982#true} {35982#true} #57#return; {35982#true} is VALID [2018-11-18 22:57:58,449 INFO L256 TraceCheckUtils]: 4: Hoare triple {35982#true} call #t~ret4 := main(); {35982#true} is VALID [2018-11-18 22:57:58,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {35982#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {35984#(= main_~i~0 0)} is VALID [2018-11-18 22:57:58,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {35984#(= main_~i~0 0)} assume true; {35984#(= main_~i~0 0)} is VALID [2018-11-18 22:57:58,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {35984#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35984#(= main_~i~0 0)} is VALID [2018-11-18 22:57:58,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {35984#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35984#(= main_~i~0 0)} is VALID [2018-11-18 22:57:58,452 INFO L273 TraceCheckUtils]: 9: Hoare triple {35984#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {35985#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:58,452 INFO L273 TraceCheckUtils]: 10: Hoare triple {35985#(<= main_~i~0 1)} assume true; {35985#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:58,453 INFO L273 TraceCheckUtils]: 11: Hoare triple {35985#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35985#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:58,453 INFO L273 TraceCheckUtils]: 12: Hoare triple {35985#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35985#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:58,454 INFO L273 TraceCheckUtils]: 13: Hoare triple {35985#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {35986#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:58,455 INFO L273 TraceCheckUtils]: 14: Hoare triple {35986#(<= main_~i~0 2)} assume true; {35986#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:58,455 INFO L273 TraceCheckUtils]: 15: Hoare triple {35986#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35986#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:58,455 INFO L273 TraceCheckUtils]: 16: Hoare triple {35986#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35986#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:58,456 INFO L273 TraceCheckUtils]: 17: Hoare triple {35986#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {35987#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:58,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {35987#(<= main_~i~0 3)} assume true; {35987#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:58,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {35987#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35987#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:58,458 INFO L273 TraceCheckUtils]: 20: Hoare triple {35987#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35987#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:58,458 INFO L273 TraceCheckUtils]: 21: Hoare triple {35987#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {35988#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:58,459 INFO L273 TraceCheckUtils]: 22: Hoare triple {35988#(<= main_~i~0 4)} assume true; {35988#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:58,459 INFO L273 TraceCheckUtils]: 23: Hoare triple {35988#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35988#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:58,460 INFO L273 TraceCheckUtils]: 24: Hoare triple {35988#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35988#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:58,461 INFO L273 TraceCheckUtils]: 25: Hoare triple {35988#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {35989#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:58,461 INFO L273 TraceCheckUtils]: 26: Hoare triple {35989#(<= main_~i~0 5)} assume true; {35989#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:58,462 INFO L273 TraceCheckUtils]: 27: Hoare triple {35989#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35989#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:58,462 INFO L273 TraceCheckUtils]: 28: Hoare triple {35989#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35989#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:58,463 INFO L273 TraceCheckUtils]: 29: Hoare triple {35989#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {35990#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:58,463 INFO L273 TraceCheckUtils]: 30: Hoare triple {35990#(<= main_~i~0 6)} assume true; {35990#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:58,464 INFO L273 TraceCheckUtils]: 31: Hoare triple {35990#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35990#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:58,464 INFO L273 TraceCheckUtils]: 32: Hoare triple {35990#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35990#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:58,465 INFO L273 TraceCheckUtils]: 33: Hoare triple {35990#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {35991#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:58,466 INFO L273 TraceCheckUtils]: 34: Hoare triple {35991#(<= main_~i~0 7)} assume true; {35991#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:58,466 INFO L273 TraceCheckUtils]: 35: Hoare triple {35991#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35991#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:58,467 INFO L273 TraceCheckUtils]: 36: Hoare triple {35991#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35991#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:58,467 INFO L273 TraceCheckUtils]: 37: Hoare triple {35991#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {35992#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:58,468 INFO L273 TraceCheckUtils]: 38: Hoare triple {35992#(<= main_~i~0 8)} assume true; {35992#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:58,468 INFO L273 TraceCheckUtils]: 39: Hoare triple {35992#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35992#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:58,469 INFO L273 TraceCheckUtils]: 40: Hoare triple {35992#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35992#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:58,469 INFO L273 TraceCheckUtils]: 41: Hoare triple {35992#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {35993#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:58,470 INFO L273 TraceCheckUtils]: 42: Hoare triple {35993#(<= main_~i~0 9)} assume true; {35993#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:58,470 INFO L273 TraceCheckUtils]: 43: Hoare triple {35993#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35993#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:58,471 INFO L273 TraceCheckUtils]: 44: Hoare triple {35993#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35993#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:58,472 INFO L273 TraceCheckUtils]: 45: Hoare triple {35993#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {35994#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:58,472 INFO L273 TraceCheckUtils]: 46: Hoare triple {35994#(<= main_~i~0 10)} assume true; {35994#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:58,473 INFO L273 TraceCheckUtils]: 47: Hoare triple {35994#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35994#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:58,473 INFO L273 TraceCheckUtils]: 48: Hoare triple {35994#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35994#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:58,474 INFO L273 TraceCheckUtils]: 49: Hoare triple {35994#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {35995#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:58,474 INFO L273 TraceCheckUtils]: 50: Hoare triple {35995#(<= main_~i~0 11)} assume true; {35995#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:58,475 INFO L273 TraceCheckUtils]: 51: Hoare triple {35995#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35995#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:58,475 INFO L273 TraceCheckUtils]: 52: Hoare triple {35995#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35995#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:58,476 INFO L273 TraceCheckUtils]: 53: Hoare triple {35995#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {35996#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:58,477 INFO L273 TraceCheckUtils]: 54: Hoare triple {35996#(<= main_~i~0 12)} assume true; {35996#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:58,477 INFO L273 TraceCheckUtils]: 55: Hoare triple {35996#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35996#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:58,478 INFO L273 TraceCheckUtils]: 56: Hoare triple {35996#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35996#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:58,478 INFO L273 TraceCheckUtils]: 57: Hoare triple {35996#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {35997#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:58,479 INFO L273 TraceCheckUtils]: 58: Hoare triple {35997#(<= main_~i~0 13)} assume true; {35997#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:58,479 INFO L273 TraceCheckUtils]: 59: Hoare triple {35997#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35997#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:58,480 INFO L273 TraceCheckUtils]: 60: Hoare triple {35997#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35997#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:58,480 INFO L273 TraceCheckUtils]: 61: Hoare triple {35997#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {35998#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:58,481 INFO L273 TraceCheckUtils]: 62: Hoare triple {35998#(<= main_~i~0 14)} assume true; {35998#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:58,481 INFO L273 TraceCheckUtils]: 63: Hoare triple {35998#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35998#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:58,482 INFO L273 TraceCheckUtils]: 64: Hoare triple {35998#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35998#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:58,483 INFO L273 TraceCheckUtils]: 65: Hoare triple {35998#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {35999#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:58,483 INFO L273 TraceCheckUtils]: 66: Hoare triple {35999#(<= main_~i~0 15)} assume true; {35999#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:58,484 INFO L273 TraceCheckUtils]: 67: Hoare triple {35999#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35999#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:58,484 INFO L273 TraceCheckUtils]: 68: Hoare triple {35999#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35999#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:58,485 INFO L273 TraceCheckUtils]: 69: Hoare triple {35999#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {36000#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:58,485 INFO L273 TraceCheckUtils]: 70: Hoare triple {36000#(<= main_~i~0 16)} assume true; {36000#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:58,486 INFO L273 TraceCheckUtils]: 71: Hoare triple {36000#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36000#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:58,486 INFO L273 TraceCheckUtils]: 72: Hoare triple {36000#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36000#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:58,487 INFO L273 TraceCheckUtils]: 73: Hoare triple {36000#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {36001#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:58,488 INFO L273 TraceCheckUtils]: 74: Hoare triple {36001#(<= main_~i~0 17)} assume true; {36001#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:58,488 INFO L273 TraceCheckUtils]: 75: Hoare triple {36001#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36001#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:58,489 INFO L273 TraceCheckUtils]: 76: Hoare triple {36001#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36001#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:58,489 INFO L273 TraceCheckUtils]: 77: Hoare triple {36001#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {36002#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:58,490 INFO L273 TraceCheckUtils]: 78: Hoare triple {36002#(<= main_~i~0 18)} assume true; {36002#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:58,490 INFO L273 TraceCheckUtils]: 79: Hoare triple {36002#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36002#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:58,491 INFO L273 TraceCheckUtils]: 80: Hoare triple {36002#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36002#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:58,492 INFO L273 TraceCheckUtils]: 81: Hoare triple {36002#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {36003#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:58,492 INFO L273 TraceCheckUtils]: 82: Hoare triple {36003#(<= main_~i~0 19)} assume true; {36003#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:58,493 INFO L273 TraceCheckUtils]: 83: Hoare triple {36003#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36003#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:58,493 INFO L273 TraceCheckUtils]: 84: Hoare triple {36003#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36003#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:58,494 INFO L273 TraceCheckUtils]: 85: Hoare triple {36003#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {36004#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:58,494 INFO L273 TraceCheckUtils]: 86: Hoare triple {36004#(<= main_~i~0 20)} assume true; {36004#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:58,495 INFO L273 TraceCheckUtils]: 87: Hoare triple {36004#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36004#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:58,495 INFO L273 TraceCheckUtils]: 88: Hoare triple {36004#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36004#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:58,496 INFO L273 TraceCheckUtils]: 89: Hoare triple {36004#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {36005#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:58,496 INFO L273 TraceCheckUtils]: 90: Hoare triple {36005#(<= main_~i~0 21)} assume true; {36005#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:58,497 INFO L273 TraceCheckUtils]: 91: Hoare triple {36005#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36005#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:58,497 INFO L273 TraceCheckUtils]: 92: Hoare triple {36005#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36005#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:58,498 INFO L273 TraceCheckUtils]: 93: Hoare triple {36005#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {36006#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:58,499 INFO L273 TraceCheckUtils]: 94: Hoare triple {36006#(<= main_~i~0 22)} assume true; {36006#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:58,499 INFO L273 TraceCheckUtils]: 95: Hoare triple {36006#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36006#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:58,500 INFO L273 TraceCheckUtils]: 96: Hoare triple {36006#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36006#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:58,500 INFO L273 TraceCheckUtils]: 97: Hoare triple {36006#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {36007#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:58,501 INFO L273 TraceCheckUtils]: 98: Hoare triple {36007#(<= main_~i~0 23)} assume true; {36007#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:58,501 INFO L273 TraceCheckUtils]: 99: Hoare triple {36007#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36007#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:58,502 INFO L273 TraceCheckUtils]: 100: Hoare triple {36007#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36007#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:58,503 INFO L273 TraceCheckUtils]: 101: Hoare triple {36007#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {36008#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:58,503 INFO L273 TraceCheckUtils]: 102: Hoare triple {36008#(<= main_~i~0 24)} assume true; {36008#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:58,504 INFO L273 TraceCheckUtils]: 103: Hoare triple {36008#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36008#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:58,504 INFO L273 TraceCheckUtils]: 104: Hoare triple {36008#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36008#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:58,505 INFO L273 TraceCheckUtils]: 105: Hoare triple {36008#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {36009#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:58,505 INFO L273 TraceCheckUtils]: 106: Hoare triple {36009#(<= main_~i~0 25)} assume true; {36009#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:58,506 INFO L273 TraceCheckUtils]: 107: Hoare triple {36009#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36009#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:58,506 INFO L273 TraceCheckUtils]: 108: Hoare triple {36009#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36009#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:58,507 INFO L273 TraceCheckUtils]: 109: Hoare triple {36009#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {36010#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:58,508 INFO L273 TraceCheckUtils]: 110: Hoare triple {36010#(<= main_~i~0 26)} assume true; {36010#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:58,508 INFO L273 TraceCheckUtils]: 111: Hoare triple {36010#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36010#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:58,508 INFO L273 TraceCheckUtils]: 112: Hoare triple {36010#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36010#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:58,509 INFO L273 TraceCheckUtils]: 113: Hoare triple {36010#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {36011#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:58,510 INFO L273 TraceCheckUtils]: 114: Hoare triple {36011#(<= main_~i~0 27)} assume true; {36011#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:58,510 INFO L273 TraceCheckUtils]: 115: Hoare triple {36011#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36011#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:58,511 INFO L273 TraceCheckUtils]: 116: Hoare triple {36011#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36011#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:58,511 INFO L273 TraceCheckUtils]: 117: Hoare triple {36011#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {36012#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:58,512 INFO L273 TraceCheckUtils]: 118: Hoare triple {36012#(<= main_~i~0 28)} assume true; {36012#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:58,512 INFO L273 TraceCheckUtils]: 119: Hoare triple {36012#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36012#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:58,513 INFO L273 TraceCheckUtils]: 120: Hoare triple {36012#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36012#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:58,514 INFO L273 TraceCheckUtils]: 121: Hoare triple {36012#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {36013#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:58,514 INFO L273 TraceCheckUtils]: 122: Hoare triple {36013#(<= main_~i~0 29)} assume true; {36013#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:58,515 INFO L273 TraceCheckUtils]: 123: Hoare triple {36013#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36013#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:58,515 INFO L273 TraceCheckUtils]: 124: Hoare triple {36013#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36013#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:58,516 INFO L273 TraceCheckUtils]: 125: Hoare triple {36013#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {36014#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:58,516 INFO L273 TraceCheckUtils]: 126: Hoare triple {36014#(<= main_~i~0 30)} assume true; {36014#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:58,517 INFO L273 TraceCheckUtils]: 127: Hoare triple {36014#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36014#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:58,517 INFO L273 TraceCheckUtils]: 128: Hoare triple {36014#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36014#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:58,518 INFO L273 TraceCheckUtils]: 129: Hoare triple {36014#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {36015#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:58,519 INFO L273 TraceCheckUtils]: 130: Hoare triple {36015#(<= main_~i~0 31)} assume true; {36015#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:58,519 INFO L273 TraceCheckUtils]: 131: Hoare triple {36015#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36015#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:58,520 INFO L273 TraceCheckUtils]: 132: Hoare triple {36015#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36015#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:58,520 INFO L273 TraceCheckUtils]: 133: Hoare triple {36015#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {36016#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:58,521 INFO L273 TraceCheckUtils]: 134: Hoare triple {36016#(<= main_~i~0 32)} assume true; {36016#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:58,521 INFO L273 TraceCheckUtils]: 135: Hoare triple {36016#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36016#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:58,522 INFO L273 TraceCheckUtils]: 136: Hoare triple {36016#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36016#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:58,522 INFO L273 TraceCheckUtils]: 137: Hoare triple {36016#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {36017#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:58,523 INFO L273 TraceCheckUtils]: 138: Hoare triple {36017#(<= main_~i~0 33)} assume true; {36017#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:58,523 INFO L273 TraceCheckUtils]: 139: Hoare triple {36017#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36017#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:58,524 INFO L273 TraceCheckUtils]: 140: Hoare triple {36017#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36017#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:58,525 INFO L273 TraceCheckUtils]: 141: Hoare triple {36017#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {36018#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:58,525 INFO L273 TraceCheckUtils]: 142: Hoare triple {36018#(<= main_~i~0 34)} assume true; {36018#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:58,526 INFO L273 TraceCheckUtils]: 143: Hoare triple {36018#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36018#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:58,526 INFO L273 TraceCheckUtils]: 144: Hoare triple {36018#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36018#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:58,527 INFO L273 TraceCheckUtils]: 145: Hoare triple {36018#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {36019#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:58,527 INFO L273 TraceCheckUtils]: 146: Hoare triple {36019#(<= main_~i~0 35)} assume true; {36019#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:58,528 INFO L273 TraceCheckUtils]: 147: Hoare triple {36019#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36019#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:58,528 INFO L273 TraceCheckUtils]: 148: Hoare triple {36019#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36019#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:58,529 INFO L273 TraceCheckUtils]: 149: Hoare triple {36019#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {36020#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:58,530 INFO L273 TraceCheckUtils]: 150: Hoare triple {36020#(<= main_~i~0 36)} assume true; {36020#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:58,530 INFO L273 TraceCheckUtils]: 151: Hoare triple {36020#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36020#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:58,530 INFO L273 TraceCheckUtils]: 152: Hoare triple {36020#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36020#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:58,531 INFO L273 TraceCheckUtils]: 153: Hoare triple {36020#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {36021#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:58,532 INFO L273 TraceCheckUtils]: 154: Hoare triple {36021#(<= main_~i~0 37)} assume true; {36021#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:58,532 INFO L273 TraceCheckUtils]: 155: Hoare triple {36021#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36021#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:58,533 INFO L273 TraceCheckUtils]: 156: Hoare triple {36021#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36021#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:58,533 INFO L273 TraceCheckUtils]: 157: Hoare triple {36021#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {36022#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:58,534 INFO L273 TraceCheckUtils]: 158: Hoare triple {36022#(<= main_~i~0 38)} assume true; {36022#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:58,534 INFO L273 TraceCheckUtils]: 159: Hoare triple {36022#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36022#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:58,535 INFO L273 TraceCheckUtils]: 160: Hoare triple {36022#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36022#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:58,536 INFO L273 TraceCheckUtils]: 161: Hoare triple {36022#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {36023#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:58,536 INFO L273 TraceCheckUtils]: 162: Hoare triple {36023#(<= main_~i~0 39)} assume true; {36023#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:58,537 INFO L273 TraceCheckUtils]: 163: Hoare triple {36023#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36023#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:58,537 INFO L273 TraceCheckUtils]: 164: Hoare triple {36023#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36023#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:58,538 INFO L273 TraceCheckUtils]: 165: Hoare triple {36023#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {36024#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:58,538 INFO L273 TraceCheckUtils]: 166: Hoare triple {36024#(<= main_~i~0 40)} assume true; {36024#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:58,539 INFO L273 TraceCheckUtils]: 167: Hoare triple {36024#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36024#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:58,539 INFO L273 TraceCheckUtils]: 168: Hoare triple {36024#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36024#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:58,540 INFO L273 TraceCheckUtils]: 169: Hoare triple {36024#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {36025#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:58,540 INFO L273 TraceCheckUtils]: 170: Hoare triple {36025#(<= main_~i~0 41)} assume true; {36025#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:58,541 INFO L273 TraceCheckUtils]: 171: Hoare triple {36025#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36025#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:58,541 INFO L273 TraceCheckUtils]: 172: Hoare triple {36025#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36025#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:58,542 INFO L273 TraceCheckUtils]: 173: Hoare triple {36025#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {36026#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:58,543 INFO L273 TraceCheckUtils]: 174: Hoare triple {36026#(<= main_~i~0 42)} assume true; {36026#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:58,543 INFO L273 TraceCheckUtils]: 175: Hoare triple {36026#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36026#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:58,544 INFO L273 TraceCheckUtils]: 176: Hoare triple {36026#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36026#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:58,544 INFO L273 TraceCheckUtils]: 177: Hoare triple {36026#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {36027#(<= main_~i~0 43)} is VALID [2018-11-18 22:57:58,545 INFO L273 TraceCheckUtils]: 178: Hoare triple {36027#(<= main_~i~0 43)} assume true; {36027#(<= main_~i~0 43)} is VALID [2018-11-18 22:57:58,546 INFO L273 TraceCheckUtils]: 179: Hoare triple {36027#(<= main_~i~0 43)} assume !(~i~0 < 100000); {35983#false} is VALID [2018-11-18 22:57:58,546 INFO L273 TraceCheckUtils]: 180: Hoare triple {35983#false} havoc ~x~0;~x~0 := 0; {35983#false} is VALID [2018-11-18 22:57:58,546 INFO L273 TraceCheckUtils]: 181: Hoare triple {35983#false} assume true; {35983#false} is VALID [2018-11-18 22:57:58,546 INFO L273 TraceCheckUtils]: 182: Hoare triple {35983#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {35983#false} is VALID [2018-11-18 22:57:58,546 INFO L256 TraceCheckUtils]: 183: Hoare triple {35983#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {35983#false} is VALID [2018-11-18 22:57:58,546 INFO L273 TraceCheckUtils]: 184: Hoare triple {35983#false} ~cond := #in~cond; {35983#false} is VALID [2018-11-18 22:57:58,547 INFO L273 TraceCheckUtils]: 185: Hoare triple {35983#false} assume 0 == ~cond; {35983#false} is VALID [2018-11-18 22:57:58,547 INFO L273 TraceCheckUtils]: 186: Hoare triple {35983#false} assume !false; {35983#false} is VALID [2018-11-18 22:57:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:58,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:58,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:58,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:58,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:59,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {35982#true} call ULTIMATE.init(); {35982#true} is VALID [2018-11-18 22:57:59,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {35982#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35982#true} is VALID [2018-11-18 22:57:59,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {35982#true} assume true; {35982#true} is VALID [2018-11-18 22:57:59,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35982#true} {35982#true} #57#return; {35982#true} is VALID [2018-11-18 22:57:59,587 INFO L256 TraceCheckUtils]: 4: Hoare triple {35982#true} call #t~ret4 := main(); {35982#true} is VALID [2018-11-18 22:57:59,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {35982#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {36046#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:59,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {36046#(<= main_~i~0 0)} assume true; {36046#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:59,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {36046#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36046#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:59,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {36046#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36046#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:59,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {36046#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {35985#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:59,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {35985#(<= main_~i~0 1)} assume true; {35985#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:59,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {35985#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35985#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:59,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {35985#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35985#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:59,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {35985#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {35986#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:59,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {35986#(<= main_~i~0 2)} assume true; {35986#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:59,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {35986#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35986#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:59,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {35986#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35986#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:59,593 INFO L273 TraceCheckUtils]: 17: Hoare triple {35986#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {35987#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:59,594 INFO L273 TraceCheckUtils]: 18: Hoare triple {35987#(<= main_~i~0 3)} assume true; {35987#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:59,594 INFO L273 TraceCheckUtils]: 19: Hoare triple {35987#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35987#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:59,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {35987#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35987#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:59,595 INFO L273 TraceCheckUtils]: 21: Hoare triple {35987#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {35988#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:59,596 INFO L273 TraceCheckUtils]: 22: Hoare triple {35988#(<= main_~i~0 4)} assume true; {35988#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:59,596 INFO L273 TraceCheckUtils]: 23: Hoare triple {35988#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35988#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:59,597 INFO L273 TraceCheckUtils]: 24: Hoare triple {35988#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35988#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:59,598 INFO L273 TraceCheckUtils]: 25: Hoare triple {35988#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {35989#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:59,598 INFO L273 TraceCheckUtils]: 26: Hoare triple {35989#(<= main_~i~0 5)} assume true; {35989#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:59,599 INFO L273 TraceCheckUtils]: 27: Hoare triple {35989#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35989#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:59,599 INFO L273 TraceCheckUtils]: 28: Hoare triple {35989#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35989#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:59,600 INFO L273 TraceCheckUtils]: 29: Hoare triple {35989#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {35990#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:59,600 INFO L273 TraceCheckUtils]: 30: Hoare triple {35990#(<= main_~i~0 6)} assume true; {35990#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:59,601 INFO L273 TraceCheckUtils]: 31: Hoare triple {35990#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35990#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:59,601 INFO L273 TraceCheckUtils]: 32: Hoare triple {35990#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35990#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:59,602 INFO L273 TraceCheckUtils]: 33: Hoare triple {35990#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {35991#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:59,602 INFO L273 TraceCheckUtils]: 34: Hoare triple {35991#(<= main_~i~0 7)} assume true; {35991#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:59,603 INFO L273 TraceCheckUtils]: 35: Hoare triple {35991#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35991#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:59,603 INFO L273 TraceCheckUtils]: 36: Hoare triple {35991#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35991#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:59,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {35991#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {35992#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:59,605 INFO L273 TraceCheckUtils]: 38: Hoare triple {35992#(<= main_~i~0 8)} assume true; {35992#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:59,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {35992#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35992#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:59,606 INFO L273 TraceCheckUtils]: 40: Hoare triple {35992#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35992#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:59,606 INFO L273 TraceCheckUtils]: 41: Hoare triple {35992#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {35993#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:59,607 INFO L273 TraceCheckUtils]: 42: Hoare triple {35993#(<= main_~i~0 9)} assume true; {35993#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:59,607 INFO L273 TraceCheckUtils]: 43: Hoare triple {35993#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35993#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:59,608 INFO L273 TraceCheckUtils]: 44: Hoare triple {35993#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35993#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:59,609 INFO L273 TraceCheckUtils]: 45: Hoare triple {35993#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {35994#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:59,609 INFO L273 TraceCheckUtils]: 46: Hoare triple {35994#(<= main_~i~0 10)} assume true; {35994#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:59,610 INFO L273 TraceCheckUtils]: 47: Hoare triple {35994#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35994#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:59,610 INFO L273 TraceCheckUtils]: 48: Hoare triple {35994#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35994#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:59,611 INFO L273 TraceCheckUtils]: 49: Hoare triple {35994#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {35995#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:59,611 INFO L273 TraceCheckUtils]: 50: Hoare triple {35995#(<= main_~i~0 11)} assume true; {35995#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:59,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {35995#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35995#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:59,612 INFO L273 TraceCheckUtils]: 52: Hoare triple {35995#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35995#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:59,613 INFO L273 TraceCheckUtils]: 53: Hoare triple {35995#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {35996#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:59,613 INFO L273 TraceCheckUtils]: 54: Hoare triple {35996#(<= main_~i~0 12)} assume true; {35996#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:59,614 INFO L273 TraceCheckUtils]: 55: Hoare triple {35996#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35996#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:59,614 INFO L273 TraceCheckUtils]: 56: Hoare triple {35996#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35996#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:59,615 INFO L273 TraceCheckUtils]: 57: Hoare triple {35996#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {35997#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:59,616 INFO L273 TraceCheckUtils]: 58: Hoare triple {35997#(<= main_~i~0 13)} assume true; {35997#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:59,616 INFO L273 TraceCheckUtils]: 59: Hoare triple {35997#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35997#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:59,617 INFO L273 TraceCheckUtils]: 60: Hoare triple {35997#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35997#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:59,617 INFO L273 TraceCheckUtils]: 61: Hoare triple {35997#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {35998#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:59,618 INFO L273 TraceCheckUtils]: 62: Hoare triple {35998#(<= main_~i~0 14)} assume true; {35998#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:59,618 INFO L273 TraceCheckUtils]: 63: Hoare triple {35998#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35998#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:59,619 INFO L273 TraceCheckUtils]: 64: Hoare triple {35998#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35998#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:59,620 INFO L273 TraceCheckUtils]: 65: Hoare triple {35998#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {35999#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:59,620 INFO L273 TraceCheckUtils]: 66: Hoare triple {35999#(<= main_~i~0 15)} assume true; {35999#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:59,621 INFO L273 TraceCheckUtils]: 67: Hoare triple {35999#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35999#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:59,621 INFO L273 TraceCheckUtils]: 68: Hoare triple {35999#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35999#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:59,622 INFO L273 TraceCheckUtils]: 69: Hoare triple {35999#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {36000#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:59,622 INFO L273 TraceCheckUtils]: 70: Hoare triple {36000#(<= main_~i~0 16)} assume true; {36000#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:59,623 INFO L273 TraceCheckUtils]: 71: Hoare triple {36000#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36000#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:59,623 INFO L273 TraceCheckUtils]: 72: Hoare triple {36000#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36000#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:59,624 INFO L273 TraceCheckUtils]: 73: Hoare triple {36000#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {36001#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:59,624 INFO L273 TraceCheckUtils]: 74: Hoare triple {36001#(<= main_~i~0 17)} assume true; {36001#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:59,625 INFO L273 TraceCheckUtils]: 75: Hoare triple {36001#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36001#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:59,625 INFO L273 TraceCheckUtils]: 76: Hoare triple {36001#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36001#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:59,626 INFO L273 TraceCheckUtils]: 77: Hoare triple {36001#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {36002#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:59,627 INFO L273 TraceCheckUtils]: 78: Hoare triple {36002#(<= main_~i~0 18)} assume true; {36002#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:59,627 INFO L273 TraceCheckUtils]: 79: Hoare triple {36002#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36002#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:59,628 INFO L273 TraceCheckUtils]: 80: Hoare triple {36002#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36002#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:59,628 INFO L273 TraceCheckUtils]: 81: Hoare triple {36002#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {36003#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:59,629 INFO L273 TraceCheckUtils]: 82: Hoare triple {36003#(<= main_~i~0 19)} assume true; {36003#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:59,629 INFO L273 TraceCheckUtils]: 83: Hoare triple {36003#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36003#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:59,630 INFO L273 TraceCheckUtils]: 84: Hoare triple {36003#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36003#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:59,631 INFO L273 TraceCheckUtils]: 85: Hoare triple {36003#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {36004#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:59,631 INFO L273 TraceCheckUtils]: 86: Hoare triple {36004#(<= main_~i~0 20)} assume true; {36004#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:59,632 INFO L273 TraceCheckUtils]: 87: Hoare triple {36004#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36004#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:59,632 INFO L273 TraceCheckUtils]: 88: Hoare triple {36004#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36004#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:59,633 INFO L273 TraceCheckUtils]: 89: Hoare triple {36004#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {36005#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:59,633 INFO L273 TraceCheckUtils]: 90: Hoare triple {36005#(<= main_~i~0 21)} assume true; {36005#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:59,634 INFO L273 TraceCheckUtils]: 91: Hoare triple {36005#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36005#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:59,634 INFO L273 TraceCheckUtils]: 92: Hoare triple {36005#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36005#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:59,635 INFO L273 TraceCheckUtils]: 93: Hoare triple {36005#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {36006#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:59,636 INFO L273 TraceCheckUtils]: 94: Hoare triple {36006#(<= main_~i~0 22)} assume true; {36006#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:59,636 INFO L273 TraceCheckUtils]: 95: Hoare triple {36006#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36006#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:59,636 INFO L273 TraceCheckUtils]: 96: Hoare triple {36006#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36006#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:59,637 INFO L273 TraceCheckUtils]: 97: Hoare triple {36006#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {36007#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:59,638 INFO L273 TraceCheckUtils]: 98: Hoare triple {36007#(<= main_~i~0 23)} assume true; {36007#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:59,638 INFO L273 TraceCheckUtils]: 99: Hoare triple {36007#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36007#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:59,639 INFO L273 TraceCheckUtils]: 100: Hoare triple {36007#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36007#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:59,639 INFO L273 TraceCheckUtils]: 101: Hoare triple {36007#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {36008#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:59,640 INFO L273 TraceCheckUtils]: 102: Hoare triple {36008#(<= main_~i~0 24)} assume true; {36008#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:59,640 INFO L273 TraceCheckUtils]: 103: Hoare triple {36008#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36008#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:59,641 INFO L273 TraceCheckUtils]: 104: Hoare triple {36008#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36008#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:59,642 INFO L273 TraceCheckUtils]: 105: Hoare triple {36008#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {36009#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:59,642 INFO L273 TraceCheckUtils]: 106: Hoare triple {36009#(<= main_~i~0 25)} assume true; {36009#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:59,643 INFO L273 TraceCheckUtils]: 107: Hoare triple {36009#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36009#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:59,643 INFO L273 TraceCheckUtils]: 108: Hoare triple {36009#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36009#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:59,644 INFO L273 TraceCheckUtils]: 109: Hoare triple {36009#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {36010#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:59,644 INFO L273 TraceCheckUtils]: 110: Hoare triple {36010#(<= main_~i~0 26)} assume true; {36010#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:59,645 INFO L273 TraceCheckUtils]: 111: Hoare triple {36010#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36010#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:59,645 INFO L273 TraceCheckUtils]: 112: Hoare triple {36010#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36010#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:59,646 INFO L273 TraceCheckUtils]: 113: Hoare triple {36010#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {36011#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:59,647 INFO L273 TraceCheckUtils]: 114: Hoare triple {36011#(<= main_~i~0 27)} assume true; {36011#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:59,647 INFO L273 TraceCheckUtils]: 115: Hoare triple {36011#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36011#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:59,647 INFO L273 TraceCheckUtils]: 116: Hoare triple {36011#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36011#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:59,648 INFO L273 TraceCheckUtils]: 117: Hoare triple {36011#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {36012#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:59,649 INFO L273 TraceCheckUtils]: 118: Hoare triple {36012#(<= main_~i~0 28)} assume true; {36012#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:59,649 INFO L273 TraceCheckUtils]: 119: Hoare triple {36012#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36012#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:59,650 INFO L273 TraceCheckUtils]: 120: Hoare triple {36012#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36012#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:59,650 INFO L273 TraceCheckUtils]: 121: Hoare triple {36012#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {36013#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:59,651 INFO L273 TraceCheckUtils]: 122: Hoare triple {36013#(<= main_~i~0 29)} assume true; {36013#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:59,651 INFO L273 TraceCheckUtils]: 123: Hoare triple {36013#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36013#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:59,652 INFO L273 TraceCheckUtils]: 124: Hoare triple {36013#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36013#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:59,653 INFO L273 TraceCheckUtils]: 125: Hoare triple {36013#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {36014#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:59,653 INFO L273 TraceCheckUtils]: 126: Hoare triple {36014#(<= main_~i~0 30)} assume true; {36014#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:59,654 INFO L273 TraceCheckUtils]: 127: Hoare triple {36014#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36014#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:59,654 INFO L273 TraceCheckUtils]: 128: Hoare triple {36014#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36014#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:59,655 INFO L273 TraceCheckUtils]: 129: Hoare triple {36014#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {36015#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:59,655 INFO L273 TraceCheckUtils]: 130: Hoare triple {36015#(<= main_~i~0 31)} assume true; {36015#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:59,656 INFO L273 TraceCheckUtils]: 131: Hoare triple {36015#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36015#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:59,656 INFO L273 TraceCheckUtils]: 132: Hoare triple {36015#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36015#(<= main_~i~0 31)} is VALID [2018-11-18 22:57:59,657 INFO L273 TraceCheckUtils]: 133: Hoare triple {36015#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {36016#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:59,657 INFO L273 TraceCheckUtils]: 134: Hoare triple {36016#(<= main_~i~0 32)} assume true; {36016#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:59,658 INFO L273 TraceCheckUtils]: 135: Hoare triple {36016#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36016#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:59,658 INFO L273 TraceCheckUtils]: 136: Hoare triple {36016#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36016#(<= main_~i~0 32)} is VALID [2018-11-18 22:57:59,659 INFO L273 TraceCheckUtils]: 137: Hoare triple {36016#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {36017#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:59,660 INFO L273 TraceCheckUtils]: 138: Hoare triple {36017#(<= main_~i~0 33)} assume true; {36017#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:59,660 INFO L273 TraceCheckUtils]: 139: Hoare triple {36017#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36017#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:59,661 INFO L273 TraceCheckUtils]: 140: Hoare triple {36017#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36017#(<= main_~i~0 33)} is VALID [2018-11-18 22:57:59,661 INFO L273 TraceCheckUtils]: 141: Hoare triple {36017#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {36018#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:59,662 INFO L273 TraceCheckUtils]: 142: Hoare triple {36018#(<= main_~i~0 34)} assume true; {36018#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:59,662 INFO L273 TraceCheckUtils]: 143: Hoare triple {36018#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36018#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:59,663 INFO L273 TraceCheckUtils]: 144: Hoare triple {36018#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36018#(<= main_~i~0 34)} is VALID [2018-11-18 22:57:59,664 INFO L273 TraceCheckUtils]: 145: Hoare triple {36018#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {36019#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:59,664 INFO L273 TraceCheckUtils]: 146: Hoare triple {36019#(<= main_~i~0 35)} assume true; {36019#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:59,665 INFO L273 TraceCheckUtils]: 147: Hoare triple {36019#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36019#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:59,665 INFO L273 TraceCheckUtils]: 148: Hoare triple {36019#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36019#(<= main_~i~0 35)} is VALID [2018-11-18 22:57:59,666 INFO L273 TraceCheckUtils]: 149: Hoare triple {36019#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {36020#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:59,666 INFO L273 TraceCheckUtils]: 150: Hoare triple {36020#(<= main_~i~0 36)} assume true; {36020#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:59,667 INFO L273 TraceCheckUtils]: 151: Hoare triple {36020#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36020#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:59,667 INFO L273 TraceCheckUtils]: 152: Hoare triple {36020#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36020#(<= main_~i~0 36)} is VALID [2018-11-18 22:57:59,668 INFO L273 TraceCheckUtils]: 153: Hoare triple {36020#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {36021#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:59,668 INFO L273 TraceCheckUtils]: 154: Hoare triple {36021#(<= main_~i~0 37)} assume true; {36021#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:59,669 INFO L273 TraceCheckUtils]: 155: Hoare triple {36021#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36021#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:59,669 INFO L273 TraceCheckUtils]: 156: Hoare triple {36021#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36021#(<= main_~i~0 37)} is VALID [2018-11-18 22:57:59,670 INFO L273 TraceCheckUtils]: 157: Hoare triple {36021#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {36022#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:59,671 INFO L273 TraceCheckUtils]: 158: Hoare triple {36022#(<= main_~i~0 38)} assume true; {36022#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:59,671 INFO L273 TraceCheckUtils]: 159: Hoare triple {36022#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36022#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:59,672 INFO L273 TraceCheckUtils]: 160: Hoare triple {36022#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36022#(<= main_~i~0 38)} is VALID [2018-11-18 22:57:59,672 INFO L273 TraceCheckUtils]: 161: Hoare triple {36022#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {36023#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:59,673 INFO L273 TraceCheckUtils]: 162: Hoare triple {36023#(<= main_~i~0 39)} assume true; {36023#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:59,673 INFO L273 TraceCheckUtils]: 163: Hoare triple {36023#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36023#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:59,674 INFO L273 TraceCheckUtils]: 164: Hoare triple {36023#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36023#(<= main_~i~0 39)} is VALID [2018-11-18 22:57:59,675 INFO L273 TraceCheckUtils]: 165: Hoare triple {36023#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {36024#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:59,675 INFO L273 TraceCheckUtils]: 166: Hoare triple {36024#(<= main_~i~0 40)} assume true; {36024#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:59,676 INFO L273 TraceCheckUtils]: 167: Hoare triple {36024#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36024#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:59,676 INFO L273 TraceCheckUtils]: 168: Hoare triple {36024#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36024#(<= main_~i~0 40)} is VALID [2018-11-18 22:57:59,677 INFO L273 TraceCheckUtils]: 169: Hoare triple {36024#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {36025#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:59,677 INFO L273 TraceCheckUtils]: 170: Hoare triple {36025#(<= main_~i~0 41)} assume true; {36025#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:59,678 INFO L273 TraceCheckUtils]: 171: Hoare triple {36025#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36025#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:59,678 INFO L273 TraceCheckUtils]: 172: Hoare triple {36025#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36025#(<= main_~i~0 41)} is VALID [2018-11-18 22:57:59,679 INFO L273 TraceCheckUtils]: 173: Hoare triple {36025#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {36026#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:59,680 INFO L273 TraceCheckUtils]: 174: Hoare triple {36026#(<= main_~i~0 42)} assume true; {36026#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:59,680 INFO L273 TraceCheckUtils]: 175: Hoare triple {36026#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36026#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:59,681 INFO L273 TraceCheckUtils]: 176: Hoare triple {36026#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36026#(<= main_~i~0 42)} is VALID [2018-11-18 22:57:59,681 INFO L273 TraceCheckUtils]: 177: Hoare triple {36026#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {36027#(<= main_~i~0 43)} is VALID [2018-11-18 22:57:59,682 INFO L273 TraceCheckUtils]: 178: Hoare triple {36027#(<= main_~i~0 43)} assume true; {36027#(<= main_~i~0 43)} is VALID [2018-11-18 22:57:59,682 INFO L273 TraceCheckUtils]: 179: Hoare triple {36027#(<= main_~i~0 43)} assume !(~i~0 < 100000); {35983#false} is VALID [2018-11-18 22:57:59,683 INFO L273 TraceCheckUtils]: 180: Hoare triple {35983#false} havoc ~x~0;~x~0 := 0; {35983#false} is VALID [2018-11-18 22:57:59,683 INFO L273 TraceCheckUtils]: 181: Hoare triple {35983#false} assume true; {35983#false} is VALID [2018-11-18 22:57:59,683 INFO L273 TraceCheckUtils]: 182: Hoare triple {35983#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {35983#false} is VALID [2018-11-18 22:57:59,683 INFO L256 TraceCheckUtils]: 183: Hoare triple {35983#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {35983#false} is VALID [2018-11-18 22:57:59,683 INFO L273 TraceCheckUtils]: 184: Hoare triple {35983#false} ~cond := #in~cond; {35983#false} is VALID [2018-11-18 22:57:59,684 INFO L273 TraceCheckUtils]: 185: Hoare triple {35983#false} assume 0 == ~cond; {35983#false} is VALID [2018-11-18 22:57:59,684 INFO L273 TraceCheckUtils]: 186: Hoare triple {35983#false} assume !false; {35983#false} is VALID [2018-11-18 22:57:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:59,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:59,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-11-18 22:57:59,729 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 187 [2018-11-18 22:57:59,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:59,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-18 22:57:59,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:59,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-18 22:57:59,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-18 22:57:59,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 22:57:59,906 INFO L87 Difference]: Start difference. First operand 192 states and 236 transitions. Second operand 47 states. [2018-11-18 22:58:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:00,948 INFO L93 Difference]: Finished difference Result 210 states and 257 transitions. [2018-11-18 22:58:00,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 22:58:00,948 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 187 [2018-11-18 22:58:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:58:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 257 transitions. [2018-11-18 22:58:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:58:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 257 transitions. [2018-11-18 22:58:00,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 257 transitions. [2018-11-18 22:58:01,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:01,187 INFO L225 Difference]: With dead ends: 210 [2018-11-18 22:58:01,187 INFO L226 Difference]: Without dead ends: 198 [2018-11-18 22:58:01,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 22:58:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-18 22:58:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-11-18 22:58:01,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:01,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 196 states. [2018-11-18 22:58:01,225 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 196 states. [2018-11-18 22:58:01,225 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 196 states. [2018-11-18 22:58:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:01,229 INFO L93 Difference]: Finished difference Result 198 states and 244 transitions. [2018-11-18 22:58:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2018-11-18 22:58:01,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:01,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:01,229 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 198 states. [2018-11-18 22:58:01,229 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 198 states. [2018-11-18 22:58:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:01,232 INFO L93 Difference]: Finished difference Result 198 states and 244 transitions. [2018-11-18 22:58:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2018-11-18 22:58:01,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:01,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:01,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:01,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-18 22:58:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 241 transitions. [2018-11-18 22:58:01,235 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 241 transitions. Word has length 187 [2018-11-18 22:58:01,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:01,236 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 241 transitions. [2018-11-18 22:58:01,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-18 22:58:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 241 transitions. [2018-11-18 22:58:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-18 22:58:01,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:01,237 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:01,237 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:01,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:01,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1227790410, now seen corresponding path program 44 times [2018-11-18 22:58:01,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:01,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:01,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:58:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:02,642 INFO L256 TraceCheckUtils]: 0: Hoare triple {37498#true} call ULTIMATE.init(); {37498#true} is VALID [2018-11-18 22:58:02,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {37498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37498#true} is VALID [2018-11-18 22:58:02,642 INFO L273 TraceCheckUtils]: 2: Hoare triple {37498#true} assume true; {37498#true} is VALID [2018-11-18 22:58:02,643 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37498#true} {37498#true} #57#return; {37498#true} is VALID [2018-11-18 22:58:02,643 INFO L256 TraceCheckUtils]: 4: Hoare triple {37498#true} call #t~ret4 := main(); {37498#true} is VALID [2018-11-18 22:58:02,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {37498#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {37500#(= main_~i~0 0)} is VALID [2018-11-18 22:58:02,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {37500#(= main_~i~0 0)} assume true; {37500#(= main_~i~0 0)} is VALID [2018-11-18 22:58:02,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {37500#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37500#(= main_~i~0 0)} is VALID [2018-11-18 22:58:02,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {37500#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37500#(= main_~i~0 0)} is VALID [2018-11-18 22:58:02,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {37500#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {37501#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:02,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {37501#(<= main_~i~0 1)} assume true; {37501#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:02,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {37501#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37501#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:02,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {37501#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37501#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:02,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {37501#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {37502#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:02,648 INFO L273 TraceCheckUtils]: 14: Hoare triple {37502#(<= main_~i~0 2)} assume true; {37502#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:02,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {37502#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37502#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:02,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {37502#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37502#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:02,650 INFO L273 TraceCheckUtils]: 17: Hoare triple {37502#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {37503#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:02,650 INFO L273 TraceCheckUtils]: 18: Hoare triple {37503#(<= main_~i~0 3)} assume true; {37503#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:02,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {37503#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37503#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:02,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {37503#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37503#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:02,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {37503#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {37504#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:02,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {37504#(<= main_~i~0 4)} assume true; {37504#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:02,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {37504#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37504#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:02,653 INFO L273 TraceCheckUtils]: 24: Hoare triple {37504#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37504#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:02,654 INFO L273 TraceCheckUtils]: 25: Hoare triple {37504#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {37505#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:02,654 INFO L273 TraceCheckUtils]: 26: Hoare triple {37505#(<= main_~i~0 5)} assume true; {37505#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:02,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {37505#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37505#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:02,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {37505#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37505#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:02,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {37505#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {37506#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:02,656 INFO L273 TraceCheckUtils]: 30: Hoare triple {37506#(<= main_~i~0 6)} assume true; {37506#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:02,657 INFO L273 TraceCheckUtils]: 31: Hoare triple {37506#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37506#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:02,657 INFO L273 TraceCheckUtils]: 32: Hoare triple {37506#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37506#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:02,658 INFO L273 TraceCheckUtils]: 33: Hoare triple {37506#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {37507#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:02,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {37507#(<= main_~i~0 7)} assume true; {37507#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:02,659 INFO L273 TraceCheckUtils]: 35: Hoare triple {37507#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37507#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:02,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {37507#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37507#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:02,660 INFO L273 TraceCheckUtils]: 37: Hoare triple {37507#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {37508#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:02,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {37508#(<= main_~i~0 8)} assume true; {37508#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:02,661 INFO L273 TraceCheckUtils]: 39: Hoare triple {37508#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37508#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:02,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {37508#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37508#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:02,662 INFO L273 TraceCheckUtils]: 41: Hoare triple {37508#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {37509#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:02,663 INFO L273 TraceCheckUtils]: 42: Hoare triple {37509#(<= main_~i~0 9)} assume true; {37509#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:02,663 INFO L273 TraceCheckUtils]: 43: Hoare triple {37509#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37509#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:02,663 INFO L273 TraceCheckUtils]: 44: Hoare triple {37509#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37509#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:02,664 INFO L273 TraceCheckUtils]: 45: Hoare triple {37509#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {37510#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:02,665 INFO L273 TraceCheckUtils]: 46: Hoare triple {37510#(<= main_~i~0 10)} assume true; {37510#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:02,665 INFO L273 TraceCheckUtils]: 47: Hoare triple {37510#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37510#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:02,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {37510#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37510#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:02,666 INFO L273 TraceCheckUtils]: 49: Hoare triple {37510#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {37511#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:02,667 INFO L273 TraceCheckUtils]: 50: Hoare triple {37511#(<= main_~i~0 11)} assume true; {37511#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:02,667 INFO L273 TraceCheckUtils]: 51: Hoare triple {37511#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37511#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:02,668 INFO L273 TraceCheckUtils]: 52: Hoare triple {37511#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37511#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:02,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {37511#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {37512#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:02,669 INFO L273 TraceCheckUtils]: 54: Hoare triple {37512#(<= main_~i~0 12)} assume true; {37512#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:02,669 INFO L273 TraceCheckUtils]: 55: Hoare triple {37512#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37512#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:02,670 INFO L273 TraceCheckUtils]: 56: Hoare triple {37512#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37512#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:02,670 INFO L273 TraceCheckUtils]: 57: Hoare triple {37512#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {37513#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:02,671 INFO L273 TraceCheckUtils]: 58: Hoare triple {37513#(<= main_~i~0 13)} assume true; {37513#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:02,671 INFO L273 TraceCheckUtils]: 59: Hoare triple {37513#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37513#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:02,672 INFO L273 TraceCheckUtils]: 60: Hoare triple {37513#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37513#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:02,672 INFO L273 TraceCheckUtils]: 61: Hoare triple {37513#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {37514#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:02,673 INFO L273 TraceCheckUtils]: 62: Hoare triple {37514#(<= main_~i~0 14)} assume true; {37514#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:02,673 INFO L273 TraceCheckUtils]: 63: Hoare triple {37514#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37514#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:02,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {37514#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37514#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:02,674 INFO L273 TraceCheckUtils]: 65: Hoare triple {37514#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {37515#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:02,675 INFO L273 TraceCheckUtils]: 66: Hoare triple {37515#(<= main_~i~0 15)} assume true; {37515#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:02,675 INFO L273 TraceCheckUtils]: 67: Hoare triple {37515#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37515#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:02,676 INFO L273 TraceCheckUtils]: 68: Hoare triple {37515#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37515#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:02,677 INFO L273 TraceCheckUtils]: 69: Hoare triple {37515#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {37516#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:02,677 INFO L273 TraceCheckUtils]: 70: Hoare triple {37516#(<= main_~i~0 16)} assume true; {37516#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:02,677 INFO L273 TraceCheckUtils]: 71: Hoare triple {37516#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37516#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:02,678 INFO L273 TraceCheckUtils]: 72: Hoare triple {37516#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37516#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:02,679 INFO L273 TraceCheckUtils]: 73: Hoare triple {37516#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {37517#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:02,679 INFO L273 TraceCheckUtils]: 74: Hoare triple {37517#(<= main_~i~0 17)} assume true; {37517#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:02,680 INFO L273 TraceCheckUtils]: 75: Hoare triple {37517#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37517#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:02,680 INFO L273 TraceCheckUtils]: 76: Hoare triple {37517#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37517#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:02,681 INFO L273 TraceCheckUtils]: 77: Hoare triple {37517#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {37518#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:02,681 INFO L273 TraceCheckUtils]: 78: Hoare triple {37518#(<= main_~i~0 18)} assume true; {37518#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:02,682 INFO L273 TraceCheckUtils]: 79: Hoare triple {37518#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37518#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:02,682 INFO L273 TraceCheckUtils]: 80: Hoare triple {37518#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37518#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:02,683 INFO L273 TraceCheckUtils]: 81: Hoare triple {37518#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {37519#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:02,683 INFO L273 TraceCheckUtils]: 82: Hoare triple {37519#(<= main_~i~0 19)} assume true; {37519#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:02,684 INFO L273 TraceCheckUtils]: 83: Hoare triple {37519#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37519#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:02,684 INFO L273 TraceCheckUtils]: 84: Hoare triple {37519#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37519#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:02,685 INFO L273 TraceCheckUtils]: 85: Hoare triple {37519#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {37520#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:02,685 INFO L273 TraceCheckUtils]: 86: Hoare triple {37520#(<= main_~i~0 20)} assume true; {37520#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:02,686 INFO L273 TraceCheckUtils]: 87: Hoare triple {37520#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37520#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:02,686 INFO L273 TraceCheckUtils]: 88: Hoare triple {37520#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37520#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:02,687 INFO L273 TraceCheckUtils]: 89: Hoare triple {37520#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {37521#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:02,687 INFO L273 TraceCheckUtils]: 90: Hoare triple {37521#(<= main_~i~0 21)} assume true; {37521#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:02,688 INFO L273 TraceCheckUtils]: 91: Hoare triple {37521#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37521#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:02,688 INFO L273 TraceCheckUtils]: 92: Hoare triple {37521#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37521#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:02,689 INFO L273 TraceCheckUtils]: 93: Hoare triple {37521#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {37522#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:02,689 INFO L273 TraceCheckUtils]: 94: Hoare triple {37522#(<= main_~i~0 22)} assume true; {37522#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:02,690 INFO L273 TraceCheckUtils]: 95: Hoare triple {37522#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37522#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:02,690 INFO L273 TraceCheckUtils]: 96: Hoare triple {37522#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37522#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:02,691 INFO L273 TraceCheckUtils]: 97: Hoare triple {37522#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {37523#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:02,692 INFO L273 TraceCheckUtils]: 98: Hoare triple {37523#(<= main_~i~0 23)} assume true; {37523#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:02,692 INFO L273 TraceCheckUtils]: 99: Hoare triple {37523#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37523#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:02,692 INFO L273 TraceCheckUtils]: 100: Hoare triple {37523#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37523#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:02,693 INFO L273 TraceCheckUtils]: 101: Hoare triple {37523#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {37524#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:02,694 INFO L273 TraceCheckUtils]: 102: Hoare triple {37524#(<= main_~i~0 24)} assume true; {37524#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:02,694 INFO L273 TraceCheckUtils]: 103: Hoare triple {37524#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37524#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:02,695 INFO L273 TraceCheckUtils]: 104: Hoare triple {37524#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37524#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:02,695 INFO L273 TraceCheckUtils]: 105: Hoare triple {37524#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {37525#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:02,696 INFO L273 TraceCheckUtils]: 106: Hoare triple {37525#(<= main_~i~0 25)} assume true; {37525#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:02,696 INFO L273 TraceCheckUtils]: 107: Hoare triple {37525#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37525#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:02,697 INFO L273 TraceCheckUtils]: 108: Hoare triple {37525#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37525#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:02,697 INFO L273 TraceCheckUtils]: 109: Hoare triple {37525#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {37526#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:02,698 INFO L273 TraceCheckUtils]: 110: Hoare triple {37526#(<= main_~i~0 26)} assume true; {37526#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:02,698 INFO L273 TraceCheckUtils]: 111: Hoare triple {37526#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37526#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:02,699 INFO L273 TraceCheckUtils]: 112: Hoare triple {37526#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37526#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:02,699 INFO L273 TraceCheckUtils]: 113: Hoare triple {37526#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {37527#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:02,700 INFO L273 TraceCheckUtils]: 114: Hoare triple {37527#(<= main_~i~0 27)} assume true; {37527#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:02,700 INFO L273 TraceCheckUtils]: 115: Hoare triple {37527#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37527#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:02,701 INFO L273 TraceCheckUtils]: 116: Hoare triple {37527#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37527#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:02,702 INFO L273 TraceCheckUtils]: 117: Hoare triple {37527#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {37528#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:02,702 INFO L273 TraceCheckUtils]: 118: Hoare triple {37528#(<= main_~i~0 28)} assume true; {37528#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:02,702 INFO L273 TraceCheckUtils]: 119: Hoare triple {37528#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37528#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:02,703 INFO L273 TraceCheckUtils]: 120: Hoare triple {37528#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37528#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:02,704 INFO L273 TraceCheckUtils]: 121: Hoare triple {37528#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {37529#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:02,704 INFO L273 TraceCheckUtils]: 122: Hoare triple {37529#(<= main_~i~0 29)} assume true; {37529#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:02,705 INFO L273 TraceCheckUtils]: 123: Hoare triple {37529#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37529#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:02,705 INFO L273 TraceCheckUtils]: 124: Hoare triple {37529#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37529#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:02,706 INFO L273 TraceCheckUtils]: 125: Hoare triple {37529#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {37530#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:02,706 INFO L273 TraceCheckUtils]: 126: Hoare triple {37530#(<= main_~i~0 30)} assume true; {37530#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:02,707 INFO L273 TraceCheckUtils]: 127: Hoare triple {37530#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37530#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:02,707 INFO L273 TraceCheckUtils]: 128: Hoare triple {37530#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37530#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:02,708 INFO L273 TraceCheckUtils]: 129: Hoare triple {37530#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {37531#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:02,708 INFO L273 TraceCheckUtils]: 130: Hoare triple {37531#(<= main_~i~0 31)} assume true; {37531#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:02,709 INFO L273 TraceCheckUtils]: 131: Hoare triple {37531#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37531#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:02,709 INFO L273 TraceCheckUtils]: 132: Hoare triple {37531#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37531#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:02,710 INFO L273 TraceCheckUtils]: 133: Hoare triple {37531#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {37532#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:02,710 INFO L273 TraceCheckUtils]: 134: Hoare triple {37532#(<= main_~i~0 32)} assume true; {37532#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:02,711 INFO L273 TraceCheckUtils]: 135: Hoare triple {37532#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37532#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:02,711 INFO L273 TraceCheckUtils]: 136: Hoare triple {37532#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37532#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:02,712 INFO L273 TraceCheckUtils]: 137: Hoare triple {37532#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {37533#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:02,712 INFO L273 TraceCheckUtils]: 138: Hoare triple {37533#(<= main_~i~0 33)} assume true; {37533#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:02,713 INFO L273 TraceCheckUtils]: 139: Hoare triple {37533#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37533#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:02,713 INFO L273 TraceCheckUtils]: 140: Hoare triple {37533#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37533#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:02,714 INFO L273 TraceCheckUtils]: 141: Hoare triple {37533#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {37534#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:02,714 INFO L273 TraceCheckUtils]: 142: Hoare triple {37534#(<= main_~i~0 34)} assume true; {37534#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:02,715 INFO L273 TraceCheckUtils]: 143: Hoare triple {37534#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37534#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:02,715 INFO L273 TraceCheckUtils]: 144: Hoare triple {37534#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37534#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:02,716 INFO L273 TraceCheckUtils]: 145: Hoare triple {37534#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {37535#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:02,717 INFO L273 TraceCheckUtils]: 146: Hoare triple {37535#(<= main_~i~0 35)} assume true; {37535#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:02,717 INFO L273 TraceCheckUtils]: 147: Hoare triple {37535#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37535#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:02,717 INFO L273 TraceCheckUtils]: 148: Hoare triple {37535#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37535#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:02,718 INFO L273 TraceCheckUtils]: 149: Hoare triple {37535#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {37536#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:02,719 INFO L273 TraceCheckUtils]: 150: Hoare triple {37536#(<= main_~i~0 36)} assume true; {37536#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:02,719 INFO L273 TraceCheckUtils]: 151: Hoare triple {37536#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37536#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:02,720 INFO L273 TraceCheckUtils]: 152: Hoare triple {37536#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37536#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:02,720 INFO L273 TraceCheckUtils]: 153: Hoare triple {37536#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {37537#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:02,721 INFO L273 TraceCheckUtils]: 154: Hoare triple {37537#(<= main_~i~0 37)} assume true; {37537#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:02,721 INFO L273 TraceCheckUtils]: 155: Hoare triple {37537#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37537#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:02,722 INFO L273 TraceCheckUtils]: 156: Hoare triple {37537#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37537#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:02,722 INFO L273 TraceCheckUtils]: 157: Hoare triple {37537#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {37538#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:02,723 INFO L273 TraceCheckUtils]: 158: Hoare triple {37538#(<= main_~i~0 38)} assume true; {37538#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:02,723 INFO L273 TraceCheckUtils]: 159: Hoare triple {37538#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37538#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:02,724 INFO L273 TraceCheckUtils]: 160: Hoare triple {37538#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37538#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:02,724 INFO L273 TraceCheckUtils]: 161: Hoare triple {37538#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {37539#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:02,725 INFO L273 TraceCheckUtils]: 162: Hoare triple {37539#(<= main_~i~0 39)} assume true; {37539#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:02,725 INFO L273 TraceCheckUtils]: 163: Hoare triple {37539#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37539#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:02,726 INFO L273 TraceCheckUtils]: 164: Hoare triple {37539#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37539#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:02,726 INFO L273 TraceCheckUtils]: 165: Hoare triple {37539#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {37540#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:02,727 INFO L273 TraceCheckUtils]: 166: Hoare triple {37540#(<= main_~i~0 40)} assume true; {37540#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:02,727 INFO L273 TraceCheckUtils]: 167: Hoare triple {37540#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37540#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:02,728 INFO L273 TraceCheckUtils]: 168: Hoare triple {37540#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37540#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:02,729 INFO L273 TraceCheckUtils]: 169: Hoare triple {37540#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {37541#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:02,729 INFO L273 TraceCheckUtils]: 170: Hoare triple {37541#(<= main_~i~0 41)} assume true; {37541#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:02,729 INFO L273 TraceCheckUtils]: 171: Hoare triple {37541#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37541#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:02,730 INFO L273 TraceCheckUtils]: 172: Hoare triple {37541#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37541#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:02,731 INFO L273 TraceCheckUtils]: 173: Hoare triple {37541#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {37542#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:02,731 INFO L273 TraceCheckUtils]: 174: Hoare triple {37542#(<= main_~i~0 42)} assume true; {37542#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:02,732 INFO L273 TraceCheckUtils]: 175: Hoare triple {37542#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37542#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:02,732 INFO L273 TraceCheckUtils]: 176: Hoare triple {37542#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37542#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:02,733 INFO L273 TraceCheckUtils]: 177: Hoare triple {37542#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {37543#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:02,733 INFO L273 TraceCheckUtils]: 178: Hoare triple {37543#(<= main_~i~0 43)} assume true; {37543#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:02,734 INFO L273 TraceCheckUtils]: 179: Hoare triple {37543#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37543#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:02,734 INFO L273 TraceCheckUtils]: 180: Hoare triple {37543#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37543#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:02,735 INFO L273 TraceCheckUtils]: 181: Hoare triple {37543#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {37544#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:02,735 INFO L273 TraceCheckUtils]: 182: Hoare triple {37544#(<= main_~i~0 44)} assume true; {37544#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:02,736 INFO L273 TraceCheckUtils]: 183: Hoare triple {37544#(<= main_~i~0 44)} assume !(~i~0 < 100000); {37499#false} is VALID [2018-11-18 22:58:02,736 INFO L273 TraceCheckUtils]: 184: Hoare triple {37499#false} havoc ~x~0;~x~0 := 0; {37499#false} is VALID [2018-11-18 22:58:02,736 INFO L273 TraceCheckUtils]: 185: Hoare triple {37499#false} assume true; {37499#false} is VALID [2018-11-18 22:58:02,737 INFO L273 TraceCheckUtils]: 186: Hoare triple {37499#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {37499#false} is VALID [2018-11-18 22:58:02,737 INFO L256 TraceCheckUtils]: 187: Hoare triple {37499#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {37499#false} is VALID [2018-11-18 22:58:02,737 INFO L273 TraceCheckUtils]: 188: Hoare triple {37499#false} ~cond := #in~cond; {37499#false} is VALID [2018-11-18 22:58:02,737 INFO L273 TraceCheckUtils]: 189: Hoare triple {37499#false} assume 0 == ~cond; {37499#false} is VALID [2018-11-18 22:58:02,737 INFO L273 TraceCheckUtils]: 190: Hoare triple {37499#false} assume !false; {37499#false} is VALID [2018-11-18 22:58:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:02,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:02,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:02,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:58:02,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:58:02,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:02,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:04,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {37498#true} call ULTIMATE.init(); {37498#true} is VALID [2018-11-18 22:58:04,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {37498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37498#true} is VALID [2018-11-18 22:58:04,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {37498#true} assume true; {37498#true} is VALID [2018-11-18 22:58:04,202 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37498#true} {37498#true} #57#return; {37498#true} is VALID [2018-11-18 22:58:04,203 INFO L256 TraceCheckUtils]: 4: Hoare triple {37498#true} call #t~ret4 := main(); {37498#true} is VALID [2018-11-18 22:58:04,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {37498#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {37563#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:04,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {37563#(<= main_~i~0 0)} assume true; {37563#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:04,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {37563#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37563#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:04,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {37563#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37563#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:04,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {37563#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {37501#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:04,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {37501#(<= main_~i~0 1)} assume true; {37501#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:04,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {37501#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37501#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:04,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {37501#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37501#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:04,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {37501#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {37502#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:04,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {37502#(<= main_~i~0 2)} assume true; {37502#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:04,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {37502#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37502#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:04,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {37502#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37502#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:04,208 INFO L273 TraceCheckUtils]: 17: Hoare triple {37502#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {37503#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:04,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {37503#(<= main_~i~0 3)} assume true; {37503#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:04,209 INFO L273 TraceCheckUtils]: 19: Hoare triple {37503#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37503#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:04,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {37503#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37503#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:04,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {37503#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {37504#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:04,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {37504#(<= main_~i~0 4)} assume true; {37504#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:04,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {37504#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37504#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:04,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {37504#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37504#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:04,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {37504#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {37505#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:04,212 INFO L273 TraceCheckUtils]: 26: Hoare triple {37505#(<= main_~i~0 5)} assume true; {37505#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:04,213 INFO L273 TraceCheckUtils]: 27: Hoare triple {37505#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37505#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:04,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {37505#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37505#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:04,214 INFO L273 TraceCheckUtils]: 29: Hoare triple {37505#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {37506#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:04,214 INFO L273 TraceCheckUtils]: 30: Hoare triple {37506#(<= main_~i~0 6)} assume true; {37506#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:04,215 INFO L273 TraceCheckUtils]: 31: Hoare triple {37506#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37506#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:04,215 INFO L273 TraceCheckUtils]: 32: Hoare triple {37506#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37506#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:04,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {37506#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {37507#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:04,217 INFO L273 TraceCheckUtils]: 34: Hoare triple {37507#(<= main_~i~0 7)} assume true; {37507#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:04,217 INFO L273 TraceCheckUtils]: 35: Hoare triple {37507#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37507#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:04,217 INFO L273 TraceCheckUtils]: 36: Hoare triple {37507#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37507#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:04,218 INFO L273 TraceCheckUtils]: 37: Hoare triple {37507#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {37508#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:04,219 INFO L273 TraceCheckUtils]: 38: Hoare triple {37508#(<= main_~i~0 8)} assume true; {37508#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:04,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {37508#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37508#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:04,219 INFO L273 TraceCheckUtils]: 40: Hoare triple {37508#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37508#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:04,220 INFO L273 TraceCheckUtils]: 41: Hoare triple {37508#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {37509#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:04,221 INFO L273 TraceCheckUtils]: 42: Hoare triple {37509#(<= main_~i~0 9)} assume true; {37509#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:04,221 INFO L273 TraceCheckUtils]: 43: Hoare triple {37509#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37509#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:04,222 INFO L273 TraceCheckUtils]: 44: Hoare triple {37509#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37509#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:04,222 INFO L273 TraceCheckUtils]: 45: Hoare triple {37509#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {37510#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:04,223 INFO L273 TraceCheckUtils]: 46: Hoare triple {37510#(<= main_~i~0 10)} assume true; {37510#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:04,223 INFO L273 TraceCheckUtils]: 47: Hoare triple {37510#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37510#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:04,224 INFO L273 TraceCheckUtils]: 48: Hoare triple {37510#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37510#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:04,224 INFO L273 TraceCheckUtils]: 49: Hoare triple {37510#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {37511#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:04,225 INFO L273 TraceCheckUtils]: 50: Hoare triple {37511#(<= main_~i~0 11)} assume true; {37511#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:04,225 INFO L273 TraceCheckUtils]: 51: Hoare triple {37511#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37511#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:04,226 INFO L273 TraceCheckUtils]: 52: Hoare triple {37511#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37511#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:04,227 INFO L273 TraceCheckUtils]: 53: Hoare triple {37511#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {37512#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:04,227 INFO L273 TraceCheckUtils]: 54: Hoare triple {37512#(<= main_~i~0 12)} assume true; {37512#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:04,228 INFO L273 TraceCheckUtils]: 55: Hoare triple {37512#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37512#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:04,228 INFO L273 TraceCheckUtils]: 56: Hoare triple {37512#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37512#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:04,229 INFO L273 TraceCheckUtils]: 57: Hoare triple {37512#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {37513#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:04,229 INFO L273 TraceCheckUtils]: 58: Hoare triple {37513#(<= main_~i~0 13)} assume true; {37513#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:04,230 INFO L273 TraceCheckUtils]: 59: Hoare triple {37513#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37513#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:04,230 INFO L273 TraceCheckUtils]: 60: Hoare triple {37513#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37513#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:04,231 INFO L273 TraceCheckUtils]: 61: Hoare triple {37513#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {37514#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:04,232 INFO L273 TraceCheckUtils]: 62: Hoare triple {37514#(<= main_~i~0 14)} assume true; {37514#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:04,232 INFO L273 TraceCheckUtils]: 63: Hoare triple {37514#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37514#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:04,233 INFO L273 TraceCheckUtils]: 64: Hoare triple {37514#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37514#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:04,233 INFO L273 TraceCheckUtils]: 65: Hoare triple {37514#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {37515#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:04,234 INFO L273 TraceCheckUtils]: 66: Hoare triple {37515#(<= main_~i~0 15)} assume true; {37515#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:04,234 INFO L273 TraceCheckUtils]: 67: Hoare triple {37515#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37515#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:04,235 INFO L273 TraceCheckUtils]: 68: Hoare triple {37515#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37515#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:04,235 INFO L273 TraceCheckUtils]: 69: Hoare triple {37515#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {37516#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:04,236 INFO L273 TraceCheckUtils]: 70: Hoare triple {37516#(<= main_~i~0 16)} assume true; {37516#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:04,236 INFO L273 TraceCheckUtils]: 71: Hoare triple {37516#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37516#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:04,237 INFO L273 TraceCheckUtils]: 72: Hoare triple {37516#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37516#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:04,238 INFO L273 TraceCheckUtils]: 73: Hoare triple {37516#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {37517#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:04,238 INFO L273 TraceCheckUtils]: 74: Hoare triple {37517#(<= main_~i~0 17)} assume true; {37517#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:04,239 INFO L273 TraceCheckUtils]: 75: Hoare triple {37517#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37517#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:04,239 INFO L273 TraceCheckUtils]: 76: Hoare triple {37517#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37517#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:04,240 INFO L273 TraceCheckUtils]: 77: Hoare triple {37517#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {37518#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:04,240 INFO L273 TraceCheckUtils]: 78: Hoare triple {37518#(<= main_~i~0 18)} assume true; {37518#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:04,241 INFO L273 TraceCheckUtils]: 79: Hoare triple {37518#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37518#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:04,241 INFO L273 TraceCheckUtils]: 80: Hoare triple {37518#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37518#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:04,242 INFO L273 TraceCheckUtils]: 81: Hoare triple {37518#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {37519#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:04,243 INFO L273 TraceCheckUtils]: 82: Hoare triple {37519#(<= main_~i~0 19)} assume true; {37519#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:04,243 INFO L273 TraceCheckUtils]: 83: Hoare triple {37519#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37519#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:04,244 INFO L273 TraceCheckUtils]: 84: Hoare triple {37519#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37519#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:04,244 INFO L273 TraceCheckUtils]: 85: Hoare triple {37519#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {37520#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:04,245 INFO L273 TraceCheckUtils]: 86: Hoare triple {37520#(<= main_~i~0 20)} assume true; {37520#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:04,245 INFO L273 TraceCheckUtils]: 87: Hoare triple {37520#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37520#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:04,246 INFO L273 TraceCheckUtils]: 88: Hoare triple {37520#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37520#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:04,246 INFO L273 TraceCheckUtils]: 89: Hoare triple {37520#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {37521#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:04,247 INFO L273 TraceCheckUtils]: 90: Hoare triple {37521#(<= main_~i~0 21)} assume true; {37521#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:04,247 INFO L273 TraceCheckUtils]: 91: Hoare triple {37521#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37521#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:04,248 INFO L273 TraceCheckUtils]: 92: Hoare triple {37521#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37521#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:04,249 INFO L273 TraceCheckUtils]: 93: Hoare triple {37521#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {37522#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:04,249 INFO L273 TraceCheckUtils]: 94: Hoare triple {37522#(<= main_~i~0 22)} assume true; {37522#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:04,250 INFO L273 TraceCheckUtils]: 95: Hoare triple {37522#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37522#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:04,250 INFO L273 TraceCheckUtils]: 96: Hoare triple {37522#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37522#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:04,251 INFO L273 TraceCheckUtils]: 97: Hoare triple {37522#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {37523#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:04,251 INFO L273 TraceCheckUtils]: 98: Hoare triple {37523#(<= main_~i~0 23)} assume true; {37523#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:04,252 INFO L273 TraceCheckUtils]: 99: Hoare triple {37523#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37523#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:04,252 INFO L273 TraceCheckUtils]: 100: Hoare triple {37523#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37523#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:04,253 INFO L273 TraceCheckUtils]: 101: Hoare triple {37523#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {37524#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:04,254 INFO L273 TraceCheckUtils]: 102: Hoare triple {37524#(<= main_~i~0 24)} assume true; {37524#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:04,254 INFO L273 TraceCheckUtils]: 103: Hoare triple {37524#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37524#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:04,255 INFO L273 TraceCheckUtils]: 104: Hoare triple {37524#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37524#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:04,255 INFO L273 TraceCheckUtils]: 105: Hoare triple {37524#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {37525#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:04,256 INFO L273 TraceCheckUtils]: 106: Hoare triple {37525#(<= main_~i~0 25)} assume true; {37525#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:04,256 INFO L273 TraceCheckUtils]: 107: Hoare triple {37525#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37525#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:04,257 INFO L273 TraceCheckUtils]: 108: Hoare triple {37525#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37525#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:04,258 INFO L273 TraceCheckUtils]: 109: Hoare triple {37525#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {37526#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:04,258 INFO L273 TraceCheckUtils]: 110: Hoare triple {37526#(<= main_~i~0 26)} assume true; {37526#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:04,259 INFO L273 TraceCheckUtils]: 111: Hoare triple {37526#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37526#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:04,259 INFO L273 TraceCheckUtils]: 112: Hoare triple {37526#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37526#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:04,260 INFO L273 TraceCheckUtils]: 113: Hoare triple {37526#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {37527#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:04,260 INFO L273 TraceCheckUtils]: 114: Hoare triple {37527#(<= main_~i~0 27)} assume true; {37527#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:04,261 INFO L273 TraceCheckUtils]: 115: Hoare triple {37527#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37527#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:04,261 INFO L273 TraceCheckUtils]: 116: Hoare triple {37527#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37527#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:04,262 INFO L273 TraceCheckUtils]: 117: Hoare triple {37527#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {37528#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:04,263 INFO L273 TraceCheckUtils]: 118: Hoare triple {37528#(<= main_~i~0 28)} assume true; {37528#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:04,263 INFO L273 TraceCheckUtils]: 119: Hoare triple {37528#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37528#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:04,264 INFO L273 TraceCheckUtils]: 120: Hoare triple {37528#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37528#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:04,264 INFO L273 TraceCheckUtils]: 121: Hoare triple {37528#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {37529#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:04,265 INFO L273 TraceCheckUtils]: 122: Hoare triple {37529#(<= main_~i~0 29)} assume true; {37529#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:04,265 INFO L273 TraceCheckUtils]: 123: Hoare triple {37529#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37529#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:04,266 INFO L273 TraceCheckUtils]: 124: Hoare triple {37529#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37529#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:04,266 INFO L273 TraceCheckUtils]: 125: Hoare triple {37529#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {37530#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:04,267 INFO L273 TraceCheckUtils]: 126: Hoare triple {37530#(<= main_~i~0 30)} assume true; {37530#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:04,267 INFO L273 TraceCheckUtils]: 127: Hoare triple {37530#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37530#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:04,268 INFO L273 TraceCheckUtils]: 128: Hoare triple {37530#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37530#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:04,269 INFO L273 TraceCheckUtils]: 129: Hoare triple {37530#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {37531#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:04,269 INFO L273 TraceCheckUtils]: 130: Hoare triple {37531#(<= main_~i~0 31)} assume true; {37531#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:04,270 INFO L273 TraceCheckUtils]: 131: Hoare triple {37531#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37531#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:04,270 INFO L273 TraceCheckUtils]: 132: Hoare triple {37531#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37531#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:04,271 INFO L273 TraceCheckUtils]: 133: Hoare triple {37531#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {37532#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:04,271 INFO L273 TraceCheckUtils]: 134: Hoare triple {37532#(<= main_~i~0 32)} assume true; {37532#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:04,272 INFO L273 TraceCheckUtils]: 135: Hoare triple {37532#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37532#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:04,272 INFO L273 TraceCheckUtils]: 136: Hoare triple {37532#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37532#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:04,273 INFO L273 TraceCheckUtils]: 137: Hoare triple {37532#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {37533#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:04,274 INFO L273 TraceCheckUtils]: 138: Hoare triple {37533#(<= main_~i~0 33)} assume true; {37533#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:04,274 INFO L273 TraceCheckUtils]: 139: Hoare triple {37533#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37533#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:04,275 INFO L273 TraceCheckUtils]: 140: Hoare triple {37533#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37533#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:04,275 INFO L273 TraceCheckUtils]: 141: Hoare triple {37533#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {37534#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:04,276 INFO L273 TraceCheckUtils]: 142: Hoare triple {37534#(<= main_~i~0 34)} assume true; {37534#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:04,276 INFO L273 TraceCheckUtils]: 143: Hoare triple {37534#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37534#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:04,277 INFO L273 TraceCheckUtils]: 144: Hoare triple {37534#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37534#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:04,278 INFO L273 TraceCheckUtils]: 145: Hoare triple {37534#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {37535#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:04,278 INFO L273 TraceCheckUtils]: 146: Hoare triple {37535#(<= main_~i~0 35)} assume true; {37535#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:04,279 INFO L273 TraceCheckUtils]: 147: Hoare triple {37535#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37535#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:04,279 INFO L273 TraceCheckUtils]: 148: Hoare triple {37535#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37535#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:04,280 INFO L273 TraceCheckUtils]: 149: Hoare triple {37535#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {37536#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:04,280 INFO L273 TraceCheckUtils]: 150: Hoare triple {37536#(<= main_~i~0 36)} assume true; {37536#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:04,281 INFO L273 TraceCheckUtils]: 151: Hoare triple {37536#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37536#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:04,281 INFO L273 TraceCheckUtils]: 152: Hoare triple {37536#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37536#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:04,282 INFO L273 TraceCheckUtils]: 153: Hoare triple {37536#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {37537#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:04,283 INFO L273 TraceCheckUtils]: 154: Hoare triple {37537#(<= main_~i~0 37)} assume true; {37537#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:04,283 INFO L273 TraceCheckUtils]: 155: Hoare triple {37537#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37537#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:04,284 INFO L273 TraceCheckUtils]: 156: Hoare triple {37537#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37537#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:04,284 INFO L273 TraceCheckUtils]: 157: Hoare triple {37537#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {37538#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:04,285 INFO L273 TraceCheckUtils]: 158: Hoare triple {37538#(<= main_~i~0 38)} assume true; {37538#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:04,285 INFO L273 TraceCheckUtils]: 159: Hoare triple {37538#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37538#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:04,286 INFO L273 TraceCheckUtils]: 160: Hoare triple {37538#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37538#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:04,287 INFO L273 TraceCheckUtils]: 161: Hoare triple {37538#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {37539#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:04,287 INFO L273 TraceCheckUtils]: 162: Hoare triple {37539#(<= main_~i~0 39)} assume true; {37539#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:04,288 INFO L273 TraceCheckUtils]: 163: Hoare triple {37539#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37539#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:04,288 INFO L273 TraceCheckUtils]: 164: Hoare triple {37539#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37539#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:04,289 INFO L273 TraceCheckUtils]: 165: Hoare triple {37539#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {37540#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:04,289 INFO L273 TraceCheckUtils]: 166: Hoare triple {37540#(<= main_~i~0 40)} assume true; {37540#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:04,290 INFO L273 TraceCheckUtils]: 167: Hoare triple {37540#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37540#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:04,290 INFO L273 TraceCheckUtils]: 168: Hoare triple {37540#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37540#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:04,291 INFO L273 TraceCheckUtils]: 169: Hoare triple {37540#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {37541#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:04,291 INFO L273 TraceCheckUtils]: 170: Hoare triple {37541#(<= main_~i~0 41)} assume true; {37541#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:04,292 INFO L273 TraceCheckUtils]: 171: Hoare triple {37541#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37541#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:04,292 INFO L273 TraceCheckUtils]: 172: Hoare triple {37541#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37541#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:04,293 INFO L273 TraceCheckUtils]: 173: Hoare triple {37541#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {37542#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:04,294 INFO L273 TraceCheckUtils]: 174: Hoare triple {37542#(<= main_~i~0 42)} assume true; {37542#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:04,294 INFO L273 TraceCheckUtils]: 175: Hoare triple {37542#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37542#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:04,295 INFO L273 TraceCheckUtils]: 176: Hoare triple {37542#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37542#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:04,295 INFO L273 TraceCheckUtils]: 177: Hoare triple {37542#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {37543#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:04,296 INFO L273 TraceCheckUtils]: 178: Hoare triple {37543#(<= main_~i~0 43)} assume true; {37543#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:04,296 INFO L273 TraceCheckUtils]: 179: Hoare triple {37543#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37543#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:04,297 INFO L273 TraceCheckUtils]: 180: Hoare triple {37543#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37543#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:04,298 INFO L273 TraceCheckUtils]: 181: Hoare triple {37543#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {37544#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:04,298 INFO L273 TraceCheckUtils]: 182: Hoare triple {37544#(<= main_~i~0 44)} assume true; {37544#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:04,299 INFO L273 TraceCheckUtils]: 183: Hoare triple {37544#(<= main_~i~0 44)} assume !(~i~0 < 100000); {37499#false} is VALID [2018-11-18 22:58:04,299 INFO L273 TraceCheckUtils]: 184: Hoare triple {37499#false} havoc ~x~0;~x~0 := 0; {37499#false} is VALID [2018-11-18 22:58:04,299 INFO L273 TraceCheckUtils]: 185: Hoare triple {37499#false} assume true; {37499#false} is VALID [2018-11-18 22:58:04,299 INFO L273 TraceCheckUtils]: 186: Hoare triple {37499#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {37499#false} is VALID [2018-11-18 22:58:04,300 INFO L256 TraceCheckUtils]: 187: Hoare triple {37499#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {37499#false} is VALID [2018-11-18 22:58:04,300 INFO L273 TraceCheckUtils]: 188: Hoare triple {37499#false} ~cond := #in~cond; {37499#false} is VALID [2018-11-18 22:58:04,300 INFO L273 TraceCheckUtils]: 189: Hoare triple {37499#false} assume 0 == ~cond; {37499#false} is VALID [2018-11-18 22:58:04,300 INFO L273 TraceCheckUtils]: 190: Hoare triple {37499#false} assume !false; {37499#false} is VALID [2018-11-18 22:58:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:04,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:04,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2018-11-18 22:58:04,347 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 191 [2018-11-18 22:58:04,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:04,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-18 22:58:04,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:04,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-18 22:58:04,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-18 22:58:04,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 22:58:04,529 INFO L87 Difference]: Start difference. First operand 196 states and 241 transitions. Second operand 48 states. [2018-11-18 22:58:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:05,495 INFO L93 Difference]: Finished difference Result 214 states and 262 transitions. [2018-11-18 22:58:05,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-18 22:58:05,496 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 191 [2018-11-18 22:58:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:58:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 262 transitions. [2018-11-18 22:58:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:58:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 262 transitions. [2018-11-18 22:58:05,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 262 transitions. [2018-11-18 22:58:05,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:05,888 INFO L225 Difference]: With dead ends: 214 [2018-11-18 22:58:05,888 INFO L226 Difference]: Without dead ends: 202 [2018-11-18 22:58:05,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 22:58:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-18 22:58:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-11-18 22:58:05,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:05,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 200 states. [2018-11-18 22:58:05,926 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 200 states. [2018-11-18 22:58:05,926 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 200 states. [2018-11-18 22:58:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:05,929 INFO L93 Difference]: Finished difference Result 202 states and 249 transitions. [2018-11-18 22:58:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 249 transitions. [2018-11-18 22:58:05,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:05,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:05,929 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 202 states. [2018-11-18 22:58:05,930 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 202 states. [2018-11-18 22:58:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:05,932 INFO L93 Difference]: Finished difference Result 202 states and 249 transitions. [2018-11-18 22:58:05,932 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 249 transitions. [2018-11-18 22:58:05,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:05,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:05,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:05,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 22:58:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 246 transitions. [2018-11-18 22:58:05,936 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 246 transitions. Word has length 191 [2018-11-18 22:58:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:05,936 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 246 transitions. [2018-11-18 22:58:05,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-18 22:58:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 246 transitions. [2018-11-18 22:58:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-18 22:58:05,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:05,937 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:05,937 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:05,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:05,937 INFO L82 PathProgramCache]: Analyzing trace with hash -61341792, now seen corresponding path program 45 times [2018-11-18 22:58:05,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:05,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:05,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:05,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:05,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:07,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {39045#true} call ULTIMATE.init(); {39045#true} is VALID [2018-11-18 22:58:07,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {39045#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39045#true} is VALID [2018-11-18 22:58:07,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {39045#true} assume true; {39045#true} is VALID [2018-11-18 22:58:07,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39045#true} {39045#true} #57#return; {39045#true} is VALID [2018-11-18 22:58:07,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {39045#true} call #t~ret4 := main(); {39045#true} is VALID [2018-11-18 22:58:07,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {39045#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {39047#(= main_~i~0 0)} is VALID [2018-11-18 22:58:07,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {39047#(= main_~i~0 0)} assume true; {39047#(= main_~i~0 0)} is VALID [2018-11-18 22:58:07,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {39047#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39047#(= main_~i~0 0)} is VALID [2018-11-18 22:58:07,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {39047#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39047#(= main_~i~0 0)} is VALID [2018-11-18 22:58:07,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {39047#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {39048#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:07,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {39048#(<= main_~i~0 1)} assume true; {39048#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:07,543 INFO L273 TraceCheckUtils]: 11: Hoare triple {39048#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39048#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:07,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {39048#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39048#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:07,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {39048#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {39049#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:07,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {39049#(<= main_~i~0 2)} assume true; {39049#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:07,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {39049#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39049#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:07,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {39049#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39049#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:07,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {39049#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {39050#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:07,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {39050#(<= main_~i~0 3)} assume true; {39050#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:07,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {39050#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39050#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:07,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {39050#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39050#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:07,548 INFO L273 TraceCheckUtils]: 21: Hoare triple {39050#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {39051#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:07,548 INFO L273 TraceCheckUtils]: 22: Hoare triple {39051#(<= main_~i~0 4)} assume true; {39051#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:07,549 INFO L273 TraceCheckUtils]: 23: Hoare triple {39051#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39051#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:07,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {39051#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39051#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:07,550 INFO L273 TraceCheckUtils]: 25: Hoare triple {39051#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {39052#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:07,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {39052#(<= main_~i~0 5)} assume true; {39052#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:07,551 INFO L273 TraceCheckUtils]: 27: Hoare triple {39052#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39052#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:07,551 INFO L273 TraceCheckUtils]: 28: Hoare triple {39052#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39052#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:07,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {39052#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {39053#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:07,553 INFO L273 TraceCheckUtils]: 30: Hoare triple {39053#(<= main_~i~0 6)} assume true; {39053#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:07,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {39053#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39053#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:07,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {39053#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39053#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:07,554 INFO L273 TraceCheckUtils]: 33: Hoare triple {39053#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {39054#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:07,555 INFO L273 TraceCheckUtils]: 34: Hoare triple {39054#(<= main_~i~0 7)} assume true; {39054#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:07,555 INFO L273 TraceCheckUtils]: 35: Hoare triple {39054#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39054#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:07,556 INFO L273 TraceCheckUtils]: 36: Hoare triple {39054#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39054#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:07,556 INFO L273 TraceCheckUtils]: 37: Hoare triple {39054#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {39055#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:07,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {39055#(<= main_~i~0 8)} assume true; {39055#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:07,557 INFO L273 TraceCheckUtils]: 39: Hoare triple {39055#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39055#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:07,558 INFO L273 TraceCheckUtils]: 40: Hoare triple {39055#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39055#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:07,558 INFO L273 TraceCheckUtils]: 41: Hoare triple {39055#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {39056#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:07,559 INFO L273 TraceCheckUtils]: 42: Hoare triple {39056#(<= main_~i~0 9)} assume true; {39056#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:07,559 INFO L273 TraceCheckUtils]: 43: Hoare triple {39056#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39056#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:07,560 INFO L273 TraceCheckUtils]: 44: Hoare triple {39056#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39056#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:07,561 INFO L273 TraceCheckUtils]: 45: Hoare triple {39056#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {39057#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:07,561 INFO L273 TraceCheckUtils]: 46: Hoare triple {39057#(<= main_~i~0 10)} assume true; {39057#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:07,562 INFO L273 TraceCheckUtils]: 47: Hoare triple {39057#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39057#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:07,562 INFO L273 TraceCheckUtils]: 48: Hoare triple {39057#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39057#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:07,563 INFO L273 TraceCheckUtils]: 49: Hoare triple {39057#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {39058#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:07,563 INFO L273 TraceCheckUtils]: 50: Hoare triple {39058#(<= main_~i~0 11)} assume true; {39058#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:07,564 INFO L273 TraceCheckUtils]: 51: Hoare triple {39058#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39058#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:07,564 INFO L273 TraceCheckUtils]: 52: Hoare triple {39058#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39058#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:07,565 INFO L273 TraceCheckUtils]: 53: Hoare triple {39058#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {39059#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:07,565 INFO L273 TraceCheckUtils]: 54: Hoare triple {39059#(<= main_~i~0 12)} assume true; {39059#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:07,566 INFO L273 TraceCheckUtils]: 55: Hoare triple {39059#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39059#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:07,566 INFO L273 TraceCheckUtils]: 56: Hoare triple {39059#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39059#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:07,567 INFO L273 TraceCheckUtils]: 57: Hoare triple {39059#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {39060#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:07,567 INFO L273 TraceCheckUtils]: 58: Hoare triple {39060#(<= main_~i~0 13)} assume true; {39060#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:07,568 INFO L273 TraceCheckUtils]: 59: Hoare triple {39060#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39060#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:07,568 INFO L273 TraceCheckUtils]: 60: Hoare triple {39060#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39060#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:07,569 INFO L273 TraceCheckUtils]: 61: Hoare triple {39060#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {39061#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:07,570 INFO L273 TraceCheckUtils]: 62: Hoare triple {39061#(<= main_~i~0 14)} assume true; {39061#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:07,570 INFO L273 TraceCheckUtils]: 63: Hoare triple {39061#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39061#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:07,570 INFO L273 TraceCheckUtils]: 64: Hoare triple {39061#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39061#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:07,571 INFO L273 TraceCheckUtils]: 65: Hoare triple {39061#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {39062#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:07,572 INFO L273 TraceCheckUtils]: 66: Hoare triple {39062#(<= main_~i~0 15)} assume true; {39062#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:07,572 INFO L273 TraceCheckUtils]: 67: Hoare triple {39062#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39062#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:07,573 INFO L273 TraceCheckUtils]: 68: Hoare triple {39062#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39062#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:07,573 INFO L273 TraceCheckUtils]: 69: Hoare triple {39062#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {39063#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:07,574 INFO L273 TraceCheckUtils]: 70: Hoare triple {39063#(<= main_~i~0 16)} assume true; {39063#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:07,574 INFO L273 TraceCheckUtils]: 71: Hoare triple {39063#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39063#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:07,575 INFO L273 TraceCheckUtils]: 72: Hoare triple {39063#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39063#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:07,576 INFO L273 TraceCheckUtils]: 73: Hoare triple {39063#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {39064#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:07,576 INFO L273 TraceCheckUtils]: 74: Hoare triple {39064#(<= main_~i~0 17)} assume true; {39064#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:07,577 INFO L273 TraceCheckUtils]: 75: Hoare triple {39064#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39064#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:07,577 INFO L273 TraceCheckUtils]: 76: Hoare triple {39064#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39064#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:07,578 INFO L273 TraceCheckUtils]: 77: Hoare triple {39064#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {39065#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:07,578 INFO L273 TraceCheckUtils]: 78: Hoare triple {39065#(<= main_~i~0 18)} assume true; {39065#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:07,579 INFO L273 TraceCheckUtils]: 79: Hoare triple {39065#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39065#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:07,579 INFO L273 TraceCheckUtils]: 80: Hoare triple {39065#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39065#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:07,580 INFO L273 TraceCheckUtils]: 81: Hoare triple {39065#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {39066#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:07,580 INFO L273 TraceCheckUtils]: 82: Hoare triple {39066#(<= main_~i~0 19)} assume true; {39066#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:07,581 INFO L273 TraceCheckUtils]: 83: Hoare triple {39066#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39066#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:07,581 INFO L273 TraceCheckUtils]: 84: Hoare triple {39066#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39066#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:07,582 INFO L273 TraceCheckUtils]: 85: Hoare triple {39066#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {39067#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:07,583 INFO L273 TraceCheckUtils]: 86: Hoare triple {39067#(<= main_~i~0 20)} assume true; {39067#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:07,583 INFO L273 TraceCheckUtils]: 87: Hoare triple {39067#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39067#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:07,584 INFO L273 TraceCheckUtils]: 88: Hoare triple {39067#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39067#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:07,584 INFO L273 TraceCheckUtils]: 89: Hoare triple {39067#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {39068#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:07,585 INFO L273 TraceCheckUtils]: 90: Hoare triple {39068#(<= main_~i~0 21)} assume true; {39068#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:07,585 INFO L273 TraceCheckUtils]: 91: Hoare triple {39068#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39068#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:07,586 INFO L273 TraceCheckUtils]: 92: Hoare triple {39068#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39068#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:07,586 INFO L273 TraceCheckUtils]: 93: Hoare triple {39068#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {39069#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:07,587 INFO L273 TraceCheckUtils]: 94: Hoare triple {39069#(<= main_~i~0 22)} assume true; {39069#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:07,587 INFO L273 TraceCheckUtils]: 95: Hoare triple {39069#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39069#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:07,588 INFO L273 TraceCheckUtils]: 96: Hoare triple {39069#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39069#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:07,588 INFO L273 TraceCheckUtils]: 97: Hoare triple {39069#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {39070#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:07,589 INFO L273 TraceCheckUtils]: 98: Hoare triple {39070#(<= main_~i~0 23)} assume true; {39070#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:07,589 INFO L273 TraceCheckUtils]: 99: Hoare triple {39070#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39070#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:07,590 INFO L273 TraceCheckUtils]: 100: Hoare triple {39070#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39070#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:07,591 INFO L273 TraceCheckUtils]: 101: Hoare triple {39070#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {39071#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:07,591 INFO L273 TraceCheckUtils]: 102: Hoare triple {39071#(<= main_~i~0 24)} assume true; {39071#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:07,592 INFO L273 TraceCheckUtils]: 103: Hoare triple {39071#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39071#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:07,592 INFO L273 TraceCheckUtils]: 104: Hoare triple {39071#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39071#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:07,593 INFO L273 TraceCheckUtils]: 105: Hoare triple {39071#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {39072#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:07,593 INFO L273 TraceCheckUtils]: 106: Hoare triple {39072#(<= main_~i~0 25)} assume true; {39072#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:07,594 INFO L273 TraceCheckUtils]: 107: Hoare triple {39072#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39072#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:07,594 INFO L273 TraceCheckUtils]: 108: Hoare triple {39072#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39072#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:07,595 INFO L273 TraceCheckUtils]: 109: Hoare triple {39072#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {39073#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:07,595 INFO L273 TraceCheckUtils]: 110: Hoare triple {39073#(<= main_~i~0 26)} assume true; {39073#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:07,596 INFO L273 TraceCheckUtils]: 111: Hoare triple {39073#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39073#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:07,596 INFO L273 TraceCheckUtils]: 112: Hoare triple {39073#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39073#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:07,597 INFO L273 TraceCheckUtils]: 113: Hoare triple {39073#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {39074#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:07,598 INFO L273 TraceCheckUtils]: 114: Hoare triple {39074#(<= main_~i~0 27)} assume true; {39074#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:07,598 INFO L273 TraceCheckUtils]: 115: Hoare triple {39074#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39074#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:07,599 INFO L273 TraceCheckUtils]: 116: Hoare triple {39074#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39074#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:07,599 INFO L273 TraceCheckUtils]: 117: Hoare triple {39074#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {39075#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:07,600 INFO L273 TraceCheckUtils]: 118: Hoare triple {39075#(<= main_~i~0 28)} assume true; {39075#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:07,600 INFO L273 TraceCheckUtils]: 119: Hoare triple {39075#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39075#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:07,601 INFO L273 TraceCheckUtils]: 120: Hoare triple {39075#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39075#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:07,601 INFO L273 TraceCheckUtils]: 121: Hoare triple {39075#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {39076#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:07,602 INFO L273 TraceCheckUtils]: 122: Hoare triple {39076#(<= main_~i~0 29)} assume true; {39076#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:07,602 INFO L273 TraceCheckUtils]: 123: Hoare triple {39076#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39076#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:07,603 INFO L273 TraceCheckUtils]: 124: Hoare triple {39076#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39076#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:07,604 INFO L273 TraceCheckUtils]: 125: Hoare triple {39076#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {39077#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:07,604 INFO L273 TraceCheckUtils]: 126: Hoare triple {39077#(<= main_~i~0 30)} assume true; {39077#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:07,605 INFO L273 TraceCheckUtils]: 127: Hoare triple {39077#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39077#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:07,605 INFO L273 TraceCheckUtils]: 128: Hoare triple {39077#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39077#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:07,606 INFO L273 TraceCheckUtils]: 129: Hoare triple {39077#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {39078#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:07,606 INFO L273 TraceCheckUtils]: 130: Hoare triple {39078#(<= main_~i~0 31)} assume true; {39078#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:07,607 INFO L273 TraceCheckUtils]: 131: Hoare triple {39078#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39078#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:07,607 INFO L273 TraceCheckUtils]: 132: Hoare triple {39078#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39078#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:07,608 INFO L273 TraceCheckUtils]: 133: Hoare triple {39078#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {39079#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:07,608 INFO L273 TraceCheckUtils]: 134: Hoare triple {39079#(<= main_~i~0 32)} assume true; {39079#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:07,609 INFO L273 TraceCheckUtils]: 135: Hoare triple {39079#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39079#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:07,609 INFO L273 TraceCheckUtils]: 136: Hoare triple {39079#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39079#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:07,610 INFO L273 TraceCheckUtils]: 137: Hoare triple {39079#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {39080#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:07,610 INFO L273 TraceCheckUtils]: 138: Hoare triple {39080#(<= main_~i~0 33)} assume true; {39080#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:07,611 INFO L273 TraceCheckUtils]: 139: Hoare triple {39080#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39080#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:07,611 INFO L273 TraceCheckUtils]: 140: Hoare triple {39080#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39080#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:07,612 INFO L273 TraceCheckUtils]: 141: Hoare triple {39080#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {39081#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:07,613 INFO L273 TraceCheckUtils]: 142: Hoare triple {39081#(<= main_~i~0 34)} assume true; {39081#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:07,613 INFO L273 TraceCheckUtils]: 143: Hoare triple {39081#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39081#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:07,613 INFO L273 TraceCheckUtils]: 144: Hoare triple {39081#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39081#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:07,614 INFO L273 TraceCheckUtils]: 145: Hoare triple {39081#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {39082#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:07,615 INFO L273 TraceCheckUtils]: 146: Hoare triple {39082#(<= main_~i~0 35)} assume true; {39082#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:07,615 INFO L273 TraceCheckUtils]: 147: Hoare triple {39082#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39082#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:07,616 INFO L273 TraceCheckUtils]: 148: Hoare triple {39082#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39082#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:07,616 INFO L273 TraceCheckUtils]: 149: Hoare triple {39082#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {39083#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:07,617 INFO L273 TraceCheckUtils]: 150: Hoare triple {39083#(<= main_~i~0 36)} assume true; {39083#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:07,617 INFO L273 TraceCheckUtils]: 151: Hoare triple {39083#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39083#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:07,618 INFO L273 TraceCheckUtils]: 152: Hoare triple {39083#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39083#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:07,619 INFO L273 TraceCheckUtils]: 153: Hoare triple {39083#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {39084#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:07,619 INFO L273 TraceCheckUtils]: 154: Hoare triple {39084#(<= main_~i~0 37)} assume true; {39084#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:07,620 INFO L273 TraceCheckUtils]: 155: Hoare triple {39084#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39084#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:07,620 INFO L273 TraceCheckUtils]: 156: Hoare triple {39084#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39084#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:07,621 INFO L273 TraceCheckUtils]: 157: Hoare triple {39084#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {39085#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:07,621 INFO L273 TraceCheckUtils]: 158: Hoare triple {39085#(<= main_~i~0 38)} assume true; {39085#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:07,622 INFO L273 TraceCheckUtils]: 159: Hoare triple {39085#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39085#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:07,622 INFO L273 TraceCheckUtils]: 160: Hoare triple {39085#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39085#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:07,623 INFO L273 TraceCheckUtils]: 161: Hoare triple {39085#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {39086#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:07,623 INFO L273 TraceCheckUtils]: 162: Hoare triple {39086#(<= main_~i~0 39)} assume true; {39086#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:07,624 INFO L273 TraceCheckUtils]: 163: Hoare triple {39086#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39086#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:07,624 INFO L273 TraceCheckUtils]: 164: Hoare triple {39086#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39086#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:07,625 INFO L273 TraceCheckUtils]: 165: Hoare triple {39086#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {39087#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:07,626 INFO L273 TraceCheckUtils]: 166: Hoare triple {39087#(<= main_~i~0 40)} assume true; {39087#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:07,626 INFO L273 TraceCheckUtils]: 167: Hoare triple {39087#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39087#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:07,626 INFO L273 TraceCheckUtils]: 168: Hoare triple {39087#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39087#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:07,627 INFO L273 TraceCheckUtils]: 169: Hoare triple {39087#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {39088#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:07,628 INFO L273 TraceCheckUtils]: 170: Hoare triple {39088#(<= main_~i~0 41)} assume true; {39088#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:07,628 INFO L273 TraceCheckUtils]: 171: Hoare triple {39088#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39088#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:07,629 INFO L273 TraceCheckUtils]: 172: Hoare triple {39088#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39088#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:07,629 INFO L273 TraceCheckUtils]: 173: Hoare triple {39088#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {39089#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:07,630 INFO L273 TraceCheckUtils]: 174: Hoare triple {39089#(<= main_~i~0 42)} assume true; {39089#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:07,630 INFO L273 TraceCheckUtils]: 175: Hoare triple {39089#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39089#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:07,631 INFO L273 TraceCheckUtils]: 176: Hoare triple {39089#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39089#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:07,632 INFO L273 TraceCheckUtils]: 177: Hoare triple {39089#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {39090#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:07,632 INFO L273 TraceCheckUtils]: 178: Hoare triple {39090#(<= main_~i~0 43)} assume true; {39090#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:07,633 INFO L273 TraceCheckUtils]: 179: Hoare triple {39090#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39090#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:07,633 INFO L273 TraceCheckUtils]: 180: Hoare triple {39090#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39090#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:07,634 INFO L273 TraceCheckUtils]: 181: Hoare triple {39090#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {39091#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:07,634 INFO L273 TraceCheckUtils]: 182: Hoare triple {39091#(<= main_~i~0 44)} assume true; {39091#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:07,635 INFO L273 TraceCheckUtils]: 183: Hoare triple {39091#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:07,635 INFO L273 TraceCheckUtils]: 184: Hoare triple {39091#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39091#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:07,636 INFO L273 TraceCheckUtils]: 185: Hoare triple {39091#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {39092#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:07,636 INFO L273 TraceCheckUtils]: 186: Hoare triple {39092#(<= main_~i~0 45)} assume true; {39092#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:07,637 INFO L273 TraceCheckUtils]: 187: Hoare triple {39092#(<= main_~i~0 45)} assume !(~i~0 < 100000); {39046#false} is VALID [2018-11-18 22:58:07,637 INFO L273 TraceCheckUtils]: 188: Hoare triple {39046#false} havoc ~x~0;~x~0 := 0; {39046#false} is VALID [2018-11-18 22:58:07,637 INFO L273 TraceCheckUtils]: 189: Hoare triple {39046#false} assume true; {39046#false} is VALID [2018-11-18 22:58:07,637 INFO L273 TraceCheckUtils]: 190: Hoare triple {39046#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {39046#false} is VALID [2018-11-18 22:58:07,638 INFO L256 TraceCheckUtils]: 191: Hoare triple {39046#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {39046#false} is VALID [2018-11-18 22:58:07,638 INFO L273 TraceCheckUtils]: 192: Hoare triple {39046#false} ~cond := #in~cond; {39046#false} is VALID [2018-11-18 22:58:07,638 INFO L273 TraceCheckUtils]: 193: Hoare triple {39046#false} assume 0 == ~cond; {39046#false} is VALID [2018-11-18 22:58:07,638 INFO L273 TraceCheckUtils]: 194: Hoare triple {39046#false} assume !false; {39046#false} is VALID [2018-11-18 22:58:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:07,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:07,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:07,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:58:07,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-11-18 22:58:07,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:07,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:08,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {39045#true} call ULTIMATE.init(); {39045#true} is VALID [2018-11-18 22:58:08,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {39045#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39045#true} is VALID [2018-11-18 22:58:08,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {39045#true} assume true; {39045#true} is VALID [2018-11-18 22:58:08,227 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39045#true} {39045#true} #57#return; {39045#true} is VALID [2018-11-18 22:58:08,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {39045#true} call #t~ret4 := main(); {39045#true} is VALID [2018-11-18 22:58:08,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {39045#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {39111#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:08,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {39111#(<= main_~i~0 0)} assume true; {39111#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:08,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {39111#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:08,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {39111#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39111#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:08,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {39111#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {39048#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {39048#(<= main_~i~0 1)} assume true; {39048#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {39048#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39048#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {39048#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39048#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {39048#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {39049#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {39049#(<= main_~i~0 2)} assume true; {39049#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {39049#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39049#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {39049#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39049#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {39049#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {39050#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {39050#(<= main_~i~0 3)} assume true; {39050#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {39050#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39050#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {39050#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39050#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {39050#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {39051#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {39051#(<= main_~i~0 4)} assume true; {39051#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {39051#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39051#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {39051#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39051#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {39051#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {39052#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,240 INFO L273 TraceCheckUtils]: 26: Hoare triple {39052#(<= main_~i~0 5)} assume true; {39052#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {39052#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39052#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,241 INFO L273 TraceCheckUtils]: 28: Hoare triple {39052#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39052#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {39052#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {39053#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,242 INFO L273 TraceCheckUtils]: 30: Hoare triple {39053#(<= main_~i~0 6)} assume true; {39053#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {39053#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39053#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {39053#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39053#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,244 INFO L273 TraceCheckUtils]: 33: Hoare triple {39053#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {39054#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,244 INFO L273 TraceCheckUtils]: 34: Hoare triple {39054#(<= main_~i~0 7)} assume true; {39054#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {39054#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39054#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,245 INFO L273 TraceCheckUtils]: 36: Hoare triple {39054#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39054#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,246 INFO L273 TraceCheckUtils]: 37: Hoare triple {39054#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {39055#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,246 INFO L273 TraceCheckUtils]: 38: Hoare triple {39055#(<= main_~i~0 8)} assume true; {39055#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,247 INFO L273 TraceCheckUtils]: 39: Hoare triple {39055#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39055#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,247 INFO L273 TraceCheckUtils]: 40: Hoare triple {39055#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39055#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,248 INFO L273 TraceCheckUtils]: 41: Hoare triple {39055#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {39056#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,248 INFO L273 TraceCheckUtils]: 42: Hoare triple {39056#(<= main_~i~0 9)} assume true; {39056#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,249 INFO L273 TraceCheckUtils]: 43: Hoare triple {39056#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39056#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,249 INFO L273 TraceCheckUtils]: 44: Hoare triple {39056#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39056#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,250 INFO L273 TraceCheckUtils]: 45: Hoare triple {39056#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {39057#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,250 INFO L273 TraceCheckUtils]: 46: Hoare triple {39057#(<= main_~i~0 10)} assume true; {39057#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,251 INFO L273 TraceCheckUtils]: 47: Hoare triple {39057#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39057#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,251 INFO L273 TraceCheckUtils]: 48: Hoare triple {39057#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39057#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,252 INFO L273 TraceCheckUtils]: 49: Hoare triple {39057#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {39058#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,253 INFO L273 TraceCheckUtils]: 50: Hoare triple {39058#(<= main_~i~0 11)} assume true; {39058#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,253 INFO L273 TraceCheckUtils]: 51: Hoare triple {39058#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39058#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,254 INFO L273 TraceCheckUtils]: 52: Hoare triple {39058#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39058#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,254 INFO L273 TraceCheckUtils]: 53: Hoare triple {39058#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {39059#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,255 INFO L273 TraceCheckUtils]: 54: Hoare triple {39059#(<= main_~i~0 12)} assume true; {39059#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,255 INFO L273 TraceCheckUtils]: 55: Hoare triple {39059#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39059#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,256 INFO L273 TraceCheckUtils]: 56: Hoare triple {39059#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39059#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,257 INFO L273 TraceCheckUtils]: 57: Hoare triple {39059#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {39060#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,257 INFO L273 TraceCheckUtils]: 58: Hoare triple {39060#(<= main_~i~0 13)} assume true; {39060#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,258 INFO L273 TraceCheckUtils]: 59: Hoare triple {39060#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39060#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,258 INFO L273 TraceCheckUtils]: 60: Hoare triple {39060#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39060#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,259 INFO L273 TraceCheckUtils]: 61: Hoare triple {39060#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {39061#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,259 INFO L273 TraceCheckUtils]: 62: Hoare triple {39061#(<= main_~i~0 14)} assume true; {39061#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,260 INFO L273 TraceCheckUtils]: 63: Hoare triple {39061#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39061#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,260 INFO L273 TraceCheckUtils]: 64: Hoare triple {39061#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39061#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,261 INFO L273 TraceCheckUtils]: 65: Hoare triple {39061#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {39062#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,261 INFO L273 TraceCheckUtils]: 66: Hoare triple {39062#(<= main_~i~0 15)} assume true; {39062#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,262 INFO L273 TraceCheckUtils]: 67: Hoare triple {39062#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39062#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,262 INFO L273 TraceCheckUtils]: 68: Hoare triple {39062#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39062#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,263 INFO L273 TraceCheckUtils]: 69: Hoare triple {39062#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {39063#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,264 INFO L273 TraceCheckUtils]: 70: Hoare triple {39063#(<= main_~i~0 16)} assume true; {39063#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,264 INFO L273 TraceCheckUtils]: 71: Hoare triple {39063#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39063#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,265 INFO L273 TraceCheckUtils]: 72: Hoare triple {39063#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39063#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,265 INFO L273 TraceCheckUtils]: 73: Hoare triple {39063#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {39064#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,266 INFO L273 TraceCheckUtils]: 74: Hoare triple {39064#(<= main_~i~0 17)} assume true; {39064#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,266 INFO L273 TraceCheckUtils]: 75: Hoare triple {39064#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39064#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,267 INFO L273 TraceCheckUtils]: 76: Hoare triple {39064#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39064#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,268 INFO L273 TraceCheckUtils]: 77: Hoare triple {39064#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {39065#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,268 INFO L273 TraceCheckUtils]: 78: Hoare triple {39065#(<= main_~i~0 18)} assume true; {39065#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,269 INFO L273 TraceCheckUtils]: 79: Hoare triple {39065#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39065#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,269 INFO L273 TraceCheckUtils]: 80: Hoare triple {39065#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39065#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,270 INFO L273 TraceCheckUtils]: 81: Hoare triple {39065#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {39066#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,270 INFO L273 TraceCheckUtils]: 82: Hoare triple {39066#(<= main_~i~0 19)} assume true; {39066#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,271 INFO L273 TraceCheckUtils]: 83: Hoare triple {39066#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39066#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,271 INFO L273 TraceCheckUtils]: 84: Hoare triple {39066#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39066#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,272 INFO L273 TraceCheckUtils]: 85: Hoare triple {39066#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {39067#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,272 INFO L273 TraceCheckUtils]: 86: Hoare triple {39067#(<= main_~i~0 20)} assume true; {39067#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,273 INFO L273 TraceCheckUtils]: 87: Hoare triple {39067#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39067#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,273 INFO L273 TraceCheckUtils]: 88: Hoare triple {39067#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39067#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,274 INFO L273 TraceCheckUtils]: 89: Hoare triple {39067#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {39068#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,275 INFO L273 TraceCheckUtils]: 90: Hoare triple {39068#(<= main_~i~0 21)} assume true; {39068#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,275 INFO L273 TraceCheckUtils]: 91: Hoare triple {39068#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39068#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,275 INFO L273 TraceCheckUtils]: 92: Hoare triple {39068#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39068#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,276 INFO L273 TraceCheckUtils]: 93: Hoare triple {39068#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {39069#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,277 INFO L273 TraceCheckUtils]: 94: Hoare triple {39069#(<= main_~i~0 22)} assume true; {39069#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,277 INFO L273 TraceCheckUtils]: 95: Hoare triple {39069#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39069#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,278 INFO L273 TraceCheckUtils]: 96: Hoare triple {39069#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39069#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,278 INFO L273 TraceCheckUtils]: 97: Hoare triple {39069#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {39070#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,279 INFO L273 TraceCheckUtils]: 98: Hoare triple {39070#(<= main_~i~0 23)} assume true; {39070#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,279 INFO L273 TraceCheckUtils]: 99: Hoare triple {39070#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39070#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,280 INFO L273 TraceCheckUtils]: 100: Hoare triple {39070#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39070#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,280 INFO L273 TraceCheckUtils]: 101: Hoare triple {39070#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {39071#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,281 INFO L273 TraceCheckUtils]: 102: Hoare triple {39071#(<= main_~i~0 24)} assume true; {39071#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,281 INFO L273 TraceCheckUtils]: 103: Hoare triple {39071#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39071#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,282 INFO L273 TraceCheckUtils]: 104: Hoare triple {39071#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39071#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,282 INFO L273 TraceCheckUtils]: 105: Hoare triple {39071#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {39072#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,283 INFO L273 TraceCheckUtils]: 106: Hoare triple {39072#(<= main_~i~0 25)} assume true; {39072#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,283 INFO L273 TraceCheckUtils]: 107: Hoare triple {39072#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39072#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,284 INFO L273 TraceCheckUtils]: 108: Hoare triple {39072#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39072#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,285 INFO L273 TraceCheckUtils]: 109: Hoare triple {39072#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {39073#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,285 INFO L273 TraceCheckUtils]: 110: Hoare triple {39073#(<= main_~i~0 26)} assume true; {39073#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,286 INFO L273 TraceCheckUtils]: 111: Hoare triple {39073#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39073#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,286 INFO L273 TraceCheckUtils]: 112: Hoare triple {39073#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39073#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,287 INFO L273 TraceCheckUtils]: 113: Hoare triple {39073#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {39074#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,287 INFO L273 TraceCheckUtils]: 114: Hoare triple {39074#(<= main_~i~0 27)} assume true; {39074#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,288 INFO L273 TraceCheckUtils]: 115: Hoare triple {39074#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39074#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,288 INFO L273 TraceCheckUtils]: 116: Hoare triple {39074#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39074#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,289 INFO L273 TraceCheckUtils]: 117: Hoare triple {39074#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {39075#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,289 INFO L273 TraceCheckUtils]: 118: Hoare triple {39075#(<= main_~i~0 28)} assume true; {39075#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,290 INFO L273 TraceCheckUtils]: 119: Hoare triple {39075#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39075#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,290 INFO L273 TraceCheckUtils]: 120: Hoare triple {39075#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39075#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,291 INFO L273 TraceCheckUtils]: 121: Hoare triple {39075#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {39076#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,292 INFO L273 TraceCheckUtils]: 122: Hoare triple {39076#(<= main_~i~0 29)} assume true; {39076#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,292 INFO L273 TraceCheckUtils]: 123: Hoare triple {39076#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39076#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,293 INFO L273 TraceCheckUtils]: 124: Hoare triple {39076#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39076#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,293 INFO L273 TraceCheckUtils]: 125: Hoare triple {39076#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {39077#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,294 INFO L273 TraceCheckUtils]: 126: Hoare triple {39077#(<= main_~i~0 30)} assume true; {39077#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,294 INFO L273 TraceCheckUtils]: 127: Hoare triple {39077#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39077#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,295 INFO L273 TraceCheckUtils]: 128: Hoare triple {39077#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39077#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,296 INFO L273 TraceCheckUtils]: 129: Hoare triple {39077#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {39078#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,296 INFO L273 TraceCheckUtils]: 130: Hoare triple {39078#(<= main_~i~0 31)} assume true; {39078#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,297 INFO L273 TraceCheckUtils]: 131: Hoare triple {39078#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39078#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,297 INFO L273 TraceCheckUtils]: 132: Hoare triple {39078#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39078#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,298 INFO L273 TraceCheckUtils]: 133: Hoare triple {39078#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {39079#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:08,298 INFO L273 TraceCheckUtils]: 134: Hoare triple {39079#(<= main_~i~0 32)} assume true; {39079#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:08,299 INFO L273 TraceCheckUtils]: 135: Hoare triple {39079#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39079#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:08,299 INFO L273 TraceCheckUtils]: 136: Hoare triple {39079#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39079#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:08,300 INFO L273 TraceCheckUtils]: 137: Hoare triple {39079#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {39080#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:08,300 INFO L273 TraceCheckUtils]: 138: Hoare triple {39080#(<= main_~i~0 33)} assume true; {39080#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:08,301 INFO L273 TraceCheckUtils]: 139: Hoare triple {39080#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39080#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:08,301 INFO L273 TraceCheckUtils]: 140: Hoare triple {39080#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39080#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:08,302 INFO L273 TraceCheckUtils]: 141: Hoare triple {39080#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {39081#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:08,302 INFO L273 TraceCheckUtils]: 142: Hoare triple {39081#(<= main_~i~0 34)} assume true; {39081#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:08,303 INFO L273 TraceCheckUtils]: 143: Hoare triple {39081#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39081#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:08,303 INFO L273 TraceCheckUtils]: 144: Hoare triple {39081#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39081#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:08,304 INFO L273 TraceCheckUtils]: 145: Hoare triple {39081#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {39082#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:08,305 INFO L273 TraceCheckUtils]: 146: Hoare triple {39082#(<= main_~i~0 35)} assume true; {39082#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:08,305 INFO L273 TraceCheckUtils]: 147: Hoare triple {39082#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39082#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:08,305 INFO L273 TraceCheckUtils]: 148: Hoare triple {39082#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39082#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:08,306 INFO L273 TraceCheckUtils]: 149: Hoare triple {39082#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {39083#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:08,307 INFO L273 TraceCheckUtils]: 150: Hoare triple {39083#(<= main_~i~0 36)} assume true; {39083#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:08,307 INFO L273 TraceCheckUtils]: 151: Hoare triple {39083#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39083#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:08,308 INFO L273 TraceCheckUtils]: 152: Hoare triple {39083#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39083#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:08,308 INFO L273 TraceCheckUtils]: 153: Hoare triple {39083#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {39084#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:08,309 INFO L273 TraceCheckUtils]: 154: Hoare triple {39084#(<= main_~i~0 37)} assume true; {39084#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:08,309 INFO L273 TraceCheckUtils]: 155: Hoare triple {39084#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39084#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:08,310 INFO L273 TraceCheckUtils]: 156: Hoare triple {39084#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39084#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:08,310 INFO L273 TraceCheckUtils]: 157: Hoare triple {39084#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {39085#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:08,311 INFO L273 TraceCheckUtils]: 158: Hoare triple {39085#(<= main_~i~0 38)} assume true; {39085#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:08,311 INFO L273 TraceCheckUtils]: 159: Hoare triple {39085#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39085#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:08,312 INFO L273 TraceCheckUtils]: 160: Hoare triple {39085#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39085#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:08,312 INFO L273 TraceCheckUtils]: 161: Hoare triple {39085#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {39086#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:08,313 INFO L273 TraceCheckUtils]: 162: Hoare triple {39086#(<= main_~i~0 39)} assume true; {39086#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:08,313 INFO L273 TraceCheckUtils]: 163: Hoare triple {39086#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39086#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:08,314 INFO L273 TraceCheckUtils]: 164: Hoare triple {39086#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39086#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:08,314 INFO L273 TraceCheckUtils]: 165: Hoare triple {39086#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {39087#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:08,315 INFO L273 TraceCheckUtils]: 166: Hoare triple {39087#(<= main_~i~0 40)} assume true; {39087#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:08,315 INFO L273 TraceCheckUtils]: 167: Hoare triple {39087#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39087#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:08,316 INFO L273 TraceCheckUtils]: 168: Hoare triple {39087#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39087#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:08,316 INFO L273 TraceCheckUtils]: 169: Hoare triple {39087#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {39088#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:08,317 INFO L273 TraceCheckUtils]: 170: Hoare triple {39088#(<= main_~i~0 41)} assume true; {39088#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:08,317 INFO L273 TraceCheckUtils]: 171: Hoare triple {39088#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39088#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:08,318 INFO L273 TraceCheckUtils]: 172: Hoare triple {39088#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39088#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:08,319 INFO L273 TraceCheckUtils]: 173: Hoare triple {39088#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {39089#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:08,319 INFO L273 TraceCheckUtils]: 174: Hoare triple {39089#(<= main_~i~0 42)} assume true; {39089#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:08,319 INFO L273 TraceCheckUtils]: 175: Hoare triple {39089#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39089#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:08,320 INFO L273 TraceCheckUtils]: 176: Hoare triple {39089#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39089#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:08,321 INFO L273 TraceCheckUtils]: 177: Hoare triple {39089#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {39090#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:08,321 INFO L273 TraceCheckUtils]: 178: Hoare triple {39090#(<= main_~i~0 43)} assume true; {39090#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:08,322 INFO L273 TraceCheckUtils]: 179: Hoare triple {39090#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39090#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:08,322 INFO L273 TraceCheckUtils]: 180: Hoare triple {39090#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39090#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:08,323 INFO L273 TraceCheckUtils]: 181: Hoare triple {39090#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {39091#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:08,323 INFO L273 TraceCheckUtils]: 182: Hoare triple {39091#(<= main_~i~0 44)} assume true; {39091#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:08,324 INFO L273 TraceCheckUtils]: 183: Hoare triple {39091#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:08,324 INFO L273 TraceCheckUtils]: 184: Hoare triple {39091#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39091#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:08,325 INFO L273 TraceCheckUtils]: 185: Hoare triple {39091#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {39092#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:08,325 INFO L273 TraceCheckUtils]: 186: Hoare triple {39092#(<= main_~i~0 45)} assume true; {39092#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:08,326 INFO L273 TraceCheckUtils]: 187: Hoare triple {39092#(<= main_~i~0 45)} assume !(~i~0 < 100000); {39046#false} is VALID [2018-11-18 22:58:08,326 INFO L273 TraceCheckUtils]: 188: Hoare triple {39046#false} havoc ~x~0;~x~0 := 0; {39046#false} is VALID [2018-11-18 22:58:08,326 INFO L273 TraceCheckUtils]: 189: Hoare triple {39046#false} assume true; {39046#false} is VALID [2018-11-18 22:58:08,326 INFO L273 TraceCheckUtils]: 190: Hoare triple {39046#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {39046#false} is VALID [2018-11-18 22:58:08,326 INFO L256 TraceCheckUtils]: 191: Hoare triple {39046#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {39046#false} is VALID [2018-11-18 22:58:08,327 INFO L273 TraceCheckUtils]: 192: Hoare triple {39046#false} ~cond := #in~cond; {39046#false} is VALID [2018-11-18 22:58:08,327 INFO L273 TraceCheckUtils]: 193: Hoare triple {39046#false} assume 0 == ~cond; {39046#false} is VALID [2018-11-18 22:58:08,327 INFO L273 TraceCheckUtils]: 194: Hoare triple {39046#false} assume !false; {39046#false} is VALID [2018-11-18 22:58:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:08,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:08,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-11-18 22:58:08,375 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 195 [2018-11-18 22:58:08,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:08,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-18 22:58:08,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:08,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-18 22:58:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-18 22:58:08,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-18 22:58:08,556 INFO L87 Difference]: Start difference. First operand 200 states and 246 transitions. Second operand 49 states. [2018-11-18 22:58:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:09,552 INFO L93 Difference]: Finished difference Result 218 states and 267 transitions. [2018-11-18 22:58:09,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-18 22:58:09,552 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 195 [2018-11-18 22:58:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 22:58:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 267 transitions. [2018-11-18 22:58:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 22:58:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 267 transitions. [2018-11-18 22:58:09,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 267 transitions. [2018-11-18 22:58:09,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:09,786 INFO L225 Difference]: With dead ends: 218 [2018-11-18 22:58:09,786 INFO L226 Difference]: Without dead ends: 206 [2018-11-18 22:58:09,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-18 22:58:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-18 22:58:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-11-18 22:58:09,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:09,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 204 states. [2018-11-18 22:58:09,859 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 204 states. [2018-11-18 22:58:09,859 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 204 states. [2018-11-18 22:58:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:09,862 INFO L93 Difference]: Finished difference Result 206 states and 254 transitions. [2018-11-18 22:58:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 254 transitions. [2018-11-18 22:58:09,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:09,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:09,863 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 206 states. [2018-11-18 22:58:09,863 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 206 states. [2018-11-18 22:58:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:09,866 INFO L93 Difference]: Finished difference Result 206 states and 254 transitions. [2018-11-18 22:58:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 254 transitions. [2018-11-18 22:58:09,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:09,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:09,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:09,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-18 22:58:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 251 transitions. [2018-11-18 22:58:09,869 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 251 transitions. Word has length 195 [2018-11-18 22:58:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:09,869 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 251 transitions. [2018-11-18 22:58:09,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-18 22:58:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 251 transitions. [2018-11-18 22:58:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-18 22:58:09,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:09,870 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:09,871 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:09,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1557017610, now seen corresponding path program 46 times [2018-11-18 22:58:09,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:09,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:09,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:09,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:09,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:10,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {40623#true} call ULTIMATE.init(); {40623#true} is VALID [2018-11-18 22:58:10,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {40623#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40623#true} is VALID [2018-11-18 22:58:10,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {40623#true} assume true; {40623#true} is VALID [2018-11-18 22:58:10,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40623#true} {40623#true} #57#return; {40623#true} is VALID [2018-11-18 22:58:10,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {40623#true} call #t~ret4 := main(); {40623#true} is VALID [2018-11-18 22:58:10,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {40623#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {40625#(= main_~i~0 0)} is VALID [2018-11-18 22:58:10,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {40625#(= main_~i~0 0)} assume true; {40625#(= main_~i~0 0)} is VALID [2018-11-18 22:58:10,975 INFO L273 TraceCheckUtils]: 7: Hoare triple {40625#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40625#(= main_~i~0 0)} is VALID [2018-11-18 22:58:10,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {40625#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40625#(= main_~i~0 0)} is VALID [2018-11-18 22:58:10,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {40625#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {40626#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:10,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {40626#(<= main_~i~0 1)} assume true; {40626#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:10,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {40626#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40626#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:10,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {40626#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40626#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:10,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {40626#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {40627#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:10,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {40627#(<= main_~i~0 2)} assume true; {40627#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:10,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {40627#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40627#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:10,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {40627#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40627#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:10,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {40627#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {40628#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:10,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {40628#(<= main_~i~0 3)} assume true; {40628#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:10,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {40628#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40628#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:10,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {40628#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40628#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:10,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {40628#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {40629#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:10,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {40629#(<= main_~i~0 4)} assume true; {40629#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:10,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {40629#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40629#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:10,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {40629#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40629#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:10,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {40629#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {40630#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:10,984 INFO L273 TraceCheckUtils]: 26: Hoare triple {40630#(<= main_~i~0 5)} assume true; {40630#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:10,985 INFO L273 TraceCheckUtils]: 27: Hoare triple {40630#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40630#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:10,985 INFO L273 TraceCheckUtils]: 28: Hoare triple {40630#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40630#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:10,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {40630#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {40631#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:10,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {40631#(<= main_~i~0 6)} assume true; {40631#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:10,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {40631#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40631#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:10,988 INFO L273 TraceCheckUtils]: 32: Hoare triple {40631#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40631#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:10,988 INFO L273 TraceCheckUtils]: 33: Hoare triple {40631#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {40632#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:10,989 INFO L273 TraceCheckUtils]: 34: Hoare triple {40632#(<= main_~i~0 7)} assume true; {40632#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:10,989 INFO L273 TraceCheckUtils]: 35: Hoare triple {40632#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40632#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:10,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {40632#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40632#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:10,991 INFO L273 TraceCheckUtils]: 37: Hoare triple {40632#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {40633#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:10,991 INFO L273 TraceCheckUtils]: 38: Hoare triple {40633#(<= main_~i~0 8)} assume true; {40633#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:10,991 INFO L273 TraceCheckUtils]: 39: Hoare triple {40633#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40633#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:10,992 INFO L273 TraceCheckUtils]: 40: Hoare triple {40633#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40633#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:10,993 INFO L273 TraceCheckUtils]: 41: Hoare triple {40633#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {40634#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:10,993 INFO L273 TraceCheckUtils]: 42: Hoare triple {40634#(<= main_~i~0 9)} assume true; {40634#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:10,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {40634#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40634#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:10,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {40634#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40634#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:10,995 INFO L273 TraceCheckUtils]: 45: Hoare triple {40634#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {40635#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:10,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {40635#(<= main_~i~0 10)} assume true; {40635#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:10,996 INFO L273 TraceCheckUtils]: 47: Hoare triple {40635#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40635#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:10,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {40635#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40635#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:10,997 INFO L273 TraceCheckUtils]: 49: Hoare triple {40635#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {40636#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:10,998 INFO L273 TraceCheckUtils]: 50: Hoare triple {40636#(<= main_~i~0 11)} assume true; {40636#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:10,998 INFO L273 TraceCheckUtils]: 51: Hoare triple {40636#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40636#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:10,998 INFO L273 TraceCheckUtils]: 52: Hoare triple {40636#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40636#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:10,999 INFO L273 TraceCheckUtils]: 53: Hoare triple {40636#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {40637#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,000 INFO L273 TraceCheckUtils]: 54: Hoare triple {40637#(<= main_~i~0 12)} assume true; {40637#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,000 INFO L273 TraceCheckUtils]: 55: Hoare triple {40637#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40637#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,001 INFO L273 TraceCheckUtils]: 56: Hoare triple {40637#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40637#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {40637#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {40638#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,002 INFO L273 TraceCheckUtils]: 58: Hoare triple {40638#(<= main_~i~0 13)} assume true; {40638#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,002 INFO L273 TraceCheckUtils]: 59: Hoare triple {40638#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40638#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,003 INFO L273 TraceCheckUtils]: 60: Hoare triple {40638#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40638#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,004 INFO L273 TraceCheckUtils]: 61: Hoare triple {40638#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {40639#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,004 INFO L273 TraceCheckUtils]: 62: Hoare triple {40639#(<= main_~i~0 14)} assume true; {40639#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,005 INFO L273 TraceCheckUtils]: 63: Hoare triple {40639#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40639#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,005 INFO L273 TraceCheckUtils]: 64: Hoare triple {40639#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40639#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,006 INFO L273 TraceCheckUtils]: 65: Hoare triple {40639#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {40640#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,006 INFO L273 TraceCheckUtils]: 66: Hoare triple {40640#(<= main_~i~0 15)} assume true; {40640#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,007 INFO L273 TraceCheckUtils]: 67: Hoare triple {40640#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40640#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,007 INFO L273 TraceCheckUtils]: 68: Hoare triple {40640#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40640#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,008 INFO L273 TraceCheckUtils]: 69: Hoare triple {40640#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {40641#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,008 INFO L273 TraceCheckUtils]: 70: Hoare triple {40641#(<= main_~i~0 16)} assume true; {40641#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,009 INFO L273 TraceCheckUtils]: 71: Hoare triple {40641#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40641#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,009 INFO L273 TraceCheckUtils]: 72: Hoare triple {40641#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40641#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,010 INFO L273 TraceCheckUtils]: 73: Hoare triple {40641#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {40642#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,011 INFO L273 TraceCheckUtils]: 74: Hoare triple {40642#(<= main_~i~0 17)} assume true; {40642#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,011 INFO L273 TraceCheckUtils]: 75: Hoare triple {40642#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40642#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,012 INFO L273 TraceCheckUtils]: 76: Hoare triple {40642#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40642#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,012 INFO L273 TraceCheckUtils]: 77: Hoare triple {40642#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {40643#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,013 INFO L273 TraceCheckUtils]: 78: Hoare triple {40643#(<= main_~i~0 18)} assume true; {40643#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,013 INFO L273 TraceCheckUtils]: 79: Hoare triple {40643#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40643#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,014 INFO L273 TraceCheckUtils]: 80: Hoare triple {40643#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40643#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,015 INFO L273 TraceCheckUtils]: 81: Hoare triple {40643#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {40644#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,015 INFO L273 TraceCheckUtils]: 82: Hoare triple {40644#(<= main_~i~0 19)} assume true; {40644#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,016 INFO L273 TraceCheckUtils]: 83: Hoare triple {40644#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40644#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,016 INFO L273 TraceCheckUtils]: 84: Hoare triple {40644#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40644#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,017 INFO L273 TraceCheckUtils]: 85: Hoare triple {40644#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {40645#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,017 INFO L273 TraceCheckUtils]: 86: Hoare triple {40645#(<= main_~i~0 20)} assume true; {40645#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,018 INFO L273 TraceCheckUtils]: 87: Hoare triple {40645#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40645#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,018 INFO L273 TraceCheckUtils]: 88: Hoare triple {40645#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40645#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,019 INFO L273 TraceCheckUtils]: 89: Hoare triple {40645#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {40646#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,019 INFO L273 TraceCheckUtils]: 90: Hoare triple {40646#(<= main_~i~0 21)} assume true; {40646#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,020 INFO L273 TraceCheckUtils]: 91: Hoare triple {40646#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40646#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,020 INFO L273 TraceCheckUtils]: 92: Hoare triple {40646#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40646#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,021 INFO L273 TraceCheckUtils]: 93: Hoare triple {40646#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {40647#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,022 INFO L273 TraceCheckUtils]: 94: Hoare triple {40647#(<= main_~i~0 22)} assume true; {40647#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,022 INFO L273 TraceCheckUtils]: 95: Hoare triple {40647#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40647#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,022 INFO L273 TraceCheckUtils]: 96: Hoare triple {40647#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40647#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,023 INFO L273 TraceCheckUtils]: 97: Hoare triple {40647#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {40648#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,024 INFO L273 TraceCheckUtils]: 98: Hoare triple {40648#(<= main_~i~0 23)} assume true; {40648#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,024 INFO L273 TraceCheckUtils]: 99: Hoare triple {40648#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40648#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,024 INFO L273 TraceCheckUtils]: 100: Hoare triple {40648#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40648#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,025 INFO L273 TraceCheckUtils]: 101: Hoare triple {40648#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {40649#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,026 INFO L273 TraceCheckUtils]: 102: Hoare triple {40649#(<= main_~i~0 24)} assume true; {40649#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,026 INFO L273 TraceCheckUtils]: 103: Hoare triple {40649#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40649#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,027 INFO L273 TraceCheckUtils]: 104: Hoare triple {40649#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40649#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,027 INFO L273 TraceCheckUtils]: 105: Hoare triple {40649#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {40650#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,028 INFO L273 TraceCheckUtils]: 106: Hoare triple {40650#(<= main_~i~0 25)} assume true; {40650#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,028 INFO L273 TraceCheckUtils]: 107: Hoare triple {40650#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40650#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,029 INFO L273 TraceCheckUtils]: 108: Hoare triple {40650#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40650#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,029 INFO L273 TraceCheckUtils]: 109: Hoare triple {40650#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {40651#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,030 INFO L273 TraceCheckUtils]: 110: Hoare triple {40651#(<= main_~i~0 26)} assume true; {40651#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,030 INFO L273 TraceCheckUtils]: 111: Hoare triple {40651#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40651#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,031 INFO L273 TraceCheckUtils]: 112: Hoare triple {40651#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40651#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,032 INFO L273 TraceCheckUtils]: 113: Hoare triple {40651#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {40652#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,032 INFO L273 TraceCheckUtils]: 114: Hoare triple {40652#(<= main_~i~0 27)} assume true; {40652#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,032 INFO L273 TraceCheckUtils]: 115: Hoare triple {40652#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40652#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,033 INFO L273 TraceCheckUtils]: 116: Hoare triple {40652#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40652#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,034 INFO L273 TraceCheckUtils]: 117: Hoare triple {40652#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {40653#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,034 INFO L273 TraceCheckUtils]: 118: Hoare triple {40653#(<= main_~i~0 28)} assume true; {40653#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,035 INFO L273 TraceCheckUtils]: 119: Hoare triple {40653#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40653#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,035 INFO L273 TraceCheckUtils]: 120: Hoare triple {40653#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40653#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,036 INFO L273 TraceCheckUtils]: 121: Hoare triple {40653#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {40654#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,036 INFO L273 TraceCheckUtils]: 122: Hoare triple {40654#(<= main_~i~0 29)} assume true; {40654#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,037 INFO L273 TraceCheckUtils]: 123: Hoare triple {40654#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40654#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,037 INFO L273 TraceCheckUtils]: 124: Hoare triple {40654#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40654#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,038 INFO L273 TraceCheckUtils]: 125: Hoare triple {40654#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {40655#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,038 INFO L273 TraceCheckUtils]: 126: Hoare triple {40655#(<= main_~i~0 30)} assume true; {40655#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,039 INFO L273 TraceCheckUtils]: 127: Hoare triple {40655#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40655#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,039 INFO L273 TraceCheckUtils]: 128: Hoare triple {40655#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40655#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,040 INFO L273 TraceCheckUtils]: 129: Hoare triple {40655#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {40656#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,040 INFO L273 TraceCheckUtils]: 130: Hoare triple {40656#(<= main_~i~0 31)} assume true; {40656#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,041 INFO L273 TraceCheckUtils]: 131: Hoare triple {40656#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40656#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,041 INFO L273 TraceCheckUtils]: 132: Hoare triple {40656#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40656#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,042 INFO L273 TraceCheckUtils]: 133: Hoare triple {40656#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {40657#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,042 INFO L273 TraceCheckUtils]: 134: Hoare triple {40657#(<= main_~i~0 32)} assume true; {40657#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,043 INFO L273 TraceCheckUtils]: 135: Hoare triple {40657#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40657#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,043 INFO L273 TraceCheckUtils]: 136: Hoare triple {40657#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40657#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,044 INFO L273 TraceCheckUtils]: 137: Hoare triple {40657#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {40658#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:11,044 INFO L273 TraceCheckUtils]: 138: Hoare triple {40658#(<= main_~i~0 33)} assume true; {40658#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:11,045 INFO L273 TraceCheckUtils]: 139: Hoare triple {40658#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40658#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:11,045 INFO L273 TraceCheckUtils]: 140: Hoare triple {40658#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40658#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:11,046 INFO L273 TraceCheckUtils]: 141: Hoare triple {40658#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {40659#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:11,047 INFO L273 TraceCheckUtils]: 142: Hoare triple {40659#(<= main_~i~0 34)} assume true; {40659#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:11,047 INFO L273 TraceCheckUtils]: 143: Hoare triple {40659#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40659#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:11,047 INFO L273 TraceCheckUtils]: 144: Hoare triple {40659#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40659#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:11,048 INFO L273 TraceCheckUtils]: 145: Hoare triple {40659#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {40660#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:11,049 INFO L273 TraceCheckUtils]: 146: Hoare triple {40660#(<= main_~i~0 35)} assume true; {40660#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:11,049 INFO L273 TraceCheckUtils]: 147: Hoare triple {40660#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40660#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:11,050 INFO L273 TraceCheckUtils]: 148: Hoare triple {40660#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40660#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:11,050 INFO L273 TraceCheckUtils]: 149: Hoare triple {40660#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {40661#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:11,051 INFO L273 TraceCheckUtils]: 150: Hoare triple {40661#(<= main_~i~0 36)} assume true; {40661#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:11,051 INFO L273 TraceCheckUtils]: 151: Hoare triple {40661#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40661#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:11,052 INFO L273 TraceCheckUtils]: 152: Hoare triple {40661#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40661#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:11,052 INFO L273 TraceCheckUtils]: 153: Hoare triple {40661#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {40662#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:11,053 INFO L273 TraceCheckUtils]: 154: Hoare triple {40662#(<= main_~i~0 37)} assume true; {40662#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:11,053 INFO L273 TraceCheckUtils]: 155: Hoare triple {40662#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40662#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:11,054 INFO L273 TraceCheckUtils]: 156: Hoare triple {40662#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40662#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:11,054 INFO L273 TraceCheckUtils]: 157: Hoare triple {40662#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {40663#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:11,055 INFO L273 TraceCheckUtils]: 158: Hoare triple {40663#(<= main_~i~0 38)} assume true; {40663#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:11,055 INFO L273 TraceCheckUtils]: 159: Hoare triple {40663#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40663#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:11,056 INFO L273 TraceCheckUtils]: 160: Hoare triple {40663#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40663#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:11,056 INFO L273 TraceCheckUtils]: 161: Hoare triple {40663#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {40664#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:11,057 INFO L273 TraceCheckUtils]: 162: Hoare triple {40664#(<= main_~i~0 39)} assume true; {40664#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:11,057 INFO L273 TraceCheckUtils]: 163: Hoare triple {40664#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40664#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:11,058 INFO L273 TraceCheckUtils]: 164: Hoare triple {40664#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40664#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:11,059 INFO L273 TraceCheckUtils]: 165: Hoare triple {40664#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {40665#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:11,059 INFO L273 TraceCheckUtils]: 166: Hoare triple {40665#(<= main_~i~0 40)} assume true; {40665#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:11,060 INFO L273 TraceCheckUtils]: 167: Hoare triple {40665#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40665#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:11,060 INFO L273 TraceCheckUtils]: 168: Hoare triple {40665#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40665#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:11,061 INFO L273 TraceCheckUtils]: 169: Hoare triple {40665#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {40666#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:11,061 INFO L273 TraceCheckUtils]: 170: Hoare triple {40666#(<= main_~i~0 41)} assume true; {40666#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:11,062 INFO L273 TraceCheckUtils]: 171: Hoare triple {40666#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40666#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:11,062 INFO L273 TraceCheckUtils]: 172: Hoare triple {40666#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40666#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:11,063 INFO L273 TraceCheckUtils]: 173: Hoare triple {40666#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {40667#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:11,063 INFO L273 TraceCheckUtils]: 174: Hoare triple {40667#(<= main_~i~0 42)} assume true; {40667#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:11,064 INFO L273 TraceCheckUtils]: 175: Hoare triple {40667#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40667#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:11,064 INFO L273 TraceCheckUtils]: 176: Hoare triple {40667#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40667#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:11,065 INFO L273 TraceCheckUtils]: 177: Hoare triple {40667#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {40668#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:11,065 INFO L273 TraceCheckUtils]: 178: Hoare triple {40668#(<= main_~i~0 43)} assume true; {40668#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:11,066 INFO L273 TraceCheckUtils]: 179: Hoare triple {40668#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40668#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:11,066 INFO L273 TraceCheckUtils]: 180: Hoare triple {40668#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40668#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:11,067 INFO L273 TraceCheckUtils]: 181: Hoare triple {40668#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {40669#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:11,067 INFO L273 TraceCheckUtils]: 182: Hoare triple {40669#(<= main_~i~0 44)} assume true; {40669#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:11,068 INFO L273 TraceCheckUtils]: 183: Hoare triple {40669#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40669#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:11,068 INFO L273 TraceCheckUtils]: 184: Hoare triple {40669#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40669#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:11,069 INFO L273 TraceCheckUtils]: 185: Hoare triple {40669#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {40670#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:11,070 INFO L273 TraceCheckUtils]: 186: Hoare triple {40670#(<= main_~i~0 45)} assume true; {40670#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:11,070 INFO L273 TraceCheckUtils]: 187: Hoare triple {40670#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40670#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:11,071 INFO L273 TraceCheckUtils]: 188: Hoare triple {40670#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40670#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:11,071 INFO L273 TraceCheckUtils]: 189: Hoare triple {40670#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {40671#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:11,072 INFO L273 TraceCheckUtils]: 190: Hoare triple {40671#(<= main_~i~0 46)} assume true; {40671#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:11,072 INFO L273 TraceCheckUtils]: 191: Hoare triple {40671#(<= main_~i~0 46)} assume !(~i~0 < 100000); {40624#false} is VALID [2018-11-18 22:58:11,073 INFO L273 TraceCheckUtils]: 192: Hoare triple {40624#false} havoc ~x~0;~x~0 := 0; {40624#false} is VALID [2018-11-18 22:58:11,073 INFO L273 TraceCheckUtils]: 193: Hoare triple {40624#false} assume true; {40624#false} is VALID [2018-11-18 22:58:11,073 INFO L273 TraceCheckUtils]: 194: Hoare triple {40624#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {40624#false} is VALID [2018-11-18 22:58:11,073 INFO L256 TraceCheckUtils]: 195: Hoare triple {40624#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {40624#false} is VALID [2018-11-18 22:58:11,073 INFO L273 TraceCheckUtils]: 196: Hoare triple {40624#false} ~cond := #in~cond; {40624#false} is VALID [2018-11-18 22:58:11,073 INFO L273 TraceCheckUtils]: 197: Hoare triple {40624#false} assume 0 == ~cond; {40624#false} is VALID [2018-11-18 22:58:11,074 INFO L273 TraceCheckUtils]: 198: Hoare triple {40624#false} assume !false; {40624#false} is VALID [2018-11-18 22:58:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:11,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:11,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:11,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:58:11,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:58:11,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:11,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:11,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {40623#true} call ULTIMATE.init(); {40623#true} is VALID [2018-11-18 22:58:11,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {40623#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40623#true} is VALID [2018-11-18 22:58:11,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {40623#true} assume true; {40623#true} is VALID [2018-11-18 22:58:11,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40623#true} {40623#true} #57#return; {40623#true} is VALID [2018-11-18 22:58:11,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {40623#true} call #t~ret4 := main(); {40623#true} is VALID [2018-11-18 22:58:11,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {40623#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {40690#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:11,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {40690#(<= main_~i~0 0)} assume true; {40690#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:11,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {40690#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40690#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:11,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {40690#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40690#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:11,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {40690#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {40626#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:11,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {40626#(<= main_~i~0 1)} assume true; {40626#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:11,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {40626#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40626#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:11,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {40626#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40626#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:11,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {40626#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {40627#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:11,625 INFO L273 TraceCheckUtils]: 14: Hoare triple {40627#(<= main_~i~0 2)} assume true; {40627#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:11,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {40627#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40627#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:11,626 INFO L273 TraceCheckUtils]: 16: Hoare triple {40627#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40627#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:11,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {40627#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {40628#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:11,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {40628#(<= main_~i~0 3)} assume true; {40628#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:11,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {40628#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40628#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:11,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {40628#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40628#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:11,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {40628#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {40629#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:11,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {40629#(<= main_~i~0 4)} assume true; {40629#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:11,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {40629#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40629#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:11,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {40629#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40629#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:11,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {40629#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {40630#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:11,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {40630#(<= main_~i~0 5)} assume true; {40630#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:11,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {40630#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40630#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:11,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {40630#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40630#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:11,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {40630#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {40631#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:11,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {40631#(<= main_~i~0 6)} assume true; {40631#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:11,633 INFO L273 TraceCheckUtils]: 31: Hoare triple {40631#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40631#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:11,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {40631#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40631#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:11,634 INFO L273 TraceCheckUtils]: 33: Hoare triple {40631#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {40632#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:11,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {40632#(<= main_~i~0 7)} assume true; {40632#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:11,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {40632#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40632#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:11,636 INFO L273 TraceCheckUtils]: 36: Hoare triple {40632#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40632#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:11,637 INFO L273 TraceCheckUtils]: 37: Hoare triple {40632#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {40633#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:11,637 INFO L273 TraceCheckUtils]: 38: Hoare triple {40633#(<= main_~i~0 8)} assume true; {40633#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:11,638 INFO L273 TraceCheckUtils]: 39: Hoare triple {40633#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40633#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:11,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {40633#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40633#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:11,639 INFO L273 TraceCheckUtils]: 41: Hoare triple {40633#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {40634#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:11,639 INFO L273 TraceCheckUtils]: 42: Hoare triple {40634#(<= main_~i~0 9)} assume true; {40634#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:11,640 INFO L273 TraceCheckUtils]: 43: Hoare triple {40634#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40634#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:11,640 INFO L273 TraceCheckUtils]: 44: Hoare triple {40634#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40634#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:11,641 INFO L273 TraceCheckUtils]: 45: Hoare triple {40634#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {40635#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:11,641 INFO L273 TraceCheckUtils]: 46: Hoare triple {40635#(<= main_~i~0 10)} assume true; {40635#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:11,642 INFO L273 TraceCheckUtils]: 47: Hoare triple {40635#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40635#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:11,642 INFO L273 TraceCheckUtils]: 48: Hoare triple {40635#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40635#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:11,643 INFO L273 TraceCheckUtils]: 49: Hoare triple {40635#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {40636#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:11,643 INFO L273 TraceCheckUtils]: 50: Hoare triple {40636#(<= main_~i~0 11)} assume true; {40636#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:11,644 INFO L273 TraceCheckUtils]: 51: Hoare triple {40636#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40636#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:11,644 INFO L273 TraceCheckUtils]: 52: Hoare triple {40636#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40636#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:11,645 INFO L273 TraceCheckUtils]: 53: Hoare triple {40636#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {40637#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,646 INFO L273 TraceCheckUtils]: 54: Hoare triple {40637#(<= main_~i~0 12)} assume true; {40637#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,646 INFO L273 TraceCheckUtils]: 55: Hoare triple {40637#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40637#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,647 INFO L273 TraceCheckUtils]: 56: Hoare triple {40637#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40637#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,647 INFO L273 TraceCheckUtils]: 57: Hoare triple {40637#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {40638#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,648 INFO L273 TraceCheckUtils]: 58: Hoare triple {40638#(<= main_~i~0 13)} assume true; {40638#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,648 INFO L273 TraceCheckUtils]: 59: Hoare triple {40638#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40638#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,649 INFO L273 TraceCheckUtils]: 60: Hoare triple {40638#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40638#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,649 INFO L273 TraceCheckUtils]: 61: Hoare triple {40638#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {40639#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,650 INFO L273 TraceCheckUtils]: 62: Hoare triple {40639#(<= main_~i~0 14)} assume true; {40639#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,650 INFO L273 TraceCheckUtils]: 63: Hoare triple {40639#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40639#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,651 INFO L273 TraceCheckUtils]: 64: Hoare triple {40639#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40639#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,652 INFO L273 TraceCheckUtils]: 65: Hoare triple {40639#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {40640#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,652 INFO L273 TraceCheckUtils]: 66: Hoare triple {40640#(<= main_~i~0 15)} assume true; {40640#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,652 INFO L273 TraceCheckUtils]: 67: Hoare triple {40640#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40640#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,653 INFO L273 TraceCheckUtils]: 68: Hoare triple {40640#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40640#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,654 INFO L273 TraceCheckUtils]: 69: Hoare triple {40640#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {40641#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,654 INFO L273 TraceCheckUtils]: 70: Hoare triple {40641#(<= main_~i~0 16)} assume true; {40641#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,655 INFO L273 TraceCheckUtils]: 71: Hoare triple {40641#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40641#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,655 INFO L273 TraceCheckUtils]: 72: Hoare triple {40641#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40641#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,656 INFO L273 TraceCheckUtils]: 73: Hoare triple {40641#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {40642#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,656 INFO L273 TraceCheckUtils]: 74: Hoare triple {40642#(<= main_~i~0 17)} assume true; {40642#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,657 INFO L273 TraceCheckUtils]: 75: Hoare triple {40642#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40642#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,657 INFO L273 TraceCheckUtils]: 76: Hoare triple {40642#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40642#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,658 INFO L273 TraceCheckUtils]: 77: Hoare triple {40642#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {40643#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,658 INFO L273 TraceCheckUtils]: 78: Hoare triple {40643#(<= main_~i~0 18)} assume true; {40643#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,659 INFO L273 TraceCheckUtils]: 79: Hoare triple {40643#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40643#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,659 INFO L273 TraceCheckUtils]: 80: Hoare triple {40643#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40643#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,660 INFO L273 TraceCheckUtils]: 81: Hoare triple {40643#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {40644#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,661 INFO L273 TraceCheckUtils]: 82: Hoare triple {40644#(<= main_~i~0 19)} assume true; {40644#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,661 INFO L273 TraceCheckUtils]: 83: Hoare triple {40644#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40644#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,662 INFO L273 TraceCheckUtils]: 84: Hoare triple {40644#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40644#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,662 INFO L273 TraceCheckUtils]: 85: Hoare triple {40644#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {40645#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,663 INFO L273 TraceCheckUtils]: 86: Hoare triple {40645#(<= main_~i~0 20)} assume true; {40645#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,663 INFO L273 TraceCheckUtils]: 87: Hoare triple {40645#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40645#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,664 INFO L273 TraceCheckUtils]: 88: Hoare triple {40645#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40645#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,664 INFO L273 TraceCheckUtils]: 89: Hoare triple {40645#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {40646#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,665 INFO L273 TraceCheckUtils]: 90: Hoare triple {40646#(<= main_~i~0 21)} assume true; {40646#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,665 INFO L273 TraceCheckUtils]: 91: Hoare triple {40646#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40646#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,666 INFO L273 TraceCheckUtils]: 92: Hoare triple {40646#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40646#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,667 INFO L273 TraceCheckUtils]: 93: Hoare triple {40646#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {40647#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,667 INFO L273 TraceCheckUtils]: 94: Hoare triple {40647#(<= main_~i~0 22)} assume true; {40647#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,668 INFO L273 TraceCheckUtils]: 95: Hoare triple {40647#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40647#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,668 INFO L273 TraceCheckUtils]: 96: Hoare triple {40647#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40647#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,669 INFO L273 TraceCheckUtils]: 97: Hoare triple {40647#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {40648#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,669 INFO L273 TraceCheckUtils]: 98: Hoare triple {40648#(<= main_~i~0 23)} assume true; {40648#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,670 INFO L273 TraceCheckUtils]: 99: Hoare triple {40648#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40648#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,670 INFO L273 TraceCheckUtils]: 100: Hoare triple {40648#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40648#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,671 INFO L273 TraceCheckUtils]: 101: Hoare triple {40648#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {40649#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,671 INFO L273 TraceCheckUtils]: 102: Hoare triple {40649#(<= main_~i~0 24)} assume true; {40649#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,672 INFO L273 TraceCheckUtils]: 103: Hoare triple {40649#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40649#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,672 INFO L273 TraceCheckUtils]: 104: Hoare triple {40649#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40649#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,673 INFO L273 TraceCheckUtils]: 105: Hoare triple {40649#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {40650#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,674 INFO L273 TraceCheckUtils]: 106: Hoare triple {40650#(<= main_~i~0 25)} assume true; {40650#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,674 INFO L273 TraceCheckUtils]: 107: Hoare triple {40650#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40650#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,675 INFO L273 TraceCheckUtils]: 108: Hoare triple {40650#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40650#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,675 INFO L273 TraceCheckUtils]: 109: Hoare triple {40650#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {40651#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,676 INFO L273 TraceCheckUtils]: 110: Hoare triple {40651#(<= main_~i~0 26)} assume true; {40651#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,676 INFO L273 TraceCheckUtils]: 111: Hoare triple {40651#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40651#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,677 INFO L273 TraceCheckUtils]: 112: Hoare triple {40651#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40651#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,678 INFO L273 TraceCheckUtils]: 113: Hoare triple {40651#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {40652#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,678 INFO L273 TraceCheckUtils]: 114: Hoare triple {40652#(<= main_~i~0 27)} assume true; {40652#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,679 INFO L273 TraceCheckUtils]: 115: Hoare triple {40652#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40652#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,679 INFO L273 TraceCheckUtils]: 116: Hoare triple {40652#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40652#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,680 INFO L273 TraceCheckUtils]: 117: Hoare triple {40652#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {40653#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,680 INFO L273 TraceCheckUtils]: 118: Hoare triple {40653#(<= main_~i~0 28)} assume true; {40653#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,681 INFO L273 TraceCheckUtils]: 119: Hoare triple {40653#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40653#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,681 INFO L273 TraceCheckUtils]: 120: Hoare triple {40653#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40653#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,682 INFO L273 TraceCheckUtils]: 121: Hoare triple {40653#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {40654#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,682 INFO L273 TraceCheckUtils]: 122: Hoare triple {40654#(<= main_~i~0 29)} assume true; {40654#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,683 INFO L273 TraceCheckUtils]: 123: Hoare triple {40654#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40654#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,683 INFO L273 TraceCheckUtils]: 124: Hoare triple {40654#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40654#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,684 INFO L273 TraceCheckUtils]: 125: Hoare triple {40654#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {40655#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,685 INFO L273 TraceCheckUtils]: 126: Hoare triple {40655#(<= main_~i~0 30)} assume true; {40655#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,685 INFO L273 TraceCheckUtils]: 127: Hoare triple {40655#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40655#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,686 INFO L273 TraceCheckUtils]: 128: Hoare triple {40655#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40655#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,686 INFO L273 TraceCheckUtils]: 129: Hoare triple {40655#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {40656#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,687 INFO L273 TraceCheckUtils]: 130: Hoare triple {40656#(<= main_~i~0 31)} assume true; {40656#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,687 INFO L273 TraceCheckUtils]: 131: Hoare triple {40656#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40656#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,688 INFO L273 TraceCheckUtils]: 132: Hoare triple {40656#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40656#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,688 INFO L273 TraceCheckUtils]: 133: Hoare triple {40656#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {40657#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,689 INFO L273 TraceCheckUtils]: 134: Hoare triple {40657#(<= main_~i~0 32)} assume true; {40657#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,689 INFO L273 TraceCheckUtils]: 135: Hoare triple {40657#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40657#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,690 INFO L273 TraceCheckUtils]: 136: Hoare triple {40657#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40657#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,691 INFO L273 TraceCheckUtils]: 137: Hoare triple {40657#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {40658#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:11,691 INFO L273 TraceCheckUtils]: 138: Hoare triple {40658#(<= main_~i~0 33)} assume true; {40658#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:11,692 INFO L273 TraceCheckUtils]: 139: Hoare triple {40658#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40658#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:11,692 INFO L273 TraceCheckUtils]: 140: Hoare triple {40658#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40658#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:11,693 INFO L273 TraceCheckUtils]: 141: Hoare triple {40658#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {40659#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:11,693 INFO L273 TraceCheckUtils]: 142: Hoare triple {40659#(<= main_~i~0 34)} assume true; {40659#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:11,694 INFO L273 TraceCheckUtils]: 143: Hoare triple {40659#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40659#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:11,694 INFO L273 TraceCheckUtils]: 144: Hoare triple {40659#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40659#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:11,695 INFO L273 TraceCheckUtils]: 145: Hoare triple {40659#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {40660#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:11,696 INFO L273 TraceCheckUtils]: 146: Hoare triple {40660#(<= main_~i~0 35)} assume true; {40660#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:11,696 INFO L273 TraceCheckUtils]: 147: Hoare triple {40660#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40660#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:11,696 INFO L273 TraceCheckUtils]: 148: Hoare triple {40660#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40660#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:11,697 INFO L273 TraceCheckUtils]: 149: Hoare triple {40660#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {40661#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:11,698 INFO L273 TraceCheckUtils]: 150: Hoare triple {40661#(<= main_~i~0 36)} assume true; {40661#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:11,698 INFO L273 TraceCheckUtils]: 151: Hoare triple {40661#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40661#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:11,699 INFO L273 TraceCheckUtils]: 152: Hoare triple {40661#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40661#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:11,699 INFO L273 TraceCheckUtils]: 153: Hoare triple {40661#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {40662#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:11,700 INFO L273 TraceCheckUtils]: 154: Hoare triple {40662#(<= main_~i~0 37)} assume true; {40662#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:11,700 INFO L273 TraceCheckUtils]: 155: Hoare triple {40662#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40662#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:11,701 INFO L273 TraceCheckUtils]: 156: Hoare triple {40662#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40662#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:11,702 INFO L273 TraceCheckUtils]: 157: Hoare triple {40662#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {40663#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:11,702 INFO L273 TraceCheckUtils]: 158: Hoare triple {40663#(<= main_~i~0 38)} assume true; {40663#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:11,703 INFO L273 TraceCheckUtils]: 159: Hoare triple {40663#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40663#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:11,703 INFO L273 TraceCheckUtils]: 160: Hoare triple {40663#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40663#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:11,704 INFO L273 TraceCheckUtils]: 161: Hoare triple {40663#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {40664#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:11,704 INFO L273 TraceCheckUtils]: 162: Hoare triple {40664#(<= main_~i~0 39)} assume true; {40664#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:11,705 INFO L273 TraceCheckUtils]: 163: Hoare triple {40664#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40664#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:11,705 INFO L273 TraceCheckUtils]: 164: Hoare triple {40664#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40664#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:11,706 INFO L273 TraceCheckUtils]: 165: Hoare triple {40664#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {40665#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:11,706 INFO L273 TraceCheckUtils]: 166: Hoare triple {40665#(<= main_~i~0 40)} assume true; {40665#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:11,707 INFO L273 TraceCheckUtils]: 167: Hoare triple {40665#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40665#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:11,707 INFO L273 TraceCheckUtils]: 168: Hoare triple {40665#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40665#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:11,708 INFO L273 TraceCheckUtils]: 169: Hoare triple {40665#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {40666#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:11,709 INFO L273 TraceCheckUtils]: 170: Hoare triple {40666#(<= main_~i~0 41)} assume true; {40666#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:11,709 INFO L273 TraceCheckUtils]: 171: Hoare triple {40666#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40666#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:11,710 INFO L273 TraceCheckUtils]: 172: Hoare triple {40666#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40666#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:11,710 INFO L273 TraceCheckUtils]: 173: Hoare triple {40666#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {40667#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:11,711 INFO L273 TraceCheckUtils]: 174: Hoare triple {40667#(<= main_~i~0 42)} assume true; {40667#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:11,711 INFO L273 TraceCheckUtils]: 175: Hoare triple {40667#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40667#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:11,712 INFO L273 TraceCheckUtils]: 176: Hoare triple {40667#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40667#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:11,712 INFO L273 TraceCheckUtils]: 177: Hoare triple {40667#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {40668#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:11,713 INFO L273 TraceCheckUtils]: 178: Hoare triple {40668#(<= main_~i~0 43)} assume true; {40668#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:11,713 INFO L273 TraceCheckUtils]: 179: Hoare triple {40668#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40668#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:11,714 INFO L273 TraceCheckUtils]: 180: Hoare triple {40668#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40668#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:11,715 INFO L273 TraceCheckUtils]: 181: Hoare triple {40668#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {40669#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:11,715 INFO L273 TraceCheckUtils]: 182: Hoare triple {40669#(<= main_~i~0 44)} assume true; {40669#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:11,716 INFO L273 TraceCheckUtils]: 183: Hoare triple {40669#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40669#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:11,716 INFO L273 TraceCheckUtils]: 184: Hoare triple {40669#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40669#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:11,717 INFO L273 TraceCheckUtils]: 185: Hoare triple {40669#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {40670#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:11,717 INFO L273 TraceCheckUtils]: 186: Hoare triple {40670#(<= main_~i~0 45)} assume true; {40670#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:11,718 INFO L273 TraceCheckUtils]: 187: Hoare triple {40670#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40670#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:11,718 INFO L273 TraceCheckUtils]: 188: Hoare triple {40670#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40670#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:11,719 INFO L273 TraceCheckUtils]: 189: Hoare triple {40670#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {40671#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:11,720 INFO L273 TraceCheckUtils]: 190: Hoare triple {40671#(<= main_~i~0 46)} assume true; {40671#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:11,720 INFO L273 TraceCheckUtils]: 191: Hoare triple {40671#(<= main_~i~0 46)} assume !(~i~0 < 100000); {40624#false} is VALID [2018-11-18 22:58:11,720 INFO L273 TraceCheckUtils]: 192: Hoare triple {40624#false} havoc ~x~0;~x~0 := 0; {40624#false} is VALID [2018-11-18 22:58:11,721 INFO L273 TraceCheckUtils]: 193: Hoare triple {40624#false} assume true; {40624#false} is VALID [2018-11-18 22:58:11,721 INFO L273 TraceCheckUtils]: 194: Hoare triple {40624#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {40624#false} is VALID [2018-11-18 22:58:11,721 INFO L256 TraceCheckUtils]: 195: Hoare triple {40624#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {40624#false} is VALID [2018-11-18 22:58:11,721 INFO L273 TraceCheckUtils]: 196: Hoare triple {40624#false} ~cond := #in~cond; {40624#false} is VALID [2018-11-18 22:58:11,721 INFO L273 TraceCheckUtils]: 197: Hoare triple {40624#false} assume 0 == ~cond; {40624#false} is VALID [2018-11-18 22:58:11,721 INFO L273 TraceCheckUtils]: 198: Hoare triple {40624#false} assume !false; {40624#false} is VALID [2018-11-18 22:58:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:11,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:11,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2018-11-18 22:58:11,769 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 199 [2018-11-18 22:58:11,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:11,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-18 22:58:11,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:11,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-18 22:58:11,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-18 22:58:11,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 22:58:11,963 INFO L87 Difference]: Start difference. First operand 204 states and 251 transitions. Second operand 50 states. [2018-11-18 22:58:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:12,983 INFO L93 Difference]: Finished difference Result 222 states and 272 transitions. [2018-11-18 22:58:12,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-18 22:58:12,983 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 199 [2018-11-18 22:58:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 22:58:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 272 transitions. [2018-11-18 22:58:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 22:58:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 272 transitions. [2018-11-18 22:58:12,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 272 transitions. [2018-11-18 22:58:13,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:13,236 INFO L225 Difference]: With dead ends: 222 [2018-11-18 22:58:13,236 INFO L226 Difference]: Without dead ends: 210 [2018-11-18 22:58:13,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 22:58:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-18 22:58:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-11-18 22:58:13,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:13,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 208 states. [2018-11-18 22:58:13,766 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 208 states. [2018-11-18 22:58:13,766 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 208 states. [2018-11-18 22:58:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:13,770 INFO L93 Difference]: Finished difference Result 210 states and 259 transitions. [2018-11-18 22:58:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 259 transitions. [2018-11-18 22:58:13,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:13,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:13,770 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 210 states. [2018-11-18 22:58:13,770 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 210 states. [2018-11-18 22:58:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:13,776 INFO L93 Difference]: Finished difference Result 210 states and 259 transitions. [2018-11-18 22:58:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 259 transitions. [2018-11-18 22:58:13,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:13,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:13,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:13,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 22:58:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 256 transitions. [2018-11-18 22:58:13,780 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 256 transitions. Word has length 199 [2018-11-18 22:58:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:13,781 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 256 transitions. [2018-11-18 22:58:13,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-18 22:58:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 256 transitions. [2018-11-18 22:58:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-18 22:58:13,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:13,782 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:13,782 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:13,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:13,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1963031884, now seen corresponding path program 47 times [2018-11-18 22:58:13,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:13,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:13,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:13,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:13,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:14,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {42232#true} call ULTIMATE.init(); {42232#true} is VALID [2018-11-18 22:58:14,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {42232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42232#true} is VALID [2018-11-18 22:58:14,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {42232#true} assume true; {42232#true} is VALID [2018-11-18 22:58:14,969 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42232#true} {42232#true} #57#return; {42232#true} is VALID [2018-11-18 22:58:14,969 INFO L256 TraceCheckUtils]: 4: Hoare triple {42232#true} call #t~ret4 := main(); {42232#true} is VALID [2018-11-18 22:58:14,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {42232#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {42234#(= main_~i~0 0)} is VALID [2018-11-18 22:58:14,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {42234#(= main_~i~0 0)} assume true; {42234#(= main_~i~0 0)} is VALID [2018-11-18 22:58:14,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {42234#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42234#(= main_~i~0 0)} is VALID [2018-11-18 22:58:14,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {42234#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42234#(= main_~i~0 0)} is VALID [2018-11-18 22:58:14,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {42234#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {42235#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:14,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {42235#(<= main_~i~0 1)} assume true; {42235#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:14,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {42235#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42235#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:14,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {42235#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42235#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:14,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {42235#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {42236#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:14,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {42236#(<= main_~i~0 2)} assume true; {42236#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:14,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {42236#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42236#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:14,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {42236#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42236#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:14,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {42236#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {42237#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:14,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {42237#(<= main_~i~0 3)} assume true; {42237#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:14,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {42237#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42237#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:14,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {42237#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42237#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:14,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {42237#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {42238#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:14,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {42238#(<= main_~i~0 4)} assume true; {42238#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:14,977 INFO L273 TraceCheckUtils]: 23: Hoare triple {42238#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42238#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:14,978 INFO L273 TraceCheckUtils]: 24: Hoare triple {42238#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42238#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:14,978 INFO L273 TraceCheckUtils]: 25: Hoare triple {42238#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {42239#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:14,979 INFO L273 TraceCheckUtils]: 26: Hoare triple {42239#(<= main_~i~0 5)} assume true; {42239#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:14,979 INFO L273 TraceCheckUtils]: 27: Hoare triple {42239#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42239#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:14,980 INFO L273 TraceCheckUtils]: 28: Hoare triple {42239#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42239#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:14,981 INFO L273 TraceCheckUtils]: 29: Hoare triple {42239#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {42240#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:14,981 INFO L273 TraceCheckUtils]: 30: Hoare triple {42240#(<= main_~i~0 6)} assume true; {42240#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:14,982 INFO L273 TraceCheckUtils]: 31: Hoare triple {42240#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42240#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:14,982 INFO L273 TraceCheckUtils]: 32: Hoare triple {42240#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42240#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:14,983 INFO L273 TraceCheckUtils]: 33: Hoare triple {42240#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {42241#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:14,983 INFO L273 TraceCheckUtils]: 34: Hoare triple {42241#(<= main_~i~0 7)} assume true; {42241#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:14,984 INFO L273 TraceCheckUtils]: 35: Hoare triple {42241#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42241#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:14,984 INFO L273 TraceCheckUtils]: 36: Hoare triple {42241#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42241#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:14,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {42241#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {42242#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:14,986 INFO L273 TraceCheckUtils]: 38: Hoare triple {42242#(<= main_~i~0 8)} assume true; {42242#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:14,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {42242#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42242#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:14,987 INFO L273 TraceCheckUtils]: 40: Hoare triple {42242#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42242#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:14,987 INFO L273 TraceCheckUtils]: 41: Hoare triple {42242#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {42243#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:14,988 INFO L273 TraceCheckUtils]: 42: Hoare triple {42243#(<= main_~i~0 9)} assume true; {42243#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:14,988 INFO L273 TraceCheckUtils]: 43: Hoare triple {42243#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42243#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:14,989 INFO L273 TraceCheckUtils]: 44: Hoare triple {42243#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42243#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:14,990 INFO L273 TraceCheckUtils]: 45: Hoare triple {42243#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {42244#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:14,990 INFO L273 TraceCheckUtils]: 46: Hoare triple {42244#(<= main_~i~0 10)} assume true; {42244#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:14,991 INFO L273 TraceCheckUtils]: 47: Hoare triple {42244#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42244#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:14,991 INFO L273 TraceCheckUtils]: 48: Hoare triple {42244#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42244#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:14,992 INFO L273 TraceCheckUtils]: 49: Hoare triple {42244#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {42245#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:14,992 INFO L273 TraceCheckUtils]: 50: Hoare triple {42245#(<= main_~i~0 11)} assume true; {42245#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:14,993 INFO L273 TraceCheckUtils]: 51: Hoare triple {42245#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42245#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:14,993 INFO L273 TraceCheckUtils]: 52: Hoare triple {42245#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42245#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:14,994 INFO L273 TraceCheckUtils]: 53: Hoare triple {42245#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {42246#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:14,995 INFO L273 TraceCheckUtils]: 54: Hoare triple {42246#(<= main_~i~0 12)} assume true; {42246#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:14,995 INFO L273 TraceCheckUtils]: 55: Hoare triple {42246#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42246#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:14,995 INFO L273 TraceCheckUtils]: 56: Hoare triple {42246#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42246#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:14,996 INFO L273 TraceCheckUtils]: 57: Hoare triple {42246#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {42247#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:14,997 INFO L273 TraceCheckUtils]: 58: Hoare triple {42247#(<= main_~i~0 13)} assume true; {42247#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:14,997 INFO L273 TraceCheckUtils]: 59: Hoare triple {42247#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42247#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:14,998 INFO L273 TraceCheckUtils]: 60: Hoare triple {42247#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42247#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:14,998 INFO L273 TraceCheckUtils]: 61: Hoare triple {42247#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {42248#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:14,999 INFO L273 TraceCheckUtils]: 62: Hoare triple {42248#(<= main_~i~0 14)} assume true; {42248#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:14,999 INFO L273 TraceCheckUtils]: 63: Hoare triple {42248#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42248#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:15,000 INFO L273 TraceCheckUtils]: 64: Hoare triple {42248#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42248#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:15,001 INFO L273 TraceCheckUtils]: 65: Hoare triple {42248#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {42249#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:15,001 INFO L273 TraceCheckUtils]: 66: Hoare triple {42249#(<= main_~i~0 15)} assume true; {42249#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:15,002 INFO L273 TraceCheckUtils]: 67: Hoare triple {42249#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42249#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:15,002 INFO L273 TraceCheckUtils]: 68: Hoare triple {42249#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42249#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:15,003 INFO L273 TraceCheckUtils]: 69: Hoare triple {42249#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {42250#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:15,003 INFO L273 TraceCheckUtils]: 70: Hoare triple {42250#(<= main_~i~0 16)} assume true; {42250#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:15,004 INFO L273 TraceCheckUtils]: 71: Hoare triple {42250#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42250#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:15,004 INFO L273 TraceCheckUtils]: 72: Hoare triple {42250#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42250#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:15,005 INFO L273 TraceCheckUtils]: 73: Hoare triple {42250#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {42251#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:15,006 INFO L273 TraceCheckUtils]: 74: Hoare triple {42251#(<= main_~i~0 17)} assume true; {42251#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:15,006 INFO L273 TraceCheckUtils]: 75: Hoare triple {42251#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42251#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:15,007 INFO L273 TraceCheckUtils]: 76: Hoare triple {42251#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42251#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:15,007 INFO L273 TraceCheckUtils]: 77: Hoare triple {42251#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {42252#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:15,008 INFO L273 TraceCheckUtils]: 78: Hoare triple {42252#(<= main_~i~0 18)} assume true; {42252#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:15,008 INFO L273 TraceCheckUtils]: 79: Hoare triple {42252#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42252#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:15,009 INFO L273 TraceCheckUtils]: 80: Hoare triple {42252#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42252#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:15,010 INFO L273 TraceCheckUtils]: 81: Hoare triple {42252#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {42253#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:15,010 INFO L273 TraceCheckUtils]: 82: Hoare triple {42253#(<= main_~i~0 19)} assume true; {42253#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:15,011 INFO L273 TraceCheckUtils]: 83: Hoare triple {42253#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42253#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:15,011 INFO L273 TraceCheckUtils]: 84: Hoare triple {42253#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42253#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:15,012 INFO L273 TraceCheckUtils]: 85: Hoare triple {42253#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {42254#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:15,012 INFO L273 TraceCheckUtils]: 86: Hoare triple {42254#(<= main_~i~0 20)} assume true; {42254#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:15,013 INFO L273 TraceCheckUtils]: 87: Hoare triple {42254#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42254#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:15,013 INFO L273 TraceCheckUtils]: 88: Hoare triple {42254#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42254#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:15,014 INFO L273 TraceCheckUtils]: 89: Hoare triple {42254#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {42255#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:15,015 INFO L273 TraceCheckUtils]: 90: Hoare triple {42255#(<= main_~i~0 21)} assume true; {42255#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:15,015 INFO L273 TraceCheckUtils]: 91: Hoare triple {42255#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42255#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:15,016 INFO L273 TraceCheckUtils]: 92: Hoare triple {42255#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42255#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:15,016 INFO L273 TraceCheckUtils]: 93: Hoare triple {42255#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {42256#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:15,017 INFO L273 TraceCheckUtils]: 94: Hoare triple {42256#(<= main_~i~0 22)} assume true; {42256#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:15,017 INFO L273 TraceCheckUtils]: 95: Hoare triple {42256#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42256#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:15,018 INFO L273 TraceCheckUtils]: 96: Hoare triple {42256#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42256#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:15,018 INFO L273 TraceCheckUtils]: 97: Hoare triple {42256#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {42257#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:15,019 INFO L273 TraceCheckUtils]: 98: Hoare triple {42257#(<= main_~i~0 23)} assume true; {42257#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:15,019 INFO L273 TraceCheckUtils]: 99: Hoare triple {42257#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42257#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:15,020 INFO L273 TraceCheckUtils]: 100: Hoare triple {42257#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42257#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:15,021 INFO L273 TraceCheckUtils]: 101: Hoare triple {42257#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {42258#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:15,021 INFO L273 TraceCheckUtils]: 102: Hoare triple {42258#(<= main_~i~0 24)} assume true; {42258#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:15,022 INFO L273 TraceCheckUtils]: 103: Hoare triple {42258#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42258#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:15,022 INFO L273 TraceCheckUtils]: 104: Hoare triple {42258#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42258#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:15,023 INFO L273 TraceCheckUtils]: 105: Hoare triple {42258#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {42259#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:15,023 INFO L273 TraceCheckUtils]: 106: Hoare triple {42259#(<= main_~i~0 25)} assume true; {42259#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:15,024 INFO L273 TraceCheckUtils]: 107: Hoare triple {42259#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42259#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:15,024 INFO L273 TraceCheckUtils]: 108: Hoare triple {42259#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42259#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:15,025 INFO L273 TraceCheckUtils]: 109: Hoare triple {42259#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {42260#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:15,026 INFO L273 TraceCheckUtils]: 110: Hoare triple {42260#(<= main_~i~0 26)} assume true; {42260#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:15,026 INFO L273 TraceCheckUtils]: 111: Hoare triple {42260#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42260#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:15,027 INFO L273 TraceCheckUtils]: 112: Hoare triple {42260#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42260#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:15,027 INFO L273 TraceCheckUtils]: 113: Hoare triple {42260#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {42261#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:15,028 INFO L273 TraceCheckUtils]: 114: Hoare triple {42261#(<= main_~i~0 27)} assume true; {42261#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:15,028 INFO L273 TraceCheckUtils]: 115: Hoare triple {42261#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42261#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:15,029 INFO L273 TraceCheckUtils]: 116: Hoare triple {42261#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42261#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:15,029 INFO L273 TraceCheckUtils]: 117: Hoare triple {42261#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {42262#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:15,030 INFO L273 TraceCheckUtils]: 118: Hoare triple {42262#(<= main_~i~0 28)} assume true; {42262#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:15,030 INFO L273 TraceCheckUtils]: 119: Hoare triple {42262#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42262#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:15,031 INFO L273 TraceCheckUtils]: 120: Hoare triple {42262#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42262#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:15,032 INFO L273 TraceCheckUtils]: 121: Hoare triple {42262#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {42263#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:15,032 INFO L273 TraceCheckUtils]: 122: Hoare triple {42263#(<= main_~i~0 29)} assume true; {42263#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:15,033 INFO L273 TraceCheckUtils]: 123: Hoare triple {42263#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42263#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:15,033 INFO L273 TraceCheckUtils]: 124: Hoare triple {42263#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42263#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:15,034 INFO L273 TraceCheckUtils]: 125: Hoare triple {42263#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {42264#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:15,034 INFO L273 TraceCheckUtils]: 126: Hoare triple {42264#(<= main_~i~0 30)} assume true; {42264#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:15,035 INFO L273 TraceCheckUtils]: 127: Hoare triple {42264#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42264#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:15,035 INFO L273 TraceCheckUtils]: 128: Hoare triple {42264#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42264#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:15,036 INFO L273 TraceCheckUtils]: 129: Hoare triple {42264#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {42265#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:15,037 INFO L273 TraceCheckUtils]: 130: Hoare triple {42265#(<= main_~i~0 31)} assume true; {42265#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:15,037 INFO L273 TraceCheckUtils]: 131: Hoare triple {42265#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42265#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:15,038 INFO L273 TraceCheckUtils]: 132: Hoare triple {42265#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42265#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:15,038 INFO L273 TraceCheckUtils]: 133: Hoare triple {42265#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {42266#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:15,039 INFO L273 TraceCheckUtils]: 134: Hoare triple {42266#(<= main_~i~0 32)} assume true; {42266#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:15,039 INFO L273 TraceCheckUtils]: 135: Hoare triple {42266#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42266#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:15,040 INFO L273 TraceCheckUtils]: 136: Hoare triple {42266#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42266#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:15,041 INFO L273 TraceCheckUtils]: 137: Hoare triple {42266#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {42267#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:15,041 INFO L273 TraceCheckUtils]: 138: Hoare triple {42267#(<= main_~i~0 33)} assume true; {42267#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:15,042 INFO L273 TraceCheckUtils]: 139: Hoare triple {42267#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42267#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:15,042 INFO L273 TraceCheckUtils]: 140: Hoare triple {42267#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42267#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:15,043 INFO L273 TraceCheckUtils]: 141: Hoare triple {42267#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {42268#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:15,043 INFO L273 TraceCheckUtils]: 142: Hoare triple {42268#(<= main_~i~0 34)} assume true; {42268#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:15,044 INFO L273 TraceCheckUtils]: 143: Hoare triple {42268#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42268#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:15,044 INFO L273 TraceCheckUtils]: 144: Hoare triple {42268#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42268#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:15,045 INFO L273 TraceCheckUtils]: 145: Hoare triple {42268#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {42269#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:15,046 INFO L273 TraceCheckUtils]: 146: Hoare triple {42269#(<= main_~i~0 35)} assume true; {42269#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:15,046 INFO L273 TraceCheckUtils]: 147: Hoare triple {42269#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42269#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:15,046 INFO L273 TraceCheckUtils]: 148: Hoare triple {42269#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42269#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:15,047 INFO L273 TraceCheckUtils]: 149: Hoare triple {42269#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {42270#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:15,048 INFO L273 TraceCheckUtils]: 150: Hoare triple {42270#(<= main_~i~0 36)} assume true; {42270#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:15,048 INFO L273 TraceCheckUtils]: 151: Hoare triple {42270#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42270#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:15,049 INFO L273 TraceCheckUtils]: 152: Hoare triple {42270#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42270#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:15,049 INFO L273 TraceCheckUtils]: 153: Hoare triple {42270#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {42271#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:15,050 INFO L273 TraceCheckUtils]: 154: Hoare triple {42271#(<= main_~i~0 37)} assume true; {42271#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:15,050 INFO L273 TraceCheckUtils]: 155: Hoare triple {42271#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42271#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:15,051 INFO L273 TraceCheckUtils]: 156: Hoare triple {42271#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42271#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:15,052 INFO L273 TraceCheckUtils]: 157: Hoare triple {42271#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {42272#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:15,052 INFO L273 TraceCheckUtils]: 158: Hoare triple {42272#(<= main_~i~0 38)} assume true; {42272#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:15,053 INFO L273 TraceCheckUtils]: 159: Hoare triple {42272#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42272#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:15,053 INFO L273 TraceCheckUtils]: 160: Hoare triple {42272#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42272#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:15,054 INFO L273 TraceCheckUtils]: 161: Hoare triple {42272#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {42273#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:15,054 INFO L273 TraceCheckUtils]: 162: Hoare triple {42273#(<= main_~i~0 39)} assume true; {42273#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:15,055 INFO L273 TraceCheckUtils]: 163: Hoare triple {42273#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42273#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:15,055 INFO L273 TraceCheckUtils]: 164: Hoare triple {42273#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42273#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:15,056 INFO L273 TraceCheckUtils]: 165: Hoare triple {42273#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {42274#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:15,057 INFO L273 TraceCheckUtils]: 166: Hoare triple {42274#(<= main_~i~0 40)} assume true; {42274#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:15,057 INFO L273 TraceCheckUtils]: 167: Hoare triple {42274#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42274#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:15,058 INFO L273 TraceCheckUtils]: 168: Hoare triple {42274#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42274#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:15,058 INFO L273 TraceCheckUtils]: 169: Hoare triple {42274#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {42275#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:15,059 INFO L273 TraceCheckUtils]: 170: Hoare triple {42275#(<= main_~i~0 41)} assume true; {42275#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:15,059 INFO L273 TraceCheckUtils]: 171: Hoare triple {42275#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42275#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:15,060 INFO L273 TraceCheckUtils]: 172: Hoare triple {42275#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42275#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:15,061 INFO L273 TraceCheckUtils]: 173: Hoare triple {42275#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {42276#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:15,061 INFO L273 TraceCheckUtils]: 174: Hoare triple {42276#(<= main_~i~0 42)} assume true; {42276#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:15,062 INFO L273 TraceCheckUtils]: 175: Hoare triple {42276#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42276#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:15,062 INFO L273 TraceCheckUtils]: 176: Hoare triple {42276#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42276#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:15,063 INFO L273 TraceCheckUtils]: 177: Hoare triple {42276#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {42277#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:15,063 INFO L273 TraceCheckUtils]: 178: Hoare triple {42277#(<= main_~i~0 43)} assume true; {42277#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:15,064 INFO L273 TraceCheckUtils]: 179: Hoare triple {42277#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42277#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:15,064 INFO L273 TraceCheckUtils]: 180: Hoare triple {42277#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42277#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:15,065 INFO L273 TraceCheckUtils]: 181: Hoare triple {42277#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {42278#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:15,066 INFO L273 TraceCheckUtils]: 182: Hoare triple {42278#(<= main_~i~0 44)} assume true; {42278#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:15,066 INFO L273 TraceCheckUtils]: 183: Hoare triple {42278#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42278#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:15,067 INFO L273 TraceCheckUtils]: 184: Hoare triple {42278#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42278#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:15,067 INFO L273 TraceCheckUtils]: 185: Hoare triple {42278#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {42279#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:15,068 INFO L273 TraceCheckUtils]: 186: Hoare triple {42279#(<= main_~i~0 45)} assume true; {42279#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:15,068 INFO L273 TraceCheckUtils]: 187: Hoare triple {42279#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42279#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:15,069 INFO L273 TraceCheckUtils]: 188: Hoare triple {42279#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42279#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:15,069 INFO L273 TraceCheckUtils]: 189: Hoare triple {42279#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {42280#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:15,070 INFO L273 TraceCheckUtils]: 190: Hoare triple {42280#(<= main_~i~0 46)} assume true; {42280#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:15,070 INFO L273 TraceCheckUtils]: 191: Hoare triple {42280#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42280#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:15,071 INFO L273 TraceCheckUtils]: 192: Hoare triple {42280#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42280#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:15,072 INFO L273 TraceCheckUtils]: 193: Hoare triple {42280#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {42281#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:15,072 INFO L273 TraceCheckUtils]: 194: Hoare triple {42281#(<= main_~i~0 47)} assume true; {42281#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:15,073 INFO L273 TraceCheckUtils]: 195: Hoare triple {42281#(<= main_~i~0 47)} assume !(~i~0 < 100000); {42233#false} is VALID [2018-11-18 22:58:15,073 INFO L273 TraceCheckUtils]: 196: Hoare triple {42233#false} havoc ~x~0;~x~0 := 0; {42233#false} is VALID [2018-11-18 22:58:15,073 INFO L273 TraceCheckUtils]: 197: Hoare triple {42233#false} assume true; {42233#false} is VALID [2018-11-18 22:58:15,073 INFO L273 TraceCheckUtils]: 198: Hoare triple {42233#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {42233#false} is VALID [2018-11-18 22:58:15,074 INFO L256 TraceCheckUtils]: 199: Hoare triple {42233#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {42233#false} is VALID [2018-11-18 22:58:15,074 INFO L273 TraceCheckUtils]: 200: Hoare triple {42233#false} ~cond := #in~cond; {42233#false} is VALID [2018-11-18 22:58:15,074 INFO L273 TraceCheckUtils]: 201: Hoare triple {42233#false} assume 0 == ~cond; {42233#false} is VALID [2018-11-18 22:58:15,074 INFO L273 TraceCheckUtils]: 202: Hoare triple {42233#false} assume !false; {42233#false} is VALID [2018-11-18 22:58:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:15,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:15,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:15,112 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:58:15,654 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-11-18 22:58:15,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:15,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:16,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {42232#true} call ULTIMATE.init(); {42232#true} is VALID [2018-11-18 22:58:16,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {42232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42232#true} is VALID [2018-11-18 22:58:16,065 INFO L273 TraceCheckUtils]: 2: Hoare triple {42232#true} assume true; {42232#true} is VALID [2018-11-18 22:58:16,065 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42232#true} {42232#true} #57#return; {42232#true} is VALID [2018-11-18 22:58:16,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {42232#true} call #t~ret4 := main(); {42232#true} is VALID [2018-11-18 22:58:16,066 INFO L273 TraceCheckUtils]: 5: Hoare triple {42232#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {42300#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:16,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {42300#(<= main_~i~0 0)} assume true; {42300#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:16,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {42300#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42300#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:16,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {42300#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42300#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:16,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {42300#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {42235#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:16,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {42235#(<= main_~i~0 1)} assume true; {42235#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:16,069 INFO L273 TraceCheckUtils]: 11: Hoare triple {42235#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42235#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:16,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {42235#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42235#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:16,071 INFO L273 TraceCheckUtils]: 13: Hoare triple {42235#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {42236#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:16,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {42236#(<= main_~i~0 2)} assume true; {42236#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:16,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {42236#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42236#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:16,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {42236#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42236#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:16,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {42236#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {42237#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:16,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {42237#(<= main_~i~0 3)} assume true; {42237#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:16,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {42237#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42237#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:16,074 INFO L273 TraceCheckUtils]: 20: Hoare triple {42237#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42237#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:16,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {42237#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {42238#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:16,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {42238#(<= main_~i~0 4)} assume true; {42238#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:16,076 INFO L273 TraceCheckUtils]: 23: Hoare triple {42238#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42238#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:16,076 INFO L273 TraceCheckUtils]: 24: Hoare triple {42238#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42238#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:16,077 INFO L273 TraceCheckUtils]: 25: Hoare triple {42238#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {42239#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:16,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {42239#(<= main_~i~0 5)} assume true; {42239#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:16,078 INFO L273 TraceCheckUtils]: 27: Hoare triple {42239#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42239#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:16,079 INFO L273 TraceCheckUtils]: 28: Hoare triple {42239#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42239#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:16,079 INFO L273 TraceCheckUtils]: 29: Hoare triple {42239#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {42240#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:16,080 INFO L273 TraceCheckUtils]: 30: Hoare triple {42240#(<= main_~i~0 6)} assume true; {42240#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:16,080 INFO L273 TraceCheckUtils]: 31: Hoare triple {42240#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42240#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:16,081 INFO L273 TraceCheckUtils]: 32: Hoare triple {42240#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42240#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:16,081 INFO L273 TraceCheckUtils]: 33: Hoare triple {42240#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {42241#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:16,082 INFO L273 TraceCheckUtils]: 34: Hoare triple {42241#(<= main_~i~0 7)} assume true; {42241#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:16,082 INFO L273 TraceCheckUtils]: 35: Hoare triple {42241#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42241#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:16,083 INFO L273 TraceCheckUtils]: 36: Hoare triple {42241#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42241#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:16,083 INFO L273 TraceCheckUtils]: 37: Hoare triple {42241#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {42242#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:16,084 INFO L273 TraceCheckUtils]: 38: Hoare triple {42242#(<= main_~i~0 8)} assume true; {42242#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:16,084 INFO L273 TraceCheckUtils]: 39: Hoare triple {42242#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42242#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:16,085 INFO L273 TraceCheckUtils]: 40: Hoare triple {42242#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42242#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:16,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {42242#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {42243#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:16,086 INFO L273 TraceCheckUtils]: 42: Hoare triple {42243#(<= main_~i~0 9)} assume true; {42243#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:16,086 INFO L273 TraceCheckUtils]: 43: Hoare triple {42243#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42243#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:16,087 INFO L273 TraceCheckUtils]: 44: Hoare triple {42243#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42243#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:16,087 INFO L273 TraceCheckUtils]: 45: Hoare triple {42243#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {42244#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:16,088 INFO L273 TraceCheckUtils]: 46: Hoare triple {42244#(<= main_~i~0 10)} assume true; {42244#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:16,088 INFO L273 TraceCheckUtils]: 47: Hoare triple {42244#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42244#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:16,089 INFO L273 TraceCheckUtils]: 48: Hoare triple {42244#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42244#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:16,089 INFO L273 TraceCheckUtils]: 49: Hoare triple {42244#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {42245#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:16,090 INFO L273 TraceCheckUtils]: 50: Hoare triple {42245#(<= main_~i~0 11)} assume true; {42245#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:16,090 INFO L273 TraceCheckUtils]: 51: Hoare triple {42245#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42245#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:16,091 INFO L273 TraceCheckUtils]: 52: Hoare triple {42245#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42245#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:16,092 INFO L273 TraceCheckUtils]: 53: Hoare triple {42245#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {42246#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:16,092 INFO L273 TraceCheckUtils]: 54: Hoare triple {42246#(<= main_~i~0 12)} assume true; {42246#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:16,092 INFO L273 TraceCheckUtils]: 55: Hoare triple {42246#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42246#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:16,093 INFO L273 TraceCheckUtils]: 56: Hoare triple {42246#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42246#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:16,094 INFO L273 TraceCheckUtils]: 57: Hoare triple {42246#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {42247#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:16,094 INFO L273 TraceCheckUtils]: 58: Hoare triple {42247#(<= main_~i~0 13)} assume true; {42247#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:16,095 INFO L273 TraceCheckUtils]: 59: Hoare triple {42247#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42247#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:16,095 INFO L273 TraceCheckUtils]: 60: Hoare triple {42247#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42247#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:16,096 INFO L273 TraceCheckUtils]: 61: Hoare triple {42247#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {42248#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:16,096 INFO L273 TraceCheckUtils]: 62: Hoare triple {42248#(<= main_~i~0 14)} assume true; {42248#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:16,097 INFO L273 TraceCheckUtils]: 63: Hoare triple {42248#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42248#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:16,097 INFO L273 TraceCheckUtils]: 64: Hoare triple {42248#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42248#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:16,098 INFO L273 TraceCheckUtils]: 65: Hoare triple {42248#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {42249#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:16,098 INFO L273 TraceCheckUtils]: 66: Hoare triple {42249#(<= main_~i~0 15)} assume true; {42249#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:16,099 INFO L273 TraceCheckUtils]: 67: Hoare triple {42249#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42249#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:16,099 INFO L273 TraceCheckUtils]: 68: Hoare triple {42249#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42249#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:16,100 INFO L273 TraceCheckUtils]: 69: Hoare triple {42249#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {42250#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:16,100 INFO L273 TraceCheckUtils]: 70: Hoare triple {42250#(<= main_~i~0 16)} assume true; {42250#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:16,101 INFO L273 TraceCheckUtils]: 71: Hoare triple {42250#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42250#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:16,101 INFO L273 TraceCheckUtils]: 72: Hoare triple {42250#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42250#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:16,102 INFO L273 TraceCheckUtils]: 73: Hoare triple {42250#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {42251#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:16,102 INFO L273 TraceCheckUtils]: 74: Hoare triple {42251#(<= main_~i~0 17)} assume true; {42251#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:16,103 INFO L273 TraceCheckUtils]: 75: Hoare triple {42251#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42251#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:16,103 INFO L273 TraceCheckUtils]: 76: Hoare triple {42251#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42251#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:16,104 INFO L273 TraceCheckUtils]: 77: Hoare triple {42251#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {42252#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:16,104 INFO L273 TraceCheckUtils]: 78: Hoare triple {42252#(<= main_~i~0 18)} assume true; {42252#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:16,105 INFO L273 TraceCheckUtils]: 79: Hoare triple {42252#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42252#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:16,105 INFO L273 TraceCheckUtils]: 80: Hoare triple {42252#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42252#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:16,106 INFO L273 TraceCheckUtils]: 81: Hoare triple {42252#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {42253#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:16,106 INFO L273 TraceCheckUtils]: 82: Hoare triple {42253#(<= main_~i~0 19)} assume true; {42253#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:16,107 INFO L273 TraceCheckUtils]: 83: Hoare triple {42253#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42253#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:16,107 INFO L273 TraceCheckUtils]: 84: Hoare triple {42253#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42253#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:16,108 INFO L273 TraceCheckUtils]: 85: Hoare triple {42253#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {42254#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:16,109 INFO L273 TraceCheckUtils]: 86: Hoare triple {42254#(<= main_~i~0 20)} assume true; {42254#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:16,109 INFO L273 TraceCheckUtils]: 87: Hoare triple {42254#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42254#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:16,109 INFO L273 TraceCheckUtils]: 88: Hoare triple {42254#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42254#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:16,110 INFO L273 TraceCheckUtils]: 89: Hoare triple {42254#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {42255#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:16,111 INFO L273 TraceCheckUtils]: 90: Hoare triple {42255#(<= main_~i~0 21)} assume true; {42255#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:16,111 INFO L273 TraceCheckUtils]: 91: Hoare triple {42255#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42255#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:16,112 INFO L273 TraceCheckUtils]: 92: Hoare triple {42255#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42255#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:16,112 INFO L273 TraceCheckUtils]: 93: Hoare triple {42255#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {42256#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:16,113 INFO L273 TraceCheckUtils]: 94: Hoare triple {42256#(<= main_~i~0 22)} assume true; {42256#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:16,113 INFO L273 TraceCheckUtils]: 95: Hoare triple {42256#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42256#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:16,114 INFO L273 TraceCheckUtils]: 96: Hoare triple {42256#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42256#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:16,114 INFO L273 TraceCheckUtils]: 97: Hoare triple {42256#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {42257#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:16,115 INFO L273 TraceCheckUtils]: 98: Hoare triple {42257#(<= main_~i~0 23)} assume true; {42257#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:16,115 INFO L273 TraceCheckUtils]: 99: Hoare triple {42257#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42257#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:16,116 INFO L273 TraceCheckUtils]: 100: Hoare triple {42257#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42257#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:16,116 INFO L273 TraceCheckUtils]: 101: Hoare triple {42257#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {42258#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:16,117 INFO L273 TraceCheckUtils]: 102: Hoare triple {42258#(<= main_~i~0 24)} assume true; {42258#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:16,117 INFO L273 TraceCheckUtils]: 103: Hoare triple {42258#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42258#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:16,118 INFO L273 TraceCheckUtils]: 104: Hoare triple {42258#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42258#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:16,118 INFO L273 TraceCheckUtils]: 105: Hoare triple {42258#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {42259#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:16,119 INFO L273 TraceCheckUtils]: 106: Hoare triple {42259#(<= main_~i~0 25)} assume true; {42259#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:16,119 INFO L273 TraceCheckUtils]: 107: Hoare triple {42259#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42259#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:16,120 INFO L273 TraceCheckUtils]: 108: Hoare triple {42259#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42259#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:16,120 INFO L273 TraceCheckUtils]: 109: Hoare triple {42259#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {42260#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:16,121 INFO L273 TraceCheckUtils]: 110: Hoare triple {42260#(<= main_~i~0 26)} assume true; {42260#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:16,121 INFO L273 TraceCheckUtils]: 111: Hoare triple {42260#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42260#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:16,122 INFO L273 TraceCheckUtils]: 112: Hoare triple {42260#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42260#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:16,122 INFO L273 TraceCheckUtils]: 113: Hoare triple {42260#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {42261#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:16,123 INFO L273 TraceCheckUtils]: 114: Hoare triple {42261#(<= main_~i~0 27)} assume true; {42261#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:16,123 INFO L273 TraceCheckUtils]: 115: Hoare triple {42261#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42261#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:16,124 INFO L273 TraceCheckUtils]: 116: Hoare triple {42261#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42261#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:16,124 INFO L273 TraceCheckUtils]: 117: Hoare triple {42261#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {42262#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:16,125 INFO L273 TraceCheckUtils]: 118: Hoare triple {42262#(<= main_~i~0 28)} assume true; {42262#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:16,125 INFO L273 TraceCheckUtils]: 119: Hoare triple {42262#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42262#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:16,126 INFO L273 TraceCheckUtils]: 120: Hoare triple {42262#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42262#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:16,127 INFO L273 TraceCheckUtils]: 121: Hoare triple {42262#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {42263#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:16,127 INFO L273 TraceCheckUtils]: 122: Hoare triple {42263#(<= main_~i~0 29)} assume true; {42263#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:16,127 INFO L273 TraceCheckUtils]: 123: Hoare triple {42263#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42263#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:16,128 INFO L273 TraceCheckUtils]: 124: Hoare triple {42263#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42263#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:16,129 INFO L273 TraceCheckUtils]: 125: Hoare triple {42263#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {42264#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:16,129 INFO L273 TraceCheckUtils]: 126: Hoare triple {42264#(<= main_~i~0 30)} assume true; {42264#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:16,130 INFO L273 TraceCheckUtils]: 127: Hoare triple {42264#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42264#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:16,130 INFO L273 TraceCheckUtils]: 128: Hoare triple {42264#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42264#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:16,131 INFO L273 TraceCheckUtils]: 129: Hoare triple {42264#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {42265#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:16,131 INFO L273 TraceCheckUtils]: 130: Hoare triple {42265#(<= main_~i~0 31)} assume true; {42265#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:16,132 INFO L273 TraceCheckUtils]: 131: Hoare triple {42265#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42265#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:16,132 INFO L273 TraceCheckUtils]: 132: Hoare triple {42265#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42265#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:16,133 INFO L273 TraceCheckUtils]: 133: Hoare triple {42265#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {42266#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:16,133 INFO L273 TraceCheckUtils]: 134: Hoare triple {42266#(<= main_~i~0 32)} assume true; {42266#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:16,134 INFO L273 TraceCheckUtils]: 135: Hoare triple {42266#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42266#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:16,134 INFO L273 TraceCheckUtils]: 136: Hoare triple {42266#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42266#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:16,135 INFO L273 TraceCheckUtils]: 137: Hoare triple {42266#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {42267#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:16,135 INFO L273 TraceCheckUtils]: 138: Hoare triple {42267#(<= main_~i~0 33)} assume true; {42267#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:16,136 INFO L273 TraceCheckUtils]: 139: Hoare triple {42267#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42267#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:16,136 INFO L273 TraceCheckUtils]: 140: Hoare triple {42267#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42267#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:16,137 INFO L273 TraceCheckUtils]: 141: Hoare triple {42267#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {42268#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:16,137 INFO L273 TraceCheckUtils]: 142: Hoare triple {42268#(<= main_~i~0 34)} assume true; {42268#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:16,138 INFO L273 TraceCheckUtils]: 143: Hoare triple {42268#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42268#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:16,138 INFO L273 TraceCheckUtils]: 144: Hoare triple {42268#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42268#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:16,139 INFO L273 TraceCheckUtils]: 145: Hoare triple {42268#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {42269#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:16,139 INFO L273 TraceCheckUtils]: 146: Hoare triple {42269#(<= main_~i~0 35)} assume true; {42269#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:16,140 INFO L273 TraceCheckUtils]: 147: Hoare triple {42269#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42269#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:16,140 INFO L273 TraceCheckUtils]: 148: Hoare triple {42269#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42269#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:16,141 INFO L273 TraceCheckUtils]: 149: Hoare triple {42269#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {42270#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:16,142 INFO L273 TraceCheckUtils]: 150: Hoare triple {42270#(<= main_~i~0 36)} assume true; {42270#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:16,142 INFO L273 TraceCheckUtils]: 151: Hoare triple {42270#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42270#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:16,142 INFO L273 TraceCheckUtils]: 152: Hoare triple {42270#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42270#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:16,143 INFO L273 TraceCheckUtils]: 153: Hoare triple {42270#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {42271#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:16,144 INFO L273 TraceCheckUtils]: 154: Hoare triple {42271#(<= main_~i~0 37)} assume true; {42271#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:16,144 INFO L273 TraceCheckUtils]: 155: Hoare triple {42271#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42271#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:16,144 INFO L273 TraceCheckUtils]: 156: Hoare triple {42271#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42271#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:16,145 INFO L273 TraceCheckUtils]: 157: Hoare triple {42271#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {42272#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:16,146 INFO L273 TraceCheckUtils]: 158: Hoare triple {42272#(<= main_~i~0 38)} assume true; {42272#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:16,146 INFO L273 TraceCheckUtils]: 159: Hoare triple {42272#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42272#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:16,147 INFO L273 TraceCheckUtils]: 160: Hoare triple {42272#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42272#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:16,147 INFO L273 TraceCheckUtils]: 161: Hoare triple {42272#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {42273#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:16,148 INFO L273 TraceCheckUtils]: 162: Hoare triple {42273#(<= main_~i~0 39)} assume true; {42273#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:16,148 INFO L273 TraceCheckUtils]: 163: Hoare triple {42273#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42273#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:16,149 INFO L273 TraceCheckUtils]: 164: Hoare triple {42273#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42273#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:16,149 INFO L273 TraceCheckUtils]: 165: Hoare triple {42273#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {42274#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:16,150 INFO L273 TraceCheckUtils]: 166: Hoare triple {42274#(<= main_~i~0 40)} assume true; {42274#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:16,150 INFO L273 TraceCheckUtils]: 167: Hoare triple {42274#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42274#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:16,151 INFO L273 TraceCheckUtils]: 168: Hoare triple {42274#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42274#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:16,151 INFO L273 TraceCheckUtils]: 169: Hoare triple {42274#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {42275#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:16,152 INFO L273 TraceCheckUtils]: 170: Hoare triple {42275#(<= main_~i~0 41)} assume true; {42275#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:16,152 INFO L273 TraceCheckUtils]: 171: Hoare triple {42275#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42275#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:16,153 INFO L273 TraceCheckUtils]: 172: Hoare triple {42275#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42275#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:16,153 INFO L273 TraceCheckUtils]: 173: Hoare triple {42275#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {42276#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:16,154 INFO L273 TraceCheckUtils]: 174: Hoare triple {42276#(<= main_~i~0 42)} assume true; {42276#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:16,154 INFO L273 TraceCheckUtils]: 175: Hoare triple {42276#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42276#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:16,155 INFO L273 TraceCheckUtils]: 176: Hoare triple {42276#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42276#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:16,155 INFO L273 TraceCheckUtils]: 177: Hoare triple {42276#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {42277#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:16,156 INFO L273 TraceCheckUtils]: 178: Hoare triple {42277#(<= main_~i~0 43)} assume true; {42277#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:16,156 INFO L273 TraceCheckUtils]: 179: Hoare triple {42277#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42277#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:16,157 INFO L273 TraceCheckUtils]: 180: Hoare triple {42277#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42277#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:16,158 INFO L273 TraceCheckUtils]: 181: Hoare triple {42277#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {42278#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:16,158 INFO L273 TraceCheckUtils]: 182: Hoare triple {42278#(<= main_~i~0 44)} assume true; {42278#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:16,158 INFO L273 TraceCheckUtils]: 183: Hoare triple {42278#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42278#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:16,159 INFO L273 TraceCheckUtils]: 184: Hoare triple {42278#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42278#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:16,160 INFO L273 TraceCheckUtils]: 185: Hoare triple {42278#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {42279#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:16,160 INFO L273 TraceCheckUtils]: 186: Hoare triple {42279#(<= main_~i~0 45)} assume true; {42279#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:16,161 INFO L273 TraceCheckUtils]: 187: Hoare triple {42279#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42279#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:16,161 INFO L273 TraceCheckUtils]: 188: Hoare triple {42279#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42279#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:16,162 INFO L273 TraceCheckUtils]: 189: Hoare triple {42279#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {42280#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:16,162 INFO L273 TraceCheckUtils]: 190: Hoare triple {42280#(<= main_~i~0 46)} assume true; {42280#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:16,163 INFO L273 TraceCheckUtils]: 191: Hoare triple {42280#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42280#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:16,163 INFO L273 TraceCheckUtils]: 192: Hoare triple {42280#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42280#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:16,164 INFO L273 TraceCheckUtils]: 193: Hoare triple {42280#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {42281#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:16,164 INFO L273 TraceCheckUtils]: 194: Hoare triple {42281#(<= main_~i~0 47)} assume true; {42281#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:16,165 INFO L273 TraceCheckUtils]: 195: Hoare triple {42281#(<= main_~i~0 47)} assume !(~i~0 < 100000); {42233#false} is VALID [2018-11-18 22:58:16,165 INFO L273 TraceCheckUtils]: 196: Hoare triple {42233#false} havoc ~x~0;~x~0 := 0; {42233#false} is VALID [2018-11-18 22:58:16,165 INFO L273 TraceCheckUtils]: 197: Hoare triple {42233#false} assume true; {42233#false} is VALID [2018-11-18 22:58:16,165 INFO L273 TraceCheckUtils]: 198: Hoare triple {42233#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {42233#false} is VALID [2018-11-18 22:58:16,166 INFO L256 TraceCheckUtils]: 199: Hoare triple {42233#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {42233#false} is VALID [2018-11-18 22:58:16,166 INFO L273 TraceCheckUtils]: 200: Hoare triple {42233#false} ~cond := #in~cond; {42233#false} is VALID [2018-11-18 22:58:16,166 INFO L273 TraceCheckUtils]: 201: Hoare triple {42233#false} assume 0 == ~cond; {42233#false} is VALID [2018-11-18 22:58:16,166 INFO L273 TraceCheckUtils]: 202: Hoare triple {42233#false} assume !false; {42233#false} is VALID [2018-11-18 22:58:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:16,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:16,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2018-11-18 22:58:16,216 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 203 [2018-11-18 22:58:16,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:16,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-18 22:58:16,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:16,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-18 22:58:16,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-18 22:58:16,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-18 22:58:16,405 INFO L87 Difference]: Start difference. First operand 208 states and 256 transitions. Second operand 51 states. [2018-11-18 22:58:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:17,693 INFO L93 Difference]: Finished difference Result 226 states and 277 transitions. [2018-11-18 22:58:17,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-18 22:58:17,693 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 203 [2018-11-18 22:58:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 22:58:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 277 transitions. [2018-11-18 22:58:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 22:58:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 277 transitions. [2018-11-18 22:58:17,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 277 transitions. [2018-11-18 22:58:17,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:17,998 INFO L225 Difference]: With dead ends: 226 [2018-11-18 22:58:17,998 INFO L226 Difference]: Without dead ends: 214 [2018-11-18 22:58:17,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-18 22:58:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-18 22:58:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-11-18 22:58:18,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:18,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 212 states. [2018-11-18 22:58:18,208 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 212 states. [2018-11-18 22:58:18,208 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 212 states. [2018-11-18 22:58:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:18,212 INFO L93 Difference]: Finished difference Result 214 states and 264 transitions. [2018-11-18 22:58:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 264 transitions. [2018-11-18 22:58:18,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:18,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:18,212 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 214 states. [2018-11-18 22:58:18,213 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 214 states. [2018-11-18 22:58:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:18,215 INFO L93 Difference]: Finished difference Result 214 states and 264 transitions. [2018-11-18 22:58:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 264 transitions. [2018-11-18 22:58:18,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:18,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:18,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:18,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-18 22:58:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 261 transitions. [2018-11-18 22:58:18,219 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 261 transitions. Word has length 203 [2018-11-18 22:58:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:18,219 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 261 transitions. [2018-11-18 22:58:18,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-18 22:58:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2018-11-18 22:58:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-18 22:58:18,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:18,220 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:18,220 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:18,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:18,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1974692958, now seen corresponding path program 48 times [2018-11-18 22:58:18,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:18,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:18,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:18,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:18,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:19,440 INFO L256 TraceCheckUtils]: 0: Hoare triple {43872#true} call ULTIMATE.init(); {43872#true} is VALID [2018-11-18 22:58:19,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {43872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43872#true} is VALID [2018-11-18 22:58:19,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {43872#true} assume true; {43872#true} is VALID [2018-11-18 22:58:19,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43872#true} {43872#true} #57#return; {43872#true} is VALID [2018-11-18 22:58:19,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {43872#true} call #t~ret4 := main(); {43872#true} is VALID [2018-11-18 22:58:19,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {43872#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {43874#(= main_~i~0 0)} is VALID [2018-11-18 22:58:19,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {43874#(= main_~i~0 0)} assume true; {43874#(= main_~i~0 0)} is VALID [2018-11-18 22:58:19,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {43874#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43874#(= main_~i~0 0)} is VALID [2018-11-18 22:58:19,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {43874#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43874#(= main_~i~0 0)} is VALID [2018-11-18 22:58:19,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {43874#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {43875#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:19,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {43875#(<= main_~i~0 1)} assume true; {43875#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:19,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {43875#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43875#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:19,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {43875#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43875#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:19,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {43875#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {43876#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:19,445 INFO L273 TraceCheckUtils]: 14: Hoare triple {43876#(<= main_~i~0 2)} assume true; {43876#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:19,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {43876#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43876#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:19,446 INFO L273 TraceCheckUtils]: 16: Hoare triple {43876#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43876#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:19,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {43876#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {43877#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:19,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {43877#(<= main_~i~0 3)} assume true; {43877#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:19,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {43877#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43877#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:19,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {43877#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43877#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:19,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {43877#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {43878#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:19,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {43878#(<= main_~i~0 4)} assume true; {43878#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:19,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {43878#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43878#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:19,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {43878#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43878#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:19,451 INFO L273 TraceCheckUtils]: 25: Hoare triple {43878#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {43879#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:19,451 INFO L273 TraceCheckUtils]: 26: Hoare triple {43879#(<= main_~i~0 5)} assume true; {43879#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:19,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {43879#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43879#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:19,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {43879#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43879#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:19,453 INFO L273 TraceCheckUtils]: 29: Hoare triple {43879#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {43880#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:19,453 INFO L273 TraceCheckUtils]: 30: Hoare triple {43880#(<= main_~i~0 6)} assume true; {43880#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:19,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {43880#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43880#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:19,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {43880#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43880#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:19,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {43880#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {43881#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:19,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {43881#(<= main_~i~0 7)} assume true; {43881#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:19,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {43881#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43881#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:19,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {43881#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43881#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:19,457 INFO L273 TraceCheckUtils]: 37: Hoare triple {43881#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {43882#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:19,458 INFO L273 TraceCheckUtils]: 38: Hoare triple {43882#(<= main_~i~0 8)} assume true; {43882#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:19,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {43882#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43882#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:19,459 INFO L273 TraceCheckUtils]: 40: Hoare triple {43882#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43882#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:19,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {43882#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {43883#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:19,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {43883#(<= main_~i~0 9)} assume true; {43883#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:19,460 INFO L273 TraceCheckUtils]: 43: Hoare triple {43883#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43883#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:19,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {43883#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43883#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:19,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {43883#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {43884#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:19,462 INFO L273 TraceCheckUtils]: 46: Hoare triple {43884#(<= main_~i~0 10)} assume true; {43884#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:19,462 INFO L273 TraceCheckUtils]: 47: Hoare triple {43884#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43884#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:19,463 INFO L273 TraceCheckUtils]: 48: Hoare triple {43884#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43884#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:19,463 INFO L273 TraceCheckUtils]: 49: Hoare triple {43884#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {43885#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:19,464 INFO L273 TraceCheckUtils]: 50: Hoare triple {43885#(<= main_~i~0 11)} assume true; {43885#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:19,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {43885#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43885#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:19,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {43885#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43885#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:19,466 INFO L273 TraceCheckUtils]: 53: Hoare triple {43885#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {43886#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:19,466 INFO L273 TraceCheckUtils]: 54: Hoare triple {43886#(<= main_~i~0 12)} assume true; {43886#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:19,466 INFO L273 TraceCheckUtils]: 55: Hoare triple {43886#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43886#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:19,467 INFO L273 TraceCheckUtils]: 56: Hoare triple {43886#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43886#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:19,468 INFO L273 TraceCheckUtils]: 57: Hoare triple {43886#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {43887#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:19,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {43887#(<= main_~i~0 13)} assume true; {43887#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:19,469 INFO L273 TraceCheckUtils]: 59: Hoare triple {43887#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43887#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:19,469 INFO L273 TraceCheckUtils]: 60: Hoare triple {43887#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43887#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:19,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {43887#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {43888#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:19,470 INFO L273 TraceCheckUtils]: 62: Hoare triple {43888#(<= main_~i~0 14)} assume true; {43888#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:19,471 INFO L273 TraceCheckUtils]: 63: Hoare triple {43888#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43888#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:19,471 INFO L273 TraceCheckUtils]: 64: Hoare triple {43888#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43888#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:19,472 INFO L273 TraceCheckUtils]: 65: Hoare triple {43888#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {43889#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:19,472 INFO L273 TraceCheckUtils]: 66: Hoare triple {43889#(<= main_~i~0 15)} assume true; {43889#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:19,473 INFO L273 TraceCheckUtils]: 67: Hoare triple {43889#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43889#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:19,473 INFO L273 TraceCheckUtils]: 68: Hoare triple {43889#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43889#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:19,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {43889#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {43890#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:19,474 INFO L273 TraceCheckUtils]: 70: Hoare triple {43890#(<= main_~i~0 16)} assume true; {43890#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:19,475 INFO L273 TraceCheckUtils]: 71: Hoare triple {43890#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43890#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:19,475 INFO L273 TraceCheckUtils]: 72: Hoare triple {43890#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43890#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:19,476 INFO L273 TraceCheckUtils]: 73: Hoare triple {43890#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {43891#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:19,476 INFO L273 TraceCheckUtils]: 74: Hoare triple {43891#(<= main_~i~0 17)} assume true; {43891#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:19,477 INFO L273 TraceCheckUtils]: 75: Hoare triple {43891#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43891#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:19,477 INFO L273 TraceCheckUtils]: 76: Hoare triple {43891#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43891#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:19,478 INFO L273 TraceCheckUtils]: 77: Hoare triple {43891#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {43892#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:19,478 INFO L273 TraceCheckUtils]: 78: Hoare triple {43892#(<= main_~i~0 18)} assume true; {43892#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:19,479 INFO L273 TraceCheckUtils]: 79: Hoare triple {43892#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43892#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:19,479 INFO L273 TraceCheckUtils]: 80: Hoare triple {43892#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43892#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:19,480 INFO L273 TraceCheckUtils]: 81: Hoare triple {43892#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {43893#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:19,480 INFO L273 TraceCheckUtils]: 82: Hoare triple {43893#(<= main_~i~0 19)} assume true; {43893#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:19,481 INFO L273 TraceCheckUtils]: 83: Hoare triple {43893#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43893#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:19,481 INFO L273 TraceCheckUtils]: 84: Hoare triple {43893#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43893#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:19,482 INFO L273 TraceCheckUtils]: 85: Hoare triple {43893#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {43894#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:19,483 INFO L273 TraceCheckUtils]: 86: Hoare triple {43894#(<= main_~i~0 20)} assume true; {43894#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:19,483 INFO L273 TraceCheckUtils]: 87: Hoare triple {43894#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43894#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:19,483 INFO L273 TraceCheckUtils]: 88: Hoare triple {43894#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43894#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:19,484 INFO L273 TraceCheckUtils]: 89: Hoare triple {43894#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {43895#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:19,485 INFO L273 TraceCheckUtils]: 90: Hoare triple {43895#(<= main_~i~0 21)} assume true; {43895#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:19,485 INFO L273 TraceCheckUtils]: 91: Hoare triple {43895#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43895#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:19,486 INFO L273 TraceCheckUtils]: 92: Hoare triple {43895#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43895#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:19,486 INFO L273 TraceCheckUtils]: 93: Hoare triple {43895#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {43896#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:19,487 INFO L273 TraceCheckUtils]: 94: Hoare triple {43896#(<= main_~i~0 22)} assume true; {43896#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:19,487 INFO L273 TraceCheckUtils]: 95: Hoare triple {43896#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43896#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:19,488 INFO L273 TraceCheckUtils]: 96: Hoare triple {43896#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43896#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:19,488 INFO L273 TraceCheckUtils]: 97: Hoare triple {43896#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {43897#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:19,489 INFO L273 TraceCheckUtils]: 98: Hoare triple {43897#(<= main_~i~0 23)} assume true; {43897#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:19,489 INFO L273 TraceCheckUtils]: 99: Hoare triple {43897#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43897#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:19,490 INFO L273 TraceCheckUtils]: 100: Hoare triple {43897#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43897#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:19,490 INFO L273 TraceCheckUtils]: 101: Hoare triple {43897#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {43898#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:19,491 INFO L273 TraceCheckUtils]: 102: Hoare triple {43898#(<= main_~i~0 24)} assume true; {43898#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:19,491 INFO L273 TraceCheckUtils]: 103: Hoare triple {43898#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43898#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:19,492 INFO L273 TraceCheckUtils]: 104: Hoare triple {43898#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43898#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:19,492 INFO L273 TraceCheckUtils]: 105: Hoare triple {43898#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {43899#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:19,493 INFO L273 TraceCheckUtils]: 106: Hoare triple {43899#(<= main_~i~0 25)} assume true; {43899#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:19,493 INFO L273 TraceCheckUtils]: 107: Hoare triple {43899#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43899#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:19,494 INFO L273 TraceCheckUtils]: 108: Hoare triple {43899#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43899#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:19,495 INFO L273 TraceCheckUtils]: 109: Hoare triple {43899#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {43900#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:19,495 INFO L273 TraceCheckUtils]: 110: Hoare triple {43900#(<= main_~i~0 26)} assume true; {43900#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:19,496 INFO L273 TraceCheckUtils]: 111: Hoare triple {43900#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43900#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:19,496 INFO L273 TraceCheckUtils]: 112: Hoare triple {43900#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43900#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:19,497 INFO L273 TraceCheckUtils]: 113: Hoare triple {43900#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {43901#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:19,497 INFO L273 TraceCheckUtils]: 114: Hoare triple {43901#(<= main_~i~0 27)} assume true; {43901#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:19,498 INFO L273 TraceCheckUtils]: 115: Hoare triple {43901#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43901#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:19,498 INFO L273 TraceCheckUtils]: 116: Hoare triple {43901#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43901#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:19,499 INFO L273 TraceCheckUtils]: 117: Hoare triple {43901#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {43902#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:19,499 INFO L273 TraceCheckUtils]: 118: Hoare triple {43902#(<= main_~i~0 28)} assume true; {43902#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:19,500 INFO L273 TraceCheckUtils]: 119: Hoare triple {43902#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43902#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:19,500 INFO L273 TraceCheckUtils]: 120: Hoare triple {43902#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43902#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:19,501 INFO L273 TraceCheckUtils]: 121: Hoare triple {43902#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {43903#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:19,501 INFO L273 TraceCheckUtils]: 122: Hoare triple {43903#(<= main_~i~0 29)} assume true; {43903#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:19,502 INFO L273 TraceCheckUtils]: 123: Hoare triple {43903#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43903#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:19,502 INFO L273 TraceCheckUtils]: 124: Hoare triple {43903#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43903#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:19,503 INFO L273 TraceCheckUtils]: 125: Hoare triple {43903#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {43904#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:19,503 INFO L273 TraceCheckUtils]: 126: Hoare triple {43904#(<= main_~i~0 30)} assume true; {43904#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:19,504 INFO L273 TraceCheckUtils]: 127: Hoare triple {43904#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43904#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:19,504 INFO L273 TraceCheckUtils]: 128: Hoare triple {43904#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43904#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:19,505 INFO L273 TraceCheckUtils]: 129: Hoare triple {43904#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {43905#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:19,506 INFO L273 TraceCheckUtils]: 130: Hoare triple {43905#(<= main_~i~0 31)} assume true; {43905#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:19,506 INFO L273 TraceCheckUtils]: 131: Hoare triple {43905#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43905#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:19,506 INFO L273 TraceCheckUtils]: 132: Hoare triple {43905#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43905#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:19,507 INFO L273 TraceCheckUtils]: 133: Hoare triple {43905#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {43906#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:19,508 INFO L273 TraceCheckUtils]: 134: Hoare triple {43906#(<= main_~i~0 32)} assume true; {43906#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:19,508 INFO L273 TraceCheckUtils]: 135: Hoare triple {43906#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43906#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:19,509 INFO L273 TraceCheckUtils]: 136: Hoare triple {43906#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43906#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:19,509 INFO L273 TraceCheckUtils]: 137: Hoare triple {43906#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {43907#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:19,510 INFO L273 TraceCheckUtils]: 138: Hoare triple {43907#(<= main_~i~0 33)} assume true; {43907#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:19,510 INFO L273 TraceCheckUtils]: 139: Hoare triple {43907#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43907#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:19,511 INFO L273 TraceCheckUtils]: 140: Hoare triple {43907#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43907#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:19,511 INFO L273 TraceCheckUtils]: 141: Hoare triple {43907#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {43908#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:19,512 INFO L273 TraceCheckUtils]: 142: Hoare triple {43908#(<= main_~i~0 34)} assume true; {43908#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:19,512 INFO L273 TraceCheckUtils]: 143: Hoare triple {43908#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43908#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:19,513 INFO L273 TraceCheckUtils]: 144: Hoare triple {43908#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43908#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:19,513 INFO L273 TraceCheckUtils]: 145: Hoare triple {43908#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {43909#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:19,514 INFO L273 TraceCheckUtils]: 146: Hoare triple {43909#(<= main_~i~0 35)} assume true; {43909#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:19,514 INFO L273 TraceCheckUtils]: 147: Hoare triple {43909#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43909#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:19,515 INFO L273 TraceCheckUtils]: 148: Hoare triple {43909#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43909#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:19,515 INFO L273 TraceCheckUtils]: 149: Hoare triple {43909#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {43910#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:19,516 INFO L273 TraceCheckUtils]: 150: Hoare triple {43910#(<= main_~i~0 36)} assume true; {43910#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:19,516 INFO L273 TraceCheckUtils]: 151: Hoare triple {43910#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43910#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:19,517 INFO L273 TraceCheckUtils]: 152: Hoare triple {43910#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43910#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:19,518 INFO L273 TraceCheckUtils]: 153: Hoare triple {43910#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {43911#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:19,518 INFO L273 TraceCheckUtils]: 154: Hoare triple {43911#(<= main_~i~0 37)} assume true; {43911#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:19,518 INFO L273 TraceCheckUtils]: 155: Hoare triple {43911#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43911#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:19,519 INFO L273 TraceCheckUtils]: 156: Hoare triple {43911#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43911#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:19,520 INFO L273 TraceCheckUtils]: 157: Hoare triple {43911#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {43912#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:19,520 INFO L273 TraceCheckUtils]: 158: Hoare triple {43912#(<= main_~i~0 38)} assume true; {43912#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:19,521 INFO L273 TraceCheckUtils]: 159: Hoare triple {43912#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43912#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:19,521 INFO L273 TraceCheckUtils]: 160: Hoare triple {43912#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43912#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:19,522 INFO L273 TraceCheckUtils]: 161: Hoare triple {43912#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {43913#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:19,522 INFO L273 TraceCheckUtils]: 162: Hoare triple {43913#(<= main_~i~0 39)} assume true; {43913#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:19,523 INFO L273 TraceCheckUtils]: 163: Hoare triple {43913#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43913#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:19,523 INFO L273 TraceCheckUtils]: 164: Hoare triple {43913#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43913#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:19,524 INFO L273 TraceCheckUtils]: 165: Hoare triple {43913#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {43914#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:19,524 INFO L273 TraceCheckUtils]: 166: Hoare triple {43914#(<= main_~i~0 40)} assume true; {43914#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:19,525 INFO L273 TraceCheckUtils]: 167: Hoare triple {43914#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43914#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:19,525 INFO L273 TraceCheckUtils]: 168: Hoare triple {43914#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43914#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:19,526 INFO L273 TraceCheckUtils]: 169: Hoare triple {43914#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {43915#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:19,526 INFO L273 TraceCheckUtils]: 170: Hoare triple {43915#(<= main_~i~0 41)} assume true; {43915#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:19,527 INFO L273 TraceCheckUtils]: 171: Hoare triple {43915#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43915#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:19,527 INFO L273 TraceCheckUtils]: 172: Hoare triple {43915#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43915#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:19,528 INFO L273 TraceCheckUtils]: 173: Hoare triple {43915#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {43916#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:19,528 INFO L273 TraceCheckUtils]: 174: Hoare triple {43916#(<= main_~i~0 42)} assume true; {43916#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:19,529 INFO L273 TraceCheckUtils]: 175: Hoare triple {43916#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43916#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:19,529 INFO L273 TraceCheckUtils]: 176: Hoare triple {43916#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43916#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:19,530 INFO L273 TraceCheckUtils]: 177: Hoare triple {43916#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {43917#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:19,530 INFO L273 TraceCheckUtils]: 178: Hoare triple {43917#(<= main_~i~0 43)} assume true; {43917#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:19,531 INFO L273 TraceCheckUtils]: 179: Hoare triple {43917#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43917#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:19,531 INFO L273 TraceCheckUtils]: 180: Hoare triple {43917#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43917#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:19,532 INFO L273 TraceCheckUtils]: 181: Hoare triple {43917#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {43918#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:19,532 INFO L273 TraceCheckUtils]: 182: Hoare triple {43918#(<= main_~i~0 44)} assume true; {43918#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:19,533 INFO L273 TraceCheckUtils]: 183: Hoare triple {43918#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43918#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:19,533 INFO L273 TraceCheckUtils]: 184: Hoare triple {43918#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43918#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:19,534 INFO L273 TraceCheckUtils]: 185: Hoare triple {43918#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {43919#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:19,535 INFO L273 TraceCheckUtils]: 186: Hoare triple {43919#(<= main_~i~0 45)} assume true; {43919#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:19,535 INFO L273 TraceCheckUtils]: 187: Hoare triple {43919#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43919#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:19,535 INFO L273 TraceCheckUtils]: 188: Hoare triple {43919#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43919#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:19,536 INFO L273 TraceCheckUtils]: 189: Hoare triple {43919#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {43920#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:19,537 INFO L273 TraceCheckUtils]: 190: Hoare triple {43920#(<= main_~i~0 46)} assume true; {43920#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:19,537 INFO L273 TraceCheckUtils]: 191: Hoare triple {43920#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43920#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:19,538 INFO L273 TraceCheckUtils]: 192: Hoare triple {43920#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43920#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:19,538 INFO L273 TraceCheckUtils]: 193: Hoare triple {43920#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {43921#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:19,539 INFO L273 TraceCheckUtils]: 194: Hoare triple {43921#(<= main_~i~0 47)} assume true; {43921#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:19,539 INFO L273 TraceCheckUtils]: 195: Hoare triple {43921#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43921#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:19,540 INFO L273 TraceCheckUtils]: 196: Hoare triple {43921#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43921#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:19,540 INFO L273 TraceCheckUtils]: 197: Hoare triple {43921#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {43922#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:19,541 INFO L273 TraceCheckUtils]: 198: Hoare triple {43922#(<= main_~i~0 48)} assume true; {43922#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:19,541 INFO L273 TraceCheckUtils]: 199: Hoare triple {43922#(<= main_~i~0 48)} assume !(~i~0 < 100000); {43873#false} is VALID [2018-11-18 22:58:19,542 INFO L273 TraceCheckUtils]: 200: Hoare triple {43873#false} havoc ~x~0;~x~0 := 0; {43873#false} is VALID [2018-11-18 22:58:19,542 INFO L273 TraceCheckUtils]: 201: Hoare triple {43873#false} assume true; {43873#false} is VALID [2018-11-18 22:58:19,542 INFO L273 TraceCheckUtils]: 202: Hoare triple {43873#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {43873#false} is VALID [2018-11-18 22:58:19,542 INFO L256 TraceCheckUtils]: 203: Hoare triple {43873#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {43873#false} is VALID [2018-11-18 22:58:19,542 INFO L273 TraceCheckUtils]: 204: Hoare triple {43873#false} ~cond := #in~cond; {43873#false} is VALID [2018-11-18 22:58:19,542 INFO L273 TraceCheckUtils]: 205: Hoare triple {43873#false} assume 0 == ~cond; {43873#false} is VALID [2018-11-18 22:58:19,543 INFO L273 TraceCheckUtils]: 206: Hoare triple {43873#false} assume !false; {43873#false} is VALID [2018-11-18 22:58:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:19,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:19,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:19,584 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:58:19,721 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-11-18 22:58:19,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:19,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:20,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {43872#true} call ULTIMATE.init(); {43872#true} is VALID [2018-11-18 22:58:20,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {43872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43872#true} is VALID [2018-11-18 22:58:20,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {43872#true} assume true; {43872#true} is VALID [2018-11-18 22:58:20,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43872#true} {43872#true} #57#return; {43872#true} is VALID [2018-11-18 22:58:20,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {43872#true} call #t~ret4 := main(); {43872#true} is VALID [2018-11-18 22:58:20,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {43872#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {43941#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:20,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {43941#(<= main_~i~0 0)} assume true; {43941#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:20,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {43941#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43941#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:20,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {43941#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43941#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:20,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {43941#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {43875#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:20,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {43875#(<= main_~i~0 1)} assume true; {43875#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:20,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {43875#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43875#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:20,216 INFO L273 TraceCheckUtils]: 12: Hoare triple {43875#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43875#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:20,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {43875#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {43876#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:20,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {43876#(<= main_~i~0 2)} assume true; {43876#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:20,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {43876#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43876#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:20,217 INFO L273 TraceCheckUtils]: 16: Hoare triple {43876#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43876#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:20,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {43876#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {43877#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:20,218 INFO L273 TraceCheckUtils]: 18: Hoare triple {43877#(<= main_~i~0 3)} assume true; {43877#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:20,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {43877#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43877#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:20,219 INFO L273 TraceCheckUtils]: 20: Hoare triple {43877#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43877#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:20,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {43877#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {43878#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:20,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {43878#(<= main_~i~0 4)} assume true; {43878#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:20,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {43878#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43878#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:20,221 INFO L273 TraceCheckUtils]: 24: Hoare triple {43878#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43878#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:20,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {43878#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {43879#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:20,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {43879#(<= main_~i~0 5)} assume true; {43879#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:20,223 INFO L273 TraceCheckUtils]: 27: Hoare triple {43879#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43879#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:20,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {43879#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43879#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:20,224 INFO L273 TraceCheckUtils]: 29: Hoare triple {43879#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {43880#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:20,224 INFO L273 TraceCheckUtils]: 30: Hoare triple {43880#(<= main_~i~0 6)} assume true; {43880#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:20,225 INFO L273 TraceCheckUtils]: 31: Hoare triple {43880#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43880#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:20,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {43880#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43880#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:20,226 INFO L273 TraceCheckUtils]: 33: Hoare triple {43880#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {43881#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:20,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {43881#(<= main_~i~0 7)} assume true; {43881#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:20,227 INFO L273 TraceCheckUtils]: 35: Hoare triple {43881#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43881#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:20,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {43881#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43881#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:20,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {43881#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {43882#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:20,229 INFO L273 TraceCheckUtils]: 38: Hoare triple {43882#(<= main_~i~0 8)} assume true; {43882#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:20,229 INFO L273 TraceCheckUtils]: 39: Hoare triple {43882#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43882#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:20,230 INFO L273 TraceCheckUtils]: 40: Hoare triple {43882#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43882#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:20,230 INFO L273 TraceCheckUtils]: 41: Hoare triple {43882#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {43883#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:20,231 INFO L273 TraceCheckUtils]: 42: Hoare triple {43883#(<= main_~i~0 9)} assume true; {43883#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:20,231 INFO L273 TraceCheckUtils]: 43: Hoare triple {43883#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43883#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:20,232 INFO L273 TraceCheckUtils]: 44: Hoare triple {43883#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43883#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:20,232 INFO L273 TraceCheckUtils]: 45: Hoare triple {43883#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {43884#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:20,233 INFO L273 TraceCheckUtils]: 46: Hoare triple {43884#(<= main_~i~0 10)} assume true; {43884#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:20,233 INFO L273 TraceCheckUtils]: 47: Hoare triple {43884#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43884#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:20,234 INFO L273 TraceCheckUtils]: 48: Hoare triple {43884#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43884#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:20,234 INFO L273 TraceCheckUtils]: 49: Hoare triple {43884#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {43885#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:20,235 INFO L273 TraceCheckUtils]: 50: Hoare triple {43885#(<= main_~i~0 11)} assume true; {43885#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:20,235 INFO L273 TraceCheckUtils]: 51: Hoare triple {43885#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43885#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:20,236 INFO L273 TraceCheckUtils]: 52: Hoare triple {43885#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43885#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:20,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {43885#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {43886#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:20,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {43886#(<= main_~i~0 12)} assume true; {43886#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:20,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {43886#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43886#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:20,238 INFO L273 TraceCheckUtils]: 56: Hoare triple {43886#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43886#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:20,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {43886#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {43887#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:20,239 INFO L273 TraceCheckUtils]: 58: Hoare triple {43887#(<= main_~i~0 13)} assume true; {43887#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:20,239 INFO L273 TraceCheckUtils]: 59: Hoare triple {43887#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43887#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:20,240 INFO L273 TraceCheckUtils]: 60: Hoare triple {43887#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43887#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:20,241 INFO L273 TraceCheckUtils]: 61: Hoare triple {43887#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {43888#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:20,241 INFO L273 TraceCheckUtils]: 62: Hoare triple {43888#(<= main_~i~0 14)} assume true; {43888#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:20,241 INFO L273 TraceCheckUtils]: 63: Hoare triple {43888#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43888#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:20,242 INFO L273 TraceCheckUtils]: 64: Hoare triple {43888#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43888#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:20,243 INFO L273 TraceCheckUtils]: 65: Hoare triple {43888#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {43889#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:20,243 INFO L273 TraceCheckUtils]: 66: Hoare triple {43889#(<= main_~i~0 15)} assume true; {43889#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:20,243 INFO L273 TraceCheckUtils]: 67: Hoare triple {43889#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43889#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:20,244 INFO L273 TraceCheckUtils]: 68: Hoare triple {43889#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43889#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:20,245 INFO L273 TraceCheckUtils]: 69: Hoare triple {43889#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {43890#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:20,245 INFO L273 TraceCheckUtils]: 70: Hoare triple {43890#(<= main_~i~0 16)} assume true; {43890#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:20,246 INFO L273 TraceCheckUtils]: 71: Hoare triple {43890#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43890#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:20,246 INFO L273 TraceCheckUtils]: 72: Hoare triple {43890#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43890#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:20,247 INFO L273 TraceCheckUtils]: 73: Hoare triple {43890#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {43891#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:20,247 INFO L273 TraceCheckUtils]: 74: Hoare triple {43891#(<= main_~i~0 17)} assume true; {43891#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:20,248 INFO L273 TraceCheckUtils]: 75: Hoare triple {43891#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43891#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:20,248 INFO L273 TraceCheckUtils]: 76: Hoare triple {43891#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43891#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:20,249 INFO L273 TraceCheckUtils]: 77: Hoare triple {43891#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {43892#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:20,249 INFO L273 TraceCheckUtils]: 78: Hoare triple {43892#(<= main_~i~0 18)} assume true; {43892#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:20,250 INFO L273 TraceCheckUtils]: 79: Hoare triple {43892#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43892#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:20,250 INFO L273 TraceCheckUtils]: 80: Hoare triple {43892#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43892#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:20,251 INFO L273 TraceCheckUtils]: 81: Hoare triple {43892#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {43893#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:20,251 INFO L273 TraceCheckUtils]: 82: Hoare triple {43893#(<= main_~i~0 19)} assume true; {43893#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:20,252 INFO L273 TraceCheckUtils]: 83: Hoare triple {43893#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43893#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:20,252 INFO L273 TraceCheckUtils]: 84: Hoare triple {43893#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43893#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:20,253 INFO L273 TraceCheckUtils]: 85: Hoare triple {43893#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {43894#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:20,253 INFO L273 TraceCheckUtils]: 86: Hoare triple {43894#(<= main_~i~0 20)} assume true; {43894#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:20,254 INFO L273 TraceCheckUtils]: 87: Hoare triple {43894#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43894#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:20,254 INFO L273 TraceCheckUtils]: 88: Hoare triple {43894#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43894#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:20,255 INFO L273 TraceCheckUtils]: 89: Hoare triple {43894#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {43895#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:20,255 INFO L273 TraceCheckUtils]: 90: Hoare triple {43895#(<= main_~i~0 21)} assume true; {43895#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:20,256 INFO L273 TraceCheckUtils]: 91: Hoare triple {43895#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43895#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:20,256 INFO L273 TraceCheckUtils]: 92: Hoare triple {43895#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43895#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:20,257 INFO L273 TraceCheckUtils]: 93: Hoare triple {43895#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {43896#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:20,257 INFO L273 TraceCheckUtils]: 94: Hoare triple {43896#(<= main_~i~0 22)} assume true; {43896#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:20,258 INFO L273 TraceCheckUtils]: 95: Hoare triple {43896#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43896#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:20,258 INFO L273 TraceCheckUtils]: 96: Hoare triple {43896#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43896#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:20,259 INFO L273 TraceCheckUtils]: 97: Hoare triple {43896#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {43897#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:20,259 INFO L273 TraceCheckUtils]: 98: Hoare triple {43897#(<= main_~i~0 23)} assume true; {43897#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:20,260 INFO L273 TraceCheckUtils]: 99: Hoare triple {43897#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43897#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:20,260 INFO L273 TraceCheckUtils]: 100: Hoare triple {43897#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43897#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:20,261 INFO L273 TraceCheckUtils]: 101: Hoare triple {43897#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {43898#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:20,262 INFO L273 TraceCheckUtils]: 102: Hoare triple {43898#(<= main_~i~0 24)} assume true; {43898#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:20,262 INFO L273 TraceCheckUtils]: 103: Hoare triple {43898#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43898#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:20,262 INFO L273 TraceCheckUtils]: 104: Hoare triple {43898#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43898#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:20,263 INFO L273 TraceCheckUtils]: 105: Hoare triple {43898#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {43899#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:20,264 INFO L273 TraceCheckUtils]: 106: Hoare triple {43899#(<= main_~i~0 25)} assume true; {43899#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:20,264 INFO L273 TraceCheckUtils]: 107: Hoare triple {43899#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43899#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:20,265 INFO L273 TraceCheckUtils]: 108: Hoare triple {43899#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43899#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:20,265 INFO L273 TraceCheckUtils]: 109: Hoare triple {43899#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {43900#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:20,266 INFO L273 TraceCheckUtils]: 110: Hoare triple {43900#(<= main_~i~0 26)} assume true; {43900#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:20,266 INFO L273 TraceCheckUtils]: 111: Hoare triple {43900#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43900#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:20,267 INFO L273 TraceCheckUtils]: 112: Hoare triple {43900#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43900#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:20,267 INFO L273 TraceCheckUtils]: 113: Hoare triple {43900#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {43901#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:20,268 INFO L273 TraceCheckUtils]: 114: Hoare triple {43901#(<= main_~i~0 27)} assume true; {43901#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:20,268 INFO L273 TraceCheckUtils]: 115: Hoare triple {43901#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43901#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:20,269 INFO L273 TraceCheckUtils]: 116: Hoare triple {43901#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43901#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:20,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {43901#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {43902#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:20,270 INFO L273 TraceCheckUtils]: 118: Hoare triple {43902#(<= main_~i~0 28)} assume true; {43902#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:20,270 INFO L273 TraceCheckUtils]: 119: Hoare triple {43902#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43902#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:20,271 INFO L273 TraceCheckUtils]: 120: Hoare triple {43902#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43902#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:20,271 INFO L273 TraceCheckUtils]: 121: Hoare triple {43902#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {43903#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:20,272 INFO L273 TraceCheckUtils]: 122: Hoare triple {43903#(<= main_~i~0 29)} assume true; {43903#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:20,272 INFO L273 TraceCheckUtils]: 123: Hoare triple {43903#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43903#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:20,273 INFO L273 TraceCheckUtils]: 124: Hoare triple {43903#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43903#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:20,273 INFO L273 TraceCheckUtils]: 125: Hoare triple {43903#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {43904#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:20,274 INFO L273 TraceCheckUtils]: 126: Hoare triple {43904#(<= main_~i~0 30)} assume true; {43904#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:20,274 INFO L273 TraceCheckUtils]: 127: Hoare triple {43904#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43904#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:20,275 INFO L273 TraceCheckUtils]: 128: Hoare triple {43904#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43904#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:20,275 INFO L273 TraceCheckUtils]: 129: Hoare triple {43904#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {43905#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:20,276 INFO L273 TraceCheckUtils]: 130: Hoare triple {43905#(<= main_~i~0 31)} assume true; {43905#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:20,276 INFO L273 TraceCheckUtils]: 131: Hoare triple {43905#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43905#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:20,277 INFO L273 TraceCheckUtils]: 132: Hoare triple {43905#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43905#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:20,278 INFO L273 TraceCheckUtils]: 133: Hoare triple {43905#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {43906#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:20,278 INFO L273 TraceCheckUtils]: 134: Hoare triple {43906#(<= main_~i~0 32)} assume true; {43906#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:20,278 INFO L273 TraceCheckUtils]: 135: Hoare triple {43906#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43906#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:20,279 INFO L273 TraceCheckUtils]: 136: Hoare triple {43906#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43906#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:20,280 INFO L273 TraceCheckUtils]: 137: Hoare triple {43906#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {43907#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:20,280 INFO L273 TraceCheckUtils]: 138: Hoare triple {43907#(<= main_~i~0 33)} assume true; {43907#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:20,280 INFO L273 TraceCheckUtils]: 139: Hoare triple {43907#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43907#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:20,281 INFO L273 TraceCheckUtils]: 140: Hoare triple {43907#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43907#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:20,282 INFO L273 TraceCheckUtils]: 141: Hoare triple {43907#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {43908#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:20,282 INFO L273 TraceCheckUtils]: 142: Hoare triple {43908#(<= main_~i~0 34)} assume true; {43908#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:20,283 INFO L273 TraceCheckUtils]: 143: Hoare triple {43908#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43908#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:20,283 INFO L273 TraceCheckUtils]: 144: Hoare triple {43908#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43908#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:20,284 INFO L273 TraceCheckUtils]: 145: Hoare triple {43908#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {43909#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:20,284 INFO L273 TraceCheckUtils]: 146: Hoare triple {43909#(<= main_~i~0 35)} assume true; {43909#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:20,285 INFO L273 TraceCheckUtils]: 147: Hoare triple {43909#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43909#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:20,285 INFO L273 TraceCheckUtils]: 148: Hoare triple {43909#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43909#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:20,286 INFO L273 TraceCheckUtils]: 149: Hoare triple {43909#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {43910#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:20,286 INFO L273 TraceCheckUtils]: 150: Hoare triple {43910#(<= main_~i~0 36)} assume true; {43910#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:20,287 INFO L273 TraceCheckUtils]: 151: Hoare triple {43910#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43910#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:20,287 INFO L273 TraceCheckUtils]: 152: Hoare triple {43910#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43910#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:20,288 INFO L273 TraceCheckUtils]: 153: Hoare triple {43910#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {43911#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:20,288 INFO L273 TraceCheckUtils]: 154: Hoare triple {43911#(<= main_~i~0 37)} assume true; {43911#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:20,289 INFO L273 TraceCheckUtils]: 155: Hoare triple {43911#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43911#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:20,289 INFO L273 TraceCheckUtils]: 156: Hoare triple {43911#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43911#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:20,290 INFO L273 TraceCheckUtils]: 157: Hoare triple {43911#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {43912#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:20,290 INFO L273 TraceCheckUtils]: 158: Hoare triple {43912#(<= main_~i~0 38)} assume true; {43912#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:20,291 INFO L273 TraceCheckUtils]: 159: Hoare triple {43912#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43912#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:20,291 INFO L273 TraceCheckUtils]: 160: Hoare triple {43912#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43912#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:20,292 INFO L273 TraceCheckUtils]: 161: Hoare triple {43912#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {43913#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:20,292 INFO L273 TraceCheckUtils]: 162: Hoare triple {43913#(<= main_~i~0 39)} assume true; {43913#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:20,293 INFO L273 TraceCheckUtils]: 163: Hoare triple {43913#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43913#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:20,293 INFO L273 TraceCheckUtils]: 164: Hoare triple {43913#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43913#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:20,294 INFO L273 TraceCheckUtils]: 165: Hoare triple {43913#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {43914#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:20,294 INFO L273 TraceCheckUtils]: 166: Hoare triple {43914#(<= main_~i~0 40)} assume true; {43914#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:20,295 INFO L273 TraceCheckUtils]: 167: Hoare triple {43914#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43914#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:20,295 INFO L273 TraceCheckUtils]: 168: Hoare triple {43914#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43914#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:20,296 INFO L273 TraceCheckUtils]: 169: Hoare triple {43914#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {43915#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:20,296 INFO L273 TraceCheckUtils]: 170: Hoare triple {43915#(<= main_~i~0 41)} assume true; {43915#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:20,297 INFO L273 TraceCheckUtils]: 171: Hoare triple {43915#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43915#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:20,297 INFO L273 TraceCheckUtils]: 172: Hoare triple {43915#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43915#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:20,298 INFO L273 TraceCheckUtils]: 173: Hoare triple {43915#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {43916#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:20,298 INFO L273 TraceCheckUtils]: 174: Hoare triple {43916#(<= main_~i~0 42)} assume true; {43916#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:20,299 INFO L273 TraceCheckUtils]: 175: Hoare triple {43916#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43916#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:20,299 INFO L273 TraceCheckUtils]: 176: Hoare triple {43916#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43916#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:20,300 INFO L273 TraceCheckUtils]: 177: Hoare triple {43916#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {43917#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:20,301 INFO L273 TraceCheckUtils]: 178: Hoare triple {43917#(<= main_~i~0 43)} assume true; {43917#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:20,301 INFO L273 TraceCheckUtils]: 179: Hoare triple {43917#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43917#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:20,301 INFO L273 TraceCheckUtils]: 180: Hoare triple {43917#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43917#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:20,302 INFO L273 TraceCheckUtils]: 181: Hoare triple {43917#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {43918#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:20,303 INFO L273 TraceCheckUtils]: 182: Hoare triple {43918#(<= main_~i~0 44)} assume true; {43918#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:20,303 INFO L273 TraceCheckUtils]: 183: Hoare triple {43918#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43918#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:20,304 INFO L273 TraceCheckUtils]: 184: Hoare triple {43918#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43918#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:20,304 INFO L273 TraceCheckUtils]: 185: Hoare triple {43918#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {43919#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:20,305 INFO L273 TraceCheckUtils]: 186: Hoare triple {43919#(<= main_~i~0 45)} assume true; {43919#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:20,305 INFO L273 TraceCheckUtils]: 187: Hoare triple {43919#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43919#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:20,306 INFO L273 TraceCheckUtils]: 188: Hoare triple {43919#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43919#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:20,306 INFO L273 TraceCheckUtils]: 189: Hoare triple {43919#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {43920#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:20,307 INFO L273 TraceCheckUtils]: 190: Hoare triple {43920#(<= main_~i~0 46)} assume true; {43920#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:20,307 INFO L273 TraceCheckUtils]: 191: Hoare triple {43920#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43920#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:20,308 INFO L273 TraceCheckUtils]: 192: Hoare triple {43920#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43920#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:20,308 INFO L273 TraceCheckUtils]: 193: Hoare triple {43920#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {43921#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:20,309 INFO L273 TraceCheckUtils]: 194: Hoare triple {43921#(<= main_~i~0 47)} assume true; {43921#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:20,309 INFO L273 TraceCheckUtils]: 195: Hoare triple {43921#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43921#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:20,310 INFO L273 TraceCheckUtils]: 196: Hoare triple {43921#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43921#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:20,310 INFO L273 TraceCheckUtils]: 197: Hoare triple {43921#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {43922#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:20,311 INFO L273 TraceCheckUtils]: 198: Hoare triple {43922#(<= main_~i~0 48)} assume true; {43922#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:20,311 INFO L273 TraceCheckUtils]: 199: Hoare triple {43922#(<= main_~i~0 48)} assume !(~i~0 < 100000); {43873#false} is VALID [2018-11-18 22:58:20,312 INFO L273 TraceCheckUtils]: 200: Hoare triple {43873#false} havoc ~x~0;~x~0 := 0; {43873#false} is VALID [2018-11-18 22:58:20,312 INFO L273 TraceCheckUtils]: 201: Hoare triple {43873#false} assume true; {43873#false} is VALID [2018-11-18 22:58:20,312 INFO L273 TraceCheckUtils]: 202: Hoare triple {43873#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {43873#false} is VALID [2018-11-18 22:58:20,312 INFO L256 TraceCheckUtils]: 203: Hoare triple {43873#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {43873#false} is VALID [2018-11-18 22:58:20,312 INFO L273 TraceCheckUtils]: 204: Hoare triple {43873#false} ~cond := #in~cond; {43873#false} is VALID [2018-11-18 22:58:20,312 INFO L273 TraceCheckUtils]: 205: Hoare triple {43873#false} assume 0 == ~cond; {43873#false} is VALID [2018-11-18 22:58:20,313 INFO L273 TraceCheckUtils]: 206: Hoare triple {43873#false} assume !false; {43873#false} is VALID [2018-11-18 22:58:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:20,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:20,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2018-11-18 22:58:20,363 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2018-11-18 22:58:20,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:20,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-18 22:58:20,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:20,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-18 22:58:20,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-18 22:58:20,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-18 22:58:20,551 INFO L87 Difference]: Start difference. First operand 212 states and 261 transitions. Second operand 52 states. [2018-11-18 22:58:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:21,323 INFO L93 Difference]: Finished difference Result 230 states and 282 transitions. [2018-11-18 22:58:21,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-18 22:58:21,323 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2018-11-18 22:58:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 22:58:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 282 transitions. [2018-11-18 22:58:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 22:58:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 282 transitions. [2018-11-18 22:58:21,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 282 transitions. [2018-11-18 22:58:21,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:21,578 INFO L225 Difference]: With dead ends: 230 [2018-11-18 22:58:21,578 INFO L226 Difference]: Without dead ends: 218 [2018-11-18 22:58:21,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-18 22:58:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-18 22:58:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-11-18 22:58:21,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:21,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand 216 states. [2018-11-18 22:58:21,617 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 216 states. [2018-11-18 22:58:21,617 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 216 states. [2018-11-18 22:58:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:21,620 INFO L93 Difference]: Finished difference Result 218 states and 269 transitions. [2018-11-18 22:58:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 269 transitions. [2018-11-18 22:58:21,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:21,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:21,621 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 218 states. [2018-11-18 22:58:21,621 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 218 states. [2018-11-18 22:58:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:21,624 INFO L93 Difference]: Finished difference Result 218 states and 269 transitions. [2018-11-18 22:58:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 269 transitions. [2018-11-18 22:58:21,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:21,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:21,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:21,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-18 22:58:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 266 transitions. [2018-11-18 22:58:21,627 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 266 transitions. Word has length 207 [2018-11-18 22:58:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:21,627 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 266 transitions. [2018-11-18 22:58:21,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-18 22:58:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 266 transitions. [2018-11-18 22:58:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-18 22:58:21,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:21,629 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:21,629 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:21,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1020825336, now seen corresponding path program 49 times [2018-11-18 22:58:21,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:21,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:21,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:23,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {45543#true} call ULTIMATE.init(); {45543#true} is VALID [2018-11-18 22:58:23,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {45543#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45543#true} is VALID [2018-11-18 22:58:23,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {45543#true} assume true; {45543#true} is VALID [2018-11-18 22:58:23,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45543#true} {45543#true} #57#return; {45543#true} is VALID [2018-11-18 22:58:23,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {45543#true} call #t~ret4 := main(); {45543#true} is VALID [2018-11-18 22:58:23,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {45543#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {45545#(= main_~i~0 0)} is VALID [2018-11-18 22:58:23,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {45545#(= main_~i~0 0)} assume true; {45545#(= main_~i~0 0)} is VALID [2018-11-18 22:58:23,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {45545#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45545#(= main_~i~0 0)} is VALID [2018-11-18 22:58:23,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {45545#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45545#(= main_~i~0 0)} is VALID [2018-11-18 22:58:23,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {45545#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {45546#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {45546#(<= main_~i~0 1)} assume true; {45546#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {45546#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45546#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {45546#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45546#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {45546#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {45547#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {45547#(<= main_~i~0 2)} assume true; {45547#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {45547#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45547#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {45547#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45547#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {45547#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {45548#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {45548#(<= main_~i~0 3)} assume true; {45548#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {45548#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45548#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,270 INFO L273 TraceCheckUtils]: 20: Hoare triple {45548#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45548#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,271 INFO L273 TraceCheckUtils]: 21: Hoare triple {45548#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {45549#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {45549#(<= main_~i~0 4)} assume true; {45549#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,272 INFO L273 TraceCheckUtils]: 23: Hoare triple {45549#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45549#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,272 INFO L273 TraceCheckUtils]: 24: Hoare triple {45549#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45549#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {45549#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {45550#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {45550#(<= main_~i~0 5)} assume true; {45550#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {45550#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45550#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,275 INFO L273 TraceCheckUtils]: 28: Hoare triple {45550#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45550#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {45550#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {45551#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:23,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {45551#(<= main_~i~0 6)} assume true; {45551#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:23,276 INFO L273 TraceCheckUtils]: 31: Hoare triple {45551#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45551#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:23,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {45551#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45551#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:23,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {45551#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {45552#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:23,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {45552#(<= main_~i~0 7)} assume true; {45552#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:23,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {45552#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45552#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:23,279 INFO L273 TraceCheckUtils]: 36: Hoare triple {45552#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45552#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:23,280 INFO L273 TraceCheckUtils]: 37: Hoare triple {45552#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {45553#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:23,280 INFO L273 TraceCheckUtils]: 38: Hoare triple {45553#(<= main_~i~0 8)} assume true; {45553#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:23,281 INFO L273 TraceCheckUtils]: 39: Hoare triple {45553#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45553#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:23,281 INFO L273 TraceCheckUtils]: 40: Hoare triple {45553#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45553#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:23,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {45553#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {45554#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:23,282 INFO L273 TraceCheckUtils]: 42: Hoare triple {45554#(<= main_~i~0 9)} assume true; {45554#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:23,283 INFO L273 TraceCheckUtils]: 43: Hoare triple {45554#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45554#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:23,283 INFO L273 TraceCheckUtils]: 44: Hoare triple {45554#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45554#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:23,284 INFO L273 TraceCheckUtils]: 45: Hoare triple {45554#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {45555#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:23,284 INFO L273 TraceCheckUtils]: 46: Hoare triple {45555#(<= main_~i~0 10)} assume true; {45555#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:23,285 INFO L273 TraceCheckUtils]: 47: Hoare triple {45555#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45555#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:23,285 INFO L273 TraceCheckUtils]: 48: Hoare triple {45555#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45555#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:23,286 INFO L273 TraceCheckUtils]: 49: Hoare triple {45555#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {45556#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:23,287 INFO L273 TraceCheckUtils]: 50: Hoare triple {45556#(<= main_~i~0 11)} assume true; {45556#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:23,287 INFO L273 TraceCheckUtils]: 51: Hoare triple {45556#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45556#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:23,288 INFO L273 TraceCheckUtils]: 52: Hoare triple {45556#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45556#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:23,288 INFO L273 TraceCheckUtils]: 53: Hoare triple {45556#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {45557#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:23,289 INFO L273 TraceCheckUtils]: 54: Hoare triple {45557#(<= main_~i~0 12)} assume true; {45557#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:23,289 INFO L273 TraceCheckUtils]: 55: Hoare triple {45557#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45557#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:23,290 INFO L273 TraceCheckUtils]: 56: Hoare triple {45557#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45557#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:23,290 INFO L273 TraceCheckUtils]: 57: Hoare triple {45557#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {45558#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:23,291 INFO L273 TraceCheckUtils]: 58: Hoare triple {45558#(<= main_~i~0 13)} assume true; {45558#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:23,291 INFO L273 TraceCheckUtils]: 59: Hoare triple {45558#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45558#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:23,292 INFO L273 TraceCheckUtils]: 60: Hoare triple {45558#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45558#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:23,293 INFO L273 TraceCheckUtils]: 61: Hoare triple {45558#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {45559#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:23,293 INFO L273 TraceCheckUtils]: 62: Hoare triple {45559#(<= main_~i~0 14)} assume true; {45559#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:23,294 INFO L273 TraceCheckUtils]: 63: Hoare triple {45559#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45559#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:23,294 INFO L273 TraceCheckUtils]: 64: Hoare triple {45559#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45559#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:23,295 INFO L273 TraceCheckUtils]: 65: Hoare triple {45559#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {45560#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:23,295 INFO L273 TraceCheckUtils]: 66: Hoare triple {45560#(<= main_~i~0 15)} assume true; {45560#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:23,296 INFO L273 TraceCheckUtils]: 67: Hoare triple {45560#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45560#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:23,296 INFO L273 TraceCheckUtils]: 68: Hoare triple {45560#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45560#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:23,297 INFO L273 TraceCheckUtils]: 69: Hoare triple {45560#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {45561#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:23,297 INFO L273 TraceCheckUtils]: 70: Hoare triple {45561#(<= main_~i~0 16)} assume true; {45561#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:23,298 INFO L273 TraceCheckUtils]: 71: Hoare triple {45561#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45561#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:23,298 INFO L273 TraceCheckUtils]: 72: Hoare triple {45561#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45561#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:23,299 INFO L273 TraceCheckUtils]: 73: Hoare triple {45561#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {45562#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:23,299 INFO L273 TraceCheckUtils]: 74: Hoare triple {45562#(<= main_~i~0 17)} assume true; {45562#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:23,300 INFO L273 TraceCheckUtils]: 75: Hoare triple {45562#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45562#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:23,300 INFO L273 TraceCheckUtils]: 76: Hoare triple {45562#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45562#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:23,301 INFO L273 TraceCheckUtils]: 77: Hoare triple {45562#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {45563#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:23,301 INFO L273 TraceCheckUtils]: 78: Hoare triple {45563#(<= main_~i~0 18)} assume true; {45563#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:23,302 INFO L273 TraceCheckUtils]: 79: Hoare triple {45563#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45563#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:23,302 INFO L273 TraceCheckUtils]: 80: Hoare triple {45563#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45563#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:23,303 INFO L273 TraceCheckUtils]: 81: Hoare triple {45563#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {45564#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:23,304 INFO L273 TraceCheckUtils]: 82: Hoare triple {45564#(<= main_~i~0 19)} assume true; {45564#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:23,304 INFO L273 TraceCheckUtils]: 83: Hoare triple {45564#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45564#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:23,304 INFO L273 TraceCheckUtils]: 84: Hoare triple {45564#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45564#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:23,305 INFO L273 TraceCheckUtils]: 85: Hoare triple {45564#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {45565#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:23,306 INFO L273 TraceCheckUtils]: 86: Hoare triple {45565#(<= main_~i~0 20)} assume true; {45565#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:23,306 INFO L273 TraceCheckUtils]: 87: Hoare triple {45565#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45565#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:23,307 INFO L273 TraceCheckUtils]: 88: Hoare triple {45565#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45565#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:23,307 INFO L273 TraceCheckUtils]: 89: Hoare triple {45565#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {45566#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:23,308 INFO L273 TraceCheckUtils]: 90: Hoare triple {45566#(<= main_~i~0 21)} assume true; {45566#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:23,308 INFO L273 TraceCheckUtils]: 91: Hoare triple {45566#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45566#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:23,309 INFO L273 TraceCheckUtils]: 92: Hoare triple {45566#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45566#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:23,309 INFO L273 TraceCheckUtils]: 93: Hoare triple {45566#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {45567#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:23,310 INFO L273 TraceCheckUtils]: 94: Hoare triple {45567#(<= main_~i~0 22)} assume true; {45567#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:23,310 INFO L273 TraceCheckUtils]: 95: Hoare triple {45567#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45567#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:23,311 INFO L273 TraceCheckUtils]: 96: Hoare triple {45567#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45567#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:23,312 INFO L273 TraceCheckUtils]: 97: Hoare triple {45567#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {45568#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:23,312 INFO L273 TraceCheckUtils]: 98: Hoare triple {45568#(<= main_~i~0 23)} assume true; {45568#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:23,313 INFO L273 TraceCheckUtils]: 99: Hoare triple {45568#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45568#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:23,313 INFO L273 TraceCheckUtils]: 100: Hoare triple {45568#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45568#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:23,314 INFO L273 TraceCheckUtils]: 101: Hoare triple {45568#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {45569#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:23,314 INFO L273 TraceCheckUtils]: 102: Hoare triple {45569#(<= main_~i~0 24)} assume true; {45569#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:23,315 INFO L273 TraceCheckUtils]: 103: Hoare triple {45569#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45569#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:23,315 INFO L273 TraceCheckUtils]: 104: Hoare triple {45569#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45569#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:23,316 INFO L273 TraceCheckUtils]: 105: Hoare triple {45569#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {45570#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:23,316 INFO L273 TraceCheckUtils]: 106: Hoare triple {45570#(<= main_~i~0 25)} assume true; {45570#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:23,317 INFO L273 TraceCheckUtils]: 107: Hoare triple {45570#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45570#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:23,317 INFO L273 TraceCheckUtils]: 108: Hoare triple {45570#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45570#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:23,318 INFO L273 TraceCheckUtils]: 109: Hoare triple {45570#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {45571#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:23,318 INFO L273 TraceCheckUtils]: 110: Hoare triple {45571#(<= main_~i~0 26)} assume true; {45571#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:23,319 INFO L273 TraceCheckUtils]: 111: Hoare triple {45571#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45571#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:23,319 INFO L273 TraceCheckUtils]: 112: Hoare triple {45571#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45571#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:23,320 INFO L273 TraceCheckUtils]: 113: Hoare triple {45571#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {45572#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:23,320 INFO L273 TraceCheckUtils]: 114: Hoare triple {45572#(<= main_~i~0 27)} assume true; {45572#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:23,321 INFO L273 TraceCheckUtils]: 115: Hoare triple {45572#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45572#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:23,321 INFO L273 TraceCheckUtils]: 116: Hoare triple {45572#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45572#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:23,322 INFO L273 TraceCheckUtils]: 117: Hoare triple {45572#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {45573#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:23,322 INFO L273 TraceCheckUtils]: 118: Hoare triple {45573#(<= main_~i~0 28)} assume true; {45573#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:23,323 INFO L273 TraceCheckUtils]: 119: Hoare triple {45573#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45573#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:23,323 INFO L273 TraceCheckUtils]: 120: Hoare triple {45573#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45573#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:23,324 INFO L273 TraceCheckUtils]: 121: Hoare triple {45573#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {45574#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:23,324 INFO L273 TraceCheckUtils]: 122: Hoare triple {45574#(<= main_~i~0 29)} assume true; {45574#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:23,325 INFO L273 TraceCheckUtils]: 123: Hoare triple {45574#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45574#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:23,325 INFO L273 TraceCheckUtils]: 124: Hoare triple {45574#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45574#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:23,326 INFO L273 TraceCheckUtils]: 125: Hoare triple {45574#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {45575#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:23,327 INFO L273 TraceCheckUtils]: 126: Hoare triple {45575#(<= main_~i~0 30)} assume true; {45575#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:23,327 INFO L273 TraceCheckUtils]: 127: Hoare triple {45575#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45575#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:23,327 INFO L273 TraceCheckUtils]: 128: Hoare triple {45575#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45575#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:23,328 INFO L273 TraceCheckUtils]: 129: Hoare triple {45575#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {45576#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:23,329 INFO L273 TraceCheckUtils]: 130: Hoare triple {45576#(<= main_~i~0 31)} assume true; {45576#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:23,329 INFO L273 TraceCheckUtils]: 131: Hoare triple {45576#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45576#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:23,329 INFO L273 TraceCheckUtils]: 132: Hoare triple {45576#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45576#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:23,330 INFO L273 TraceCheckUtils]: 133: Hoare triple {45576#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {45577#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:23,331 INFO L273 TraceCheckUtils]: 134: Hoare triple {45577#(<= main_~i~0 32)} assume true; {45577#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:23,331 INFO L273 TraceCheckUtils]: 135: Hoare triple {45577#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45577#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:23,332 INFO L273 TraceCheckUtils]: 136: Hoare triple {45577#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45577#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:23,332 INFO L273 TraceCheckUtils]: 137: Hoare triple {45577#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {45578#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:23,333 INFO L273 TraceCheckUtils]: 138: Hoare triple {45578#(<= main_~i~0 33)} assume true; {45578#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:23,333 INFO L273 TraceCheckUtils]: 139: Hoare triple {45578#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45578#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:23,334 INFO L273 TraceCheckUtils]: 140: Hoare triple {45578#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45578#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:23,334 INFO L273 TraceCheckUtils]: 141: Hoare triple {45578#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {45579#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:23,335 INFO L273 TraceCheckUtils]: 142: Hoare triple {45579#(<= main_~i~0 34)} assume true; {45579#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:23,335 INFO L273 TraceCheckUtils]: 143: Hoare triple {45579#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45579#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:23,336 INFO L273 TraceCheckUtils]: 144: Hoare triple {45579#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45579#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:23,336 INFO L273 TraceCheckUtils]: 145: Hoare triple {45579#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {45580#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:23,337 INFO L273 TraceCheckUtils]: 146: Hoare triple {45580#(<= main_~i~0 35)} assume true; {45580#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:23,337 INFO L273 TraceCheckUtils]: 147: Hoare triple {45580#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45580#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:23,338 INFO L273 TraceCheckUtils]: 148: Hoare triple {45580#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45580#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:23,338 INFO L273 TraceCheckUtils]: 149: Hoare triple {45580#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {45581#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:23,339 INFO L273 TraceCheckUtils]: 150: Hoare triple {45581#(<= main_~i~0 36)} assume true; {45581#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:23,339 INFO L273 TraceCheckUtils]: 151: Hoare triple {45581#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45581#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:23,340 INFO L273 TraceCheckUtils]: 152: Hoare triple {45581#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45581#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:23,340 INFO L273 TraceCheckUtils]: 153: Hoare triple {45581#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {45582#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:23,341 INFO L273 TraceCheckUtils]: 154: Hoare triple {45582#(<= main_~i~0 37)} assume true; {45582#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:23,341 INFO L273 TraceCheckUtils]: 155: Hoare triple {45582#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45582#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:23,342 INFO L273 TraceCheckUtils]: 156: Hoare triple {45582#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45582#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:23,343 INFO L273 TraceCheckUtils]: 157: Hoare triple {45582#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {45583#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:23,343 INFO L273 TraceCheckUtils]: 158: Hoare triple {45583#(<= main_~i~0 38)} assume true; {45583#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:23,343 INFO L273 TraceCheckUtils]: 159: Hoare triple {45583#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45583#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:23,344 INFO L273 TraceCheckUtils]: 160: Hoare triple {45583#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45583#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:23,345 INFO L273 TraceCheckUtils]: 161: Hoare triple {45583#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {45584#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:23,345 INFO L273 TraceCheckUtils]: 162: Hoare triple {45584#(<= main_~i~0 39)} assume true; {45584#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:23,346 INFO L273 TraceCheckUtils]: 163: Hoare triple {45584#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45584#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:23,346 INFO L273 TraceCheckUtils]: 164: Hoare triple {45584#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45584#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:23,347 INFO L273 TraceCheckUtils]: 165: Hoare triple {45584#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {45585#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:23,347 INFO L273 TraceCheckUtils]: 166: Hoare triple {45585#(<= main_~i~0 40)} assume true; {45585#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:23,348 INFO L273 TraceCheckUtils]: 167: Hoare triple {45585#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45585#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:23,348 INFO L273 TraceCheckUtils]: 168: Hoare triple {45585#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45585#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:23,349 INFO L273 TraceCheckUtils]: 169: Hoare triple {45585#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {45586#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:23,349 INFO L273 TraceCheckUtils]: 170: Hoare triple {45586#(<= main_~i~0 41)} assume true; {45586#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:23,350 INFO L273 TraceCheckUtils]: 171: Hoare triple {45586#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45586#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:23,350 INFO L273 TraceCheckUtils]: 172: Hoare triple {45586#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45586#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:23,351 INFO L273 TraceCheckUtils]: 173: Hoare triple {45586#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {45587#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:23,351 INFO L273 TraceCheckUtils]: 174: Hoare triple {45587#(<= main_~i~0 42)} assume true; {45587#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:23,352 INFO L273 TraceCheckUtils]: 175: Hoare triple {45587#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45587#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:23,352 INFO L273 TraceCheckUtils]: 176: Hoare triple {45587#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45587#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:23,353 INFO L273 TraceCheckUtils]: 177: Hoare triple {45587#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {45588#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:23,354 INFO L273 TraceCheckUtils]: 178: Hoare triple {45588#(<= main_~i~0 43)} assume true; {45588#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:23,354 INFO L273 TraceCheckUtils]: 179: Hoare triple {45588#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45588#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:23,354 INFO L273 TraceCheckUtils]: 180: Hoare triple {45588#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45588#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:23,355 INFO L273 TraceCheckUtils]: 181: Hoare triple {45588#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {45589#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:23,356 INFO L273 TraceCheckUtils]: 182: Hoare triple {45589#(<= main_~i~0 44)} assume true; {45589#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:23,356 INFO L273 TraceCheckUtils]: 183: Hoare triple {45589#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45589#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:23,356 INFO L273 TraceCheckUtils]: 184: Hoare triple {45589#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45589#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:23,357 INFO L273 TraceCheckUtils]: 185: Hoare triple {45589#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {45590#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:23,358 INFO L273 TraceCheckUtils]: 186: Hoare triple {45590#(<= main_~i~0 45)} assume true; {45590#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:23,358 INFO L273 TraceCheckUtils]: 187: Hoare triple {45590#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45590#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:23,359 INFO L273 TraceCheckUtils]: 188: Hoare triple {45590#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45590#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:23,359 INFO L273 TraceCheckUtils]: 189: Hoare triple {45590#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {45591#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:23,360 INFO L273 TraceCheckUtils]: 190: Hoare triple {45591#(<= main_~i~0 46)} assume true; {45591#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:23,360 INFO L273 TraceCheckUtils]: 191: Hoare triple {45591#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45591#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:23,361 INFO L273 TraceCheckUtils]: 192: Hoare triple {45591#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45591#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:23,361 INFO L273 TraceCheckUtils]: 193: Hoare triple {45591#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {45592#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:23,362 INFO L273 TraceCheckUtils]: 194: Hoare triple {45592#(<= main_~i~0 47)} assume true; {45592#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:23,362 INFO L273 TraceCheckUtils]: 195: Hoare triple {45592#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45592#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:23,363 INFO L273 TraceCheckUtils]: 196: Hoare triple {45592#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45592#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:23,363 INFO L273 TraceCheckUtils]: 197: Hoare triple {45592#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {45593#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:23,364 INFO L273 TraceCheckUtils]: 198: Hoare triple {45593#(<= main_~i~0 48)} assume true; {45593#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:23,364 INFO L273 TraceCheckUtils]: 199: Hoare triple {45593#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45593#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:23,365 INFO L273 TraceCheckUtils]: 200: Hoare triple {45593#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45593#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:23,365 INFO L273 TraceCheckUtils]: 201: Hoare triple {45593#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {45594#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:23,366 INFO L273 TraceCheckUtils]: 202: Hoare triple {45594#(<= main_~i~0 49)} assume true; {45594#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:23,367 INFO L273 TraceCheckUtils]: 203: Hoare triple {45594#(<= main_~i~0 49)} assume !(~i~0 < 100000); {45544#false} is VALID [2018-11-18 22:58:23,367 INFO L273 TraceCheckUtils]: 204: Hoare triple {45544#false} havoc ~x~0;~x~0 := 0; {45544#false} is VALID [2018-11-18 22:58:23,367 INFO L273 TraceCheckUtils]: 205: Hoare triple {45544#false} assume true; {45544#false} is VALID [2018-11-18 22:58:23,367 INFO L273 TraceCheckUtils]: 206: Hoare triple {45544#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {45544#false} is VALID [2018-11-18 22:58:23,367 INFO L256 TraceCheckUtils]: 207: Hoare triple {45544#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {45544#false} is VALID [2018-11-18 22:58:23,367 INFO L273 TraceCheckUtils]: 208: Hoare triple {45544#false} ~cond := #in~cond; {45544#false} is VALID [2018-11-18 22:58:23,368 INFO L273 TraceCheckUtils]: 209: Hoare triple {45544#false} assume 0 == ~cond; {45544#false} is VALID [2018-11-18 22:58:23,368 INFO L273 TraceCheckUtils]: 210: Hoare triple {45544#false} assume !false; {45544#false} is VALID [2018-11-18 22:58:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:23,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:23,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:23,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:58:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:23,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:23,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {45543#true} call ULTIMATE.init(); {45543#true} is VALID [2018-11-18 22:58:23,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {45543#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45543#true} is VALID [2018-11-18 22:58:23,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {45543#true} assume true; {45543#true} is VALID [2018-11-18 22:58:23,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45543#true} {45543#true} #57#return; {45543#true} is VALID [2018-11-18 22:58:23,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {45543#true} call #t~ret4 := main(); {45543#true} is VALID [2018-11-18 22:58:23,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {45543#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {45613#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:23,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {45613#(<= main_~i~0 0)} assume true; {45613#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:23,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {45613#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45613#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:23,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {45613#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45613#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:23,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {45613#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {45546#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {45546#(<= main_~i~0 1)} assume true; {45546#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {45546#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45546#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,990 INFO L273 TraceCheckUtils]: 12: Hoare triple {45546#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45546#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {45546#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {45547#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,991 INFO L273 TraceCheckUtils]: 14: Hoare triple {45547#(<= main_~i~0 2)} assume true; {45547#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {45547#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45547#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {45547#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45547#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {45547#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {45548#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {45548#(<= main_~i~0 3)} assume true; {45548#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {45548#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45548#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,994 INFO L273 TraceCheckUtils]: 20: Hoare triple {45548#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45548#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {45548#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {45549#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {45549#(<= main_~i~0 4)} assume true; {45549#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,996 INFO L273 TraceCheckUtils]: 23: Hoare triple {45549#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45549#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,996 INFO L273 TraceCheckUtils]: 24: Hoare triple {45549#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45549#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,997 INFO L273 TraceCheckUtils]: 25: Hoare triple {45549#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {45550#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {45550#(<= main_~i~0 5)} assume true; {45550#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,998 INFO L273 TraceCheckUtils]: 27: Hoare triple {45550#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45550#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,999 INFO L273 TraceCheckUtils]: 28: Hoare triple {45550#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45550#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,999 INFO L273 TraceCheckUtils]: 29: Hoare triple {45550#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {45551#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:24,000 INFO L273 TraceCheckUtils]: 30: Hoare triple {45551#(<= main_~i~0 6)} assume true; {45551#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:24,000 INFO L273 TraceCheckUtils]: 31: Hoare triple {45551#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45551#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:24,001 INFO L273 TraceCheckUtils]: 32: Hoare triple {45551#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45551#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:24,001 INFO L273 TraceCheckUtils]: 33: Hoare triple {45551#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {45552#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:24,002 INFO L273 TraceCheckUtils]: 34: Hoare triple {45552#(<= main_~i~0 7)} assume true; {45552#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:24,002 INFO L273 TraceCheckUtils]: 35: Hoare triple {45552#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45552#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:24,003 INFO L273 TraceCheckUtils]: 36: Hoare triple {45552#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45552#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:24,003 INFO L273 TraceCheckUtils]: 37: Hoare triple {45552#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {45553#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:24,004 INFO L273 TraceCheckUtils]: 38: Hoare triple {45553#(<= main_~i~0 8)} assume true; {45553#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:24,004 INFO L273 TraceCheckUtils]: 39: Hoare triple {45553#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45553#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:24,005 INFO L273 TraceCheckUtils]: 40: Hoare triple {45553#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45553#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:24,005 INFO L273 TraceCheckUtils]: 41: Hoare triple {45553#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {45554#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:24,006 INFO L273 TraceCheckUtils]: 42: Hoare triple {45554#(<= main_~i~0 9)} assume true; {45554#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:24,006 INFO L273 TraceCheckUtils]: 43: Hoare triple {45554#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45554#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:24,007 INFO L273 TraceCheckUtils]: 44: Hoare triple {45554#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45554#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:24,007 INFO L273 TraceCheckUtils]: 45: Hoare triple {45554#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {45555#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:24,008 INFO L273 TraceCheckUtils]: 46: Hoare triple {45555#(<= main_~i~0 10)} assume true; {45555#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:24,008 INFO L273 TraceCheckUtils]: 47: Hoare triple {45555#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45555#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:24,009 INFO L273 TraceCheckUtils]: 48: Hoare triple {45555#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45555#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:24,009 INFO L273 TraceCheckUtils]: 49: Hoare triple {45555#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {45556#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:24,010 INFO L273 TraceCheckUtils]: 50: Hoare triple {45556#(<= main_~i~0 11)} assume true; {45556#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:24,010 INFO L273 TraceCheckUtils]: 51: Hoare triple {45556#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45556#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:24,011 INFO L273 TraceCheckUtils]: 52: Hoare triple {45556#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45556#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:24,012 INFO L273 TraceCheckUtils]: 53: Hoare triple {45556#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {45557#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:24,012 INFO L273 TraceCheckUtils]: 54: Hoare triple {45557#(<= main_~i~0 12)} assume true; {45557#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:24,012 INFO L273 TraceCheckUtils]: 55: Hoare triple {45557#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45557#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:24,013 INFO L273 TraceCheckUtils]: 56: Hoare triple {45557#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45557#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:24,014 INFO L273 TraceCheckUtils]: 57: Hoare triple {45557#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {45558#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:24,014 INFO L273 TraceCheckUtils]: 58: Hoare triple {45558#(<= main_~i~0 13)} assume true; {45558#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:24,015 INFO L273 TraceCheckUtils]: 59: Hoare triple {45558#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45558#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:24,015 INFO L273 TraceCheckUtils]: 60: Hoare triple {45558#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45558#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:24,016 INFO L273 TraceCheckUtils]: 61: Hoare triple {45558#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {45559#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:24,016 INFO L273 TraceCheckUtils]: 62: Hoare triple {45559#(<= main_~i~0 14)} assume true; {45559#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:24,017 INFO L273 TraceCheckUtils]: 63: Hoare triple {45559#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45559#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:24,017 INFO L273 TraceCheckUtils]: 64: Hoare triple {45559#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45559#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:24,018 INFO L273 TraceCheckUtils]: 65: Hoare triple {45559#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {45560#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:24,018 INFO L273 TraceCheckUtils]: 66: Hoare triple {45560#(<= main_~i~0 15)} assume true; {45560#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:24,019 INFO L273 TraceCheckUtils]: 67: Hoare triple {45560#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45560#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:24,019 INFO L273 TraceCheckUtils]: 68: Hoare triple {45560#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45560#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:24,020 INFO L273 TraceCheckUtils]: 69: Hoare triple {45560#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {45561#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:24,020 INFO L273 TraceCheckUtils]: 70: Hoare triple {45561#(<= main_~i~0 16)} assume true; {45561#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:24,021 INFO L273 TraceCheckUtils]: 71: Hoare triple {45561#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45561#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:24,021 INFO L273 TraceCheckUtils]: 72: Hoare triple {45561#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45561#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:24,022 INFO L273 TraceCheckUtils]: 73: Hoare triple {45561#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {45562#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:24,022 INFO L273 TraceCheckUtils]: 74: Hoare triple {45562#(<= main_~i~0 17)} assume true; {45562#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:24,023 INFO L273 TraceCheckUtils]: 75: Hoare triple {45562#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45562#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:24,023 INFO L273 TraceCheckUtils]: 76: Hoare triple {45562#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45562#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:24,024 INFO L273 TraceCheckUtils]: 77: Hoare triple {45562#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {45563#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:24,024 INFO L273 TraceCheckUtils]: 78: Hoare triple {45563#(<= main_~i~0 18)} assume true; {45563#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:24,025 INFO L273 TraceCheckUtils]: 79: Hoare triple {45563#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45563#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:24,025 INFO L273 TraceCheckUtils]: 80: Hoare triple {45563#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45563#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:24,026 INFO L273 TraceCheckUtils]: 81: Hoare triple {45563#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {45564#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:24,026 INFO L273 TraceCheckUtils]: 82: Hoare triple {45564#(<= main_~i~0 19)} assume true; {45564#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:24,027 INFO L273 TraceCheckUtils]: 83: Hoare triple {45564#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45564#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:24,027 INFO L273 TraceCheckUtils]: 84: Hoare triple {45564#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45564#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:24,028 INFO L273 TraceCheckUtils]: 85: Hoare triple {45564#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {45565#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:24,029 INFO L273 TraceCheckUtils]: 86: Hoare triple {45565#(<= main_~i~0 20)} assume true; {45565#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:24,029 INFO L273 TraceCheckUtils]: 87: Hoare triple {45565#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45565#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:24,029 INFO L273 TraceCheckUtils]: 88: Hoare triple {45565#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45565#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:24,030 INFO L273 TraceCheckUtils]: 89: Hoare triple {45565#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {45566#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:24,031 INFO L273 TraceCheckUtils]: 90: Hoare triple {45566#(<= main_~i~0 21)} assume true; {45566#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:24,031 INFO L273 TraceCheckUtils]: 91: Hoare triple {45566#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45566#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:24,032 INFO L273 TraceCheckUtils]: 92: Hoare triple {45566#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45566#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:24,032 INFO L273 TraceCheckUtils]: 93: Hoare triple {45566#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {45567#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:24,033 INFO L273 TraceCheckUtils]: 94: Hoare triple {45567#(<= main_~i~0 22)} assume true; {45567#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:24,033 INFO L273 TraceCheckUtils]: 95: Hoare triple {45567#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45567#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:24,034 INFO L273 TraceCheckUtils]: 96: Hoare triple {45567#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45567#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:24,034 INFO L273 TraceCheckUtils]: 97: Hoare triple {45567#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {45568#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:24,035 INFO L273 TraceCheckUtils]: 98: Hoare triple {45568#(<= main_~i~0 23)} assume true; {45568#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:24,035 INFO L273 TraceCheckUtils]: 99: Hoare triple {45568#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45568#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:24,036 INFO L273 TraceCheckUtils]: 100: Hoare triple {45568#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45568#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:24,036 INFO L273 TraceCheckUtils]: 101: Hoare triple {45568#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {45569#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:24,037 INFO L273 TraceCheckUtils]: 102: Hoare triple {45569#(<= main_~i~0 24)} assume true; {45569#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:24,037 INFO L273 TraceCheckUtils]: 103: Hoare triple {45569#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45569#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:24,038 INFO L273 TraceCheckUtils]: 104: Hoare triple {45569#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45569#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:24,038 INFO L273 TraceCheckUtils]: 105: Hoare triple {45569#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {45570#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:24,039 INFO L273 TraceCheckUtils]: 106: Hoare triple {45570#(<= main_~i~0 25)} assume true; {45570#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:24,039 INFO L273 TraceCheckUtils]: 107: Hoare triple {45570#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45570#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:24,040 INFO L273 TraceCheckUtils]: 108: Hoare triple {45570#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45570#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:24,040 INFO L273 TraceCheckUtils]: 109: Hoare triple {45570#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {45571#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:24,041 INFO L273 TraceCheckUtils]: 110: Hoare triple {45571#(<= main_~i~0 26)} assume true; {45571#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:24,041 INFO L273 TraceCheckUtils]: 111: Hoare triple {45571#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45571#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:24,042 INFO L273 TraceCheckUtils]: 112: Hoare triple {45571#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45571#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:24,042 INFO L273 TraceCheckUtils]: 113: Hoare triple {45571#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {45572#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:24,043 INFO L273 TraceCheckUtils]: 114: Hoare triple {45572#(<= main_~i~0 27)} assume true; {45572#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:24,043 INFO L273 TraceCheckUtils]: 115: Hoare triple {45572#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45572#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:24,044 INFO L273 TraceCheckUtils]: 116: Hoare triple {45572#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45572#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:24,045 INFO L273 TraceCheckUtils]: 117: Hoare triple {45572#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {45573#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:24,045 INFO L273 TraceCheckUtils]: 118: Hoare triple {45573#(<= main_~i~0 28)} assume true; {45573#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:24,046 INFO L273 TraceCheckUtils]: 119: Hoare triple {45573#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45573#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:24,046 INFO L273 TraceCheckUtils]: 120: Hoare triple {45573#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45573#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:24,047 INFO L273 TraceCheckUtils]: 121: Hoare triple {45573#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {45574#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:24,047 INFO L273 TraceCheckUtils]: 122: Hoare triple {45574#(<= main_~i~0 29)} assume true; {45574#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:24,048 INFO L273 TraceCheckUtils]: 123: Hoare triple {45574#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45574#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:24,048 INFO L273 TraceCheckUtils]: 124: Hoare triple {45574#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45574#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:24,049 INFO L273 TraceCheckUtils]: 125: Hoare triple {45574#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {45575#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:24,049 INFO L273 TraceCheckUtils]: 126: Hoare triple {45575#(<= main_~i~0 30)} assume true; {45575#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:24,050 INFO L273 TraceCheckUtils]: 127: Hoare triple {45575#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45575#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:24,050 INFO L273 TraceCheckUtils]: 128: Hoare triple {45575#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45575#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:24,051 INFO L273 TraceCheckUtils]: 129: Hoare triple {45575#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {45576#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:24,051 INFO L273 TraceCheckUtils]: 130: Hoare triple {45576#(<= main_~i~0 31)} assume true; {45576#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:24,052 INFO L273 TraceCheckUtils]: 131: Hoare triple {45576#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45576#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:24,052 INFO L273 TraceCheckUtils]: 132: Hoare triple {45576#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45576#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:24,053 INFO L273 TraceCheckUtils]: 133: Hoare triple {45576#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {45577#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:24,053 INFO L273 TraceCheckUtils]: 134: Hoare triple {45577#(<= main_~i~0 32)} assume true; {45577#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:24,054 INFO L273 TraceCheckUtils]: 135: Hoare triple {45577#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45577#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:24,054 INFO L273 TraceCheckUtils]: 136: Hoare triple {45577#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45577#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:24,055 INFO L273 TraceCheckUtils]: 137: Hoare triple {45577#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {45578#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:24,055 INFO L273 TraceCheckUtils]: 138: Hoare triple {45578#(<= main_~i~0 33)} assume true; {45578#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:24,056 INFO L273 TraceCheckUtils]: 139: Hoare triple {45578#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45578#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:24,056 INFO L273 TraceCheckUtils]: 140: Hoare triple {45578#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45578#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:24,057 INFO L273 TraceCheckUtils]: 141: Hoare triple {45578#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {45579#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:24,058 INFO L273 TraceCheckUtils]: 142: Hoare triple {45579#(<= main_~i~0 34)} assume true; {45579#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:24,058 INFO L273 TraceCheckUtils]: 143: Hoare triple {45579#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45579#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:24,058 INFO L273 TraceCheckUtils]: 144: Hoare triple {45579#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45579#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:24,059 INFO L273 TraceCheckUtils]: 145: Hoare triple {45579#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {45580#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:24,060 INFO L273 TraceCheckUtils]: 146: Hoare triple {45580#(<= main_~i~0 35)} assume true; {45580#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:24,060 INFO L273 TraceCheckUtils]: 147: Hoare triple {45580#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45580#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:24,061 INFO L273 TraceCheckUtils]: 148: Hoare triple {45580#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45580#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:24,061 INFO L273 TraceCheckUtils]: 149: Hoare triple {45580#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {45581#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:24,062 INFO L273 TraceCheckUtils]: 150: Hoare triple {45581#(<= main_~i~0 36)} assume true; {45581#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:24,062 INFO L273 TraceCheckUtils]: 151: Hoare triple {45581#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45581#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:24,063 INFO L273 TraceCheckUtils]: 152: Hoare triple {45581#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45581#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:24,063 INFO L273 TraceCheckUtils]: 153: Hoare triple {45581#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {45582#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:24,064 INFO L273 TraceCheckUtils]: 154: Hoare triple {45582#(<= main_~i~0 37)} assume true; {45582#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:24,064 INFO L273 TraceCheckUtils]: 155: Hoare triple {45582#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45582#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:24,065 INFO L273 TraceCheckUtils]: 156: Hoare triple {45582#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45582#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:24,065 INFO L273 TraceCheckUtils]: 157: Hoare triple {45582#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {45583#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:24,066 INFO L273 TraceCheckUtils]: 158: Hoare triple {45583#(<= main_~i~0 38)} assume true; {45583#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:24,066 INFO L273 TraceCheckUtils]: 159: Hoare triple {45583#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45583#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:24,067 INFO L273 TraceCheckUtils]: 160: Hoare triple {45583#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45583#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:24,068 INFO L273 TraceCheckUtils]: 161: Hoare triple {45583#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {45584#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:24,068 INFO L273 TraceCheckUtils]: 162: Hoare triple {45584#(<= main_~i~0 39)} assume true; {45584#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:24,068 INFO L273 TraceCheckUtils]: 163: Hoare triple {45584#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45584#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:24,069 INFO L273 TraceCheckUtils]: 164: Hoare triple {45584#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45584#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:24,070 INFO L273 TraceCheckUtils]: 165: Hoare triple {45584#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {45585#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:24,070 INFO L273 TraceCheckUtils]: 166: Hoare triple {45585#(<= main_~i~0 40)} assume true; {45585#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:24,071 INFO L273 TraceCheckUtils]: 167: Hoare triple {45585#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45585#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:24,071 INFO L273 TraceCheckUtils]: 168: Hoare triple {45585#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45585#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:24,072 INFO L273 TraceCheckUtils]: 169: Hoare triple {45585#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {45586#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:24,072 INFO L273 TraceCheckUtils]: 170: Hoare triple {45586#(<= main_~i~0 41)} assume true; {45586#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:24,073 INFO L273 TraceCheckUtils]: 171: Hoare triple {45586#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45586#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:24,073 INFO L273 TraceCheckUtils]: 172: Hoare triple {45586#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45586#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:24,074 INFO L273 TraceCheckUtils]: 173: Hoare triple {45586#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {45587#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:24,074 INFO L273 TraceCheckUtils]: 174: Hoare triple {45587#(<= main_~i~0 42)} assume true; {45587#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:24,075 INFO L273 TraceCheckUtils]: 175: Hoare triple {45587#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45587#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:24,075 INFO L273 TraceCheckUtils]: 176: Hoare triple {45587#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45587#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:24,076 INFO L273 TraceCheckUtils]: 177: Hoare triple {45587#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {45588#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:24,076 INFO L273 TraceCheckUtils]: 178: Hoare triple {45588#(<= main_~i~0 43)} assume true; {45588#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:24,077 INFO L273 TraceCheckUtils]: 179: Hoare triple {45588#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45588#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:24,077 INFO L273 TraceCheckUtils]: 180: Hoare triple {45588#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45588#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:24,078 INFO L273 TraceCheckUtils]: 181: Hoare triple {45588#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {45589#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:24,078 INFO L273 TraceCheckUtils]: 182: Hoare triple {45589#(<= main_~i~0 44)} assume true; {45589#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:24,079 INFO L273 TraceCheckUtils]: 183: Hoare triple {45589#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45589#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:24,079 INFO L273 TraceCheckUtils]: 184: Hoare triple {45589#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45589#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:24,080 INFO L273 TraceCheckUtils]: 185: Hoare triple {45589#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {45590#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:24,080 INFO L273 TraceCheckUtils]: 186: Hoare triple {45590#(<= main_~i~0 45)} assume true; {45590#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:24,081 INFO L273 TraceCheckUtils]: 187: Hoare triple {45590#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45590#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:24,081 INFO L273 TraceCheckUtils]: 188: Hoare triple {45590#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45590#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:24,082 INFO L273 TraceCheckUtils]: 189: Hoare triple {45590#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {45591#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:24,082 INFO L273 TraceCheckUtils]: 190: Hoare triple {45591#(<= main_~i~0 46)} assume true; {45591#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:24,083 INFO L273 TraceCheckUtils]: 191: Hoare triple {45591#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45591#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:24,083 INFO L273 TraceCheckUtils]: 192: Hoare triple {45591#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45591#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:24,084 INFO L273 TraceCheckUtils]: 193: Hoare triple {45591#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {45592#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:24,085 INFO L273 TraceCheckUtils]: 194: Hoare triple {45592#(<= main_~i~0 47)} assume true; {45592#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:24,085 INFO L273 TraceCheckUtils]: 195: Hoare triple {45592#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45592#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:24,085 INFO L273 TraceCheckUtils]: 196: Hoare triple {45592#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45592#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:24,086 INFO L273 TraceCheckUtils]: 197: Hoare triple {45592#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {45593#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:24,087 INFO L273 TraceCheckUtils]: 198: Hoare triple {45593#(<= main_~i~0 48)} assume true; {45593#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:24,087 INFO L273 TraceCheckUtils]: 199: Hoare triple {45593#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45593#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:24,087 INFO L273 TraceCheckUtils]: 200: Hoare triple {45593#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {45593#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:24,088 INFO L273 TraceCheckUtils]: 201: Hoare triple {45593#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {45594#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:24,089 INFO L273 TraceCheckUtils]: 202: Hoare triple {45594#(<= main_~i~0 49)} assume true; {45594#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:24,089 INFO L273 TraceCheckUtils]: 203: Hoare triple {45594#(<= main_~i~0 49)} assume !(~i~0 < 100000); {45544#false} is VALID [2018-11-18 22:58:24,090 INFO L273 TraceCheckUtils]: 204: Hoare triple {45544#false} havoc ~x~0;~x~0 := 0; {45544#false} is VALID [2018-11-18 22:58:24,090 INFO L273 TraceCheckUtils]: 205: Hoare triple {45544#false} assume true; {45544#false} is VALID [2018-11-18 22:58:24,090 INFO L273 TraceCheckUtils]: 206: Hoare triple {45544#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {45544#false} is VALID [2018-11-18 22:58:24,090 INFO L256 TraceCheckUtils]: 207: Hoare triple {45544#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {45544#false} is VALID [2018-11-18 22:58:24,090 INFO L273 TraceCheckUtils]: 208: Hoare triple {45544#false} ~cond := #in~cond; {45544#false} is VALID [2018-11-18 22:58:24,090 INFO L273 TraceCheckUtils]: 209: Hoare triple {45544#false} assume 0 == ~cond; {45544#false} is VALID [2018-11-18 22:58:24,091 INFO L273 TraceCheckUtils]: 210: Hoare triple {45544#false} assume !false; {45544#false} is VALID [2018-11-18 22:58:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:24,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:24,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2018-11-18 22:58:24,142 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 211 [2018-11-18 22:58:24,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:24,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-18 22:58:24,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:24,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-18 22:58:24,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-18 22:58:24,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-18 22:58:24,333 INFO L87 Difference]: Start difference. First operand 216 states and 266 transitions. Second operand 53 states. [2018-11-18 22:58:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:25,207 INFO L93 Difference]: Finished difference Result 234 states and 287 transitions. [2018-11-18 22:58:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-18 22:58:25,208 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 211 [2018-11-18 22:58:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:58:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 287 transitions. [2018-11-18 22:58:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:58:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 287 transitions. [2018-11-18 22:58:25,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 287 transitions. [2018-11-18 22:58:25,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:25,510 INFO L225 Difference]: With dead ends: 234 [2018-11-18 22:58:25,510 INFO L226 Difference]: Without dead ends: 222 [2018-11-18 22:58:25,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-18 22:58:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-18 22:58:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-11-18 22:58:25,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:25,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand 220 states. [2018-11-18 22:58:25,557 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand 220 states. [2018-11-18 22:58:25,557 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 220 states. [2018-11-18 22:58:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:25,561 INFO L93 Difference]: Finished difference Result 222 states and 274 transitions. [2018-11-18 22:58:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 274 transitions. [2018-11-18 22:58:25,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:25,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:25,561 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand 222 states. [2018-11-18 22:58:25,562 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 222 states. [2018-11-18 22:58:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:25,565 INFO L93 Difference]: Finished difference Result 222 states and 274 transitions. [2018-11-18 22:58:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 274 transitions. [2018-11-18 22:58:25,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:25,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:25,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:25,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-18 22:58:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 271 transitions. [2018-11-18 22:58:25,569 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 271 transitions. Word has length 211 [2018-11-18 22:58:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:25,569 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 271 transitions. [2018-11-18 22:58:25,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-18 22:58:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 271 transitions. [2018-11-18 22:58:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-18 22:58:25,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:25,571 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:25,571 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:25,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2018840754, now seen corresponding path program 50 times [2018-11-18 22:58:25,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:25,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:25,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:25,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:58:25,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:26,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {47245#true} call ULTIMATE.init(); {47245#true} is VALID [2018-11-18 22:58:26,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {47245#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47245#true} is VALID [2018-11-18 22:58:26,899 INFO L273 TraceCheckUtils]: 2: Hoare triple {47245#true} assume true; {47245#true} is VALID [2018-11-18 22:58:26,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47245#true} {47245#true} #57#return; {47245#true} is VALID [2018-11-18 22:58:26,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {47245#true} call #t~ret4 := main(); {47245#true} is VALID [2018-11-18 22:58:26,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {47245#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {47247#(= main_~i~0 0)} is VALID [2018-11-18 22:58:26,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {47247#(= main_~i~0 0)} assume true; {47247#(= main_~i~0 0)} is VALID [2018-11-18 22:58:26,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {47247#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47247#(= main_~i~0 0)} is VALID [2018-11-18 22:58:26,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {47247#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47247#(= main_~i~0 0)} is VALID [2018-11-18 22:58:26,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {47247#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {47248#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:26,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {47248#(<= main_~i~0 1)} assume true; {47248#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:26,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {47248#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47248#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:26,903 INFO L273 TraceCheckUtils]: 12: Hoare triple {47248#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47248#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:26,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {47248#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {47249#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:26,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {47249#(<= main_~i~0 2)} assume true; {47249#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:26,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {47249#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47249#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:26,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {47249#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47249#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:26,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {47249#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {47250#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:26,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {47250#(<= main_~i~0 3)} assume true; {47250#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:26,906 INFO L273 TraceCheckUtils]: 19: Hoare triple {47250#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47250#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:26,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {47250#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47250#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:26,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {47250#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {47251#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:26,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {47251#(<= main_~i~0 4)} assume true; {47251#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:26,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {47251#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47251#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:26,909 INFO L273 TraceCheckUtils]: 24: Hoare triple {47251#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47251#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:26,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {47251#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {47252#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:26,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {47252#(<= main_~i~0 5)} assume true; {47252#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:26,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {47252#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47252#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:26,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {47252#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47252#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:26,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {47252#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {47253#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:26,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {47253#(<= main_~i~0 6)} assume true; {47253#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:26,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {47253#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47253#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:26,913 INFO L273 TraceCheckUtils]: 32: Hoare triple {47253#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47253#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:26,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {47253#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {47254#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:26,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {47254#(<= main_~i~0 7)} assume true; {47254#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:26,915 INFO L273 TraceCheckUtils]: 35: Hoare triple {47254#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47254#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:26,915 INFO L273 TraceCheckUtils]: 36: Hoare triple {47254#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47254#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:26,916 INFO L273 TraceCheckUtils]: 37: Hoare triple {47254#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {47255#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:26,917 INFO L273 TraceCheckUtils]: 38: Hoare triple {47255#(<= main_~i~0 8)} assume true; {47255#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:26,917 INFO L273 TraceCheckUtils]: 39: Hoare triple {47255#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47255#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:26,918 INFO L273 TraceCheckUtils]: 40: Hoare triple {47255#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47255#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:26,918 INFO L273 TraceCheckUtils]: 41: Hoare triple {47255#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {47256#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:26,919 INFO L273 TraceCheckUtils]: 42: Hoare triple {47256#(<= main_~i~0 9)} assume true; {47256#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:26,919 INFO L273 TraceCheckUtils]: 43: Hoare triple {47256#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47256#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:26,920 INFO L273 TraceCheckUtils]: 44: Hoare triple {47256#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47256#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:26,920 INFO L273 TraceCheckUtils]: 45: Hoare triple {47256#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {47257#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:26,921 INFO L273 TraceCheckUtils]: 46: Hoare triple {47257#(<= main_~i~0 10)} assume true; {47257#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:26,921 INFO L273 TraceCheckUtils]: 47: Hoare triple {47257#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47257#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:26,922 INFO L273 TraceCheckUtils]: 48: Hoare triple {47257#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47257#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:26,923 INFO L273 TraceCheckUtils]: 49: Hoare triple {47257#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {47258#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:26,923 INFO L273 TraceCheckUtils]: 50: Hoare triple {47258#(<= main_~i~0 11)} assume true; {47258#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:26,924 INFO L273 TraceCheckUtils]: 51: Hoare triple {47258#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47258#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:26,924 INFO L273 TraceCheckUtils]: 52: Hoare triple {47258#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47258#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:26,925 INFO L273 TraceCheckUtils]: 53: Hoare triple {47258#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {47259#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:26,925 INFO L273 TraceCheckUtils]: 54: Hoare triple {47259#(<= main_~i~0 12)} assume true; {47259#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:26,926 INFO L273 TraceCheckUtils]: 55: Hoare triple {47259#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47259#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:26,926 INFO L273 TraceCheckUtils]: 56: Hoare triple {47259#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47259#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:26,927 INFO L273 TraceCheckUtils]: 57: Hoare triple {47259#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {47260#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:26,927 INFO L273 TraceCheckUtils]: 58: Hoare triple {47260#(<= main_~i~0 13)} assume true; {47260#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:26,928 INFO L273 TraceCheckUtils]: 59: Hoare triple {47260#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47260#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:26,928 INFO L273 TraceCheckUtils]: 60: Hoare triple {47260#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47260#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:26,929 INFO L273 TraceCheckUtils]: 61: Hoare triple {47260#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {47261#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:26,930 INFO L273 TraceCheckUtils]: 62: Hoare triple {47261#(<= main_~i~0 14)} assume true; {47261#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:26,930 INFO L273 TraceCheckUtils]: 63: Hoare triple {47261#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47261#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:26,931 INFO L273 TraceCheckUtils]: 64: Hoare triple {47261#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47261#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:26,931 INFO L273 TraceCheckUtils]: 65: Hoare triple {47261#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {47262#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:26,932 INFO L273 TraceCheckUtils]: 66: Hoare triple {47262#(<= main_~i~0 15)} assume true; {47262#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:26,932 INFO L273 TraceCheckUtils]: 67: Hoare triple {47262#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47262#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:26,933 INFO L273 TraceCheckUtils]: 68: Hoare triple {47262#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47262#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:26,934 INFO L273 TraceCheckUtils]: 69: Hoare triple {47262#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {47263#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:26,934 INFO L273 TraceCheckUtils]: 70: Hoare triple {47263#(<= main_~i~0 16)} assume true; {47263#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:26,935 INFO L273 TraceCheckUtils]: 71: Hoare triple {47263#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47263#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:26,935 INFO L273 TraceCheckUtils]: 72: Hoare triple {47263#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47263#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:26,936 INFO L273 TraceCheckUtils]: 73: Hoare triple {47263#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {47264#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:26,936 INFO L273 TraceCheckUtils]: 74: Hoare triple {47264#(<= main_~i~0 17)} assume true; {47264#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:26,937 INFO L273 TraceCheckUtils]: 75: Hoare triple {47264#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47264#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:26,937 INFO L273 TraceCheckUtils]: 76: Hoare triple {47264#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47264#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:26,938 INFO L273 TraceCheckUtils]: 77: Hoare triple {47264#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {47265#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:26,938 INFO L273 TraceCheckUtils]: 78: Hoare triple {47265#(<= main_~i~0 18)} assume true; {47265#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:26,939 INFO L273 TraceCheckUtils]: 79: Hoare triple {47265#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47265#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:26,939 INFO L273 TraceCheckUtils]: 80: Hoare triple {47265#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47265#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:26,940 INFO L273 TraceCheckUtils]: 81: Hoare triple {47265#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {47266#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:26,941 INFO L273 TraceCheckUtils]: 82: Hoare triple {47266#(<= main_~i~0 19)} assume true; {47266#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:26,941 INFO L273 TraceCheckUtils]: 83: Hoare triple {47266#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47266#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:26,942 INFO L273 TraceCheckUtils]: 84: Hoare triple {47266#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47266#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:26,942 INFO L273 TraceCheckUtils]: 85: Hoare triple {47266#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {47267#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:26,943 INFO L273 TraceCheckUtils]: 86: Hoare triple {47267#(<= main_~i~0 20)} assume true; {47267#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:26,943 INFO L273 TraceCheckUtils]: 87: Hoare triple {47267#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47267#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:26,944 INFO L273 TraceCheckUtils]: 88: Hoare triple {47267#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47267#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:26,944 INFO L273 TraceCheckUtils]: 89: Hoare triple {47267#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {47268#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:26,945 INFO L273 TraceCheckUtils]: 90: Hoare triple {47268#(<= main_~i~0 21)} assume true; {47268#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:26,945 INFO L273 TraceCheckUtils]: 91: Hoare triple {47268#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47268#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:26,946 INFO L273 TraceCheckUtils]: 92: Hoare triple {47268#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47268#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:26,947 INFO L273 TraceCheckUtils]: 93: Hoare triple {47268#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {47269#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:26,947 INFO L273 TraceCheckUtils]: 94: Hoare triple {47269#(<= main_~i~0 22)} assume true; {47269#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:26,948 INFO L273 TraceCheckUtils]: 95: Hoare triple {47269#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47269#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:26,948 INFO L273 TraceCheckUtils]: 96: Hoare triple {47269#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47269#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:26,949 INFO L273 TraceCheckUtils]: 97: Hoare triple {47269#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {47270#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:26,949 INFO L273 TraceCheckUtils]: 98: Hoare triple {47270#(<= main_~i~0 23)} assume true; {47270#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:26,950 INFO L273 TraceCheckUtils]: 99: Hoare triple {47270#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47270#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:26,950 INFO L273 TraceCheckUtils]: 100: Hoare triple {47270#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47270#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:26,951 INFO L273 TraceCheckUtils]: 101: Hoare triple {47270#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {47271#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:26,952 INFO L273 TraceCheckUtils]: 102: Hoare triple {47271#(<= main_~i~0 24)} assume true; {47271#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:26,952 INFO L273 TraceCheckUtils]: 103: Hoare triple {47271#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47271#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:26,952 INFO L273 TraceCheckUtils]: 104: Hoare triple {47271#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47271#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:26,953 INFO L273 TraceCheckUtils]: 105: Hoare triple {47271#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {47272#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:26,954 INFO L273 TraceCheckUtils]: 106: Hoare triple {47272#(<= main_~i~0 25)} assume true; {47272#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:26,954 INFO L273 TraceCheckUtils]: 107: Hoare triple {47272#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47272#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:26,955 INFO L273 TraceCheckUtils]: 108: Hoare triple {47272#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47272#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:26,955 INFO L273 TraceCheckUtils]: 109: Hoare triple {47272#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {47273#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:26,956 INFO L273 TraceCheckUtils]: 110: Hoare triple {47273#(<= main_~i~0 26)} assume true; {47273#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:26,956 INFO L273 TraceCheckUtils]: 111: Hoare triple {47273#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47273#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:26,957 INFO L273 TraceCheckUtils]: 112: Hoare triple {47273#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47273#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:26,958 INFO L273 TraceCheckUtils]: 113: Hoare triple {47273#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {47274#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:26,958 INFO L273 TraceCheckUtils]: 114: Hoare triple {47274#(<= main_~i~0 27)} assume true; {47274#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:26,959 INFO L273 TraceCheckUtils]: 115: Hoare triple {47274#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47274#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:26,959 INFO L273 TraceCheckUtils]: 116: Hoare triple {47274#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47274#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:26,960 INFO L273 TraceCheckUtils]: 117: Hoare triple {47274#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {47275#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:26,960 INFO L273 TraceCheckUtils]: 118: Hoare triple {47275#(<= main_~i~0 28)} assume true; {47275#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:26,961 INFO L273 TraceCheckUtils]: 119: Hoare triple {47275#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47275#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:26,961 INFO L273 TraceCheckUtils]: 120: Hoare triple {47275#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47275#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:26,962 INFO L273 TraceCheckUtils]: 121: Hoare triple {47275#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {47276#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:26,962 INFO L273 TraceCheckUtils]: 122: Hoare triple {47276#(<= main_~i~0 29)} assume true; {47276#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:26,963 INFO L273 TraceCheckUtils]: 123: Hoare triple {47276#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47276#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:26,963 INFO L273 TraceCheckUtils]: 124: Hoare triple {47276#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47276#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:26,964 INFO L273 TraceCheckUtils]: 125: Hoare triple {47276#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {47277#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:26,965 INFO L273 TraceCheckUtils]: 126: Hoare triple {47277#(<= main_~i~0 30)} assume true; {47277#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:26,965 INFO L273 TraceCheckUtils]: 127: Hoare triple {47277#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47277#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:26,966 INFO L273 TraceCheckUtils]: 128: Hoare triple {47277#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47277#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:26,966 INFO L273 TraceCheckUtils]: 129: Hoare triple {47277#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {47278#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:26,967 INFO L273 TraceCheckUtils]: 130: Hoare triple {47278#(<= main_~i~0 31)} assume true; {47278#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:26,967 INFO L273 TraceCheckUtils]: 131: Hoare triple {47278#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47278#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:26,968 INFO L273 TraceCheckUtils]: 132: Hoare triple {47278#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47278#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:26,969 INFO L273 TraceCheckUtils]: 133: Hoare triple {47278#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {47279#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:26,969 INFO L273 TraceCheckUtils]: 134: Hoare triple {47279#(<= main_~i~0 32)} assume true; {47279#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:26,970 INFO L273 TraceCheckUtils]: 135: Hoare triple {47279#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47279#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:26,970 INFO L273 TraceCheckUtils]: 136: Hoare triple {47279#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47279#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:26,971 INFO L273 TraceCheckUtils]: 137: Hoare triple {47279#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {47280#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:26,971 INFO L273 TraceCheckUtils]: 138: Hoare triple {47280#(<= main_~i~0 33)} assume true; {47280#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:26,972 INFO L273 TraceCheckUtils]: 139: Hoare triple {47280#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47280#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:26,972 INFO L273 TraceCheckUtils]: 140: Hoare triple {47280#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47280#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:26,973 INFO L273 TraceCheckUtils]: 141: Hoare triple {47280#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {47281#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:26,973 INFO L273 TraceCheckUtils]: 142: Hoare triple {47281#(<= main_~i~0 34)} assume true; {47281#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:26,974 INFO L273 TraceCheckUtils]: 143: Hoare triple {47281#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47281#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:26,974 INFO L273 TraceCheckUtils]: 144: Hoare triple {47281#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47281#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:26,975 INFO L273 TraceCheckUtils]: 145: Hoare triple {47281#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {47282#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:26,976 INFO L273 TraceCheckUtils]: 146: Hoare triple {47282#(<= main_~i~0 35)} assume true; {47282#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:26,976 INFO L273 TraceCheckUtils]: 147: Hoare triple {47282#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47282#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:26,977 INFO L273 TraceCheckUtils]: 148: Hoare triple {47282#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47282#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:26,977 INFO L273 TraceCheckUtils]: 149: Hoare triple {47282#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {47283#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:26,978 INFO L273 TraceCheckUtils]: 150: Hoare triple {47283#(<= main_~i~0 36)} assume true; {47283#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:26,978 INFO L273 TraceCheckUtils]: 151: Hoare triple {47283#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47283#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:26,979 INFO L273 TraceCheckUtils]: 152: Hoare triple {47283#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47283#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:26,979 INFO L273 TraceCheckUtils]: 153: Hoare triple {47283#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {47284#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:26,980 INFO L273 TraceCheckUtils]: 154: Hoare triple {47284#(<= main_~i~0 37)} assume true; {47284#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:26,980 INFO L273 TraceCheckUtils]: 155: Hoare triple {47284#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47284#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:26,981 INFO L273 TraceCheckUtils]: 156: Hoare triple {47284#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47284#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:26,982 INFO L273 TraceCheckUtils]: 157: Hoare triple {47284#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {47285#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:26,982 INFO L273 TraceCheckUtils]: 158: Hoare triple {47285#(<= main_~i~0 38)} assume true; {47285#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:26,983 INFO L273 TraceCheckUtils]: 159: Hoare triple {47285#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47285#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:26,983 INFO L273 TraceCheckUtils]: 160: Hoare triple {47285#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47285#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:26,984 INFO L273 TraceCheckUtils]: 161: Hoare triple {47285#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {47286#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:26,984 INFO L273 TraceCheckUtils]: 162: Hoare triple {47286#(<= main_~i~0 39)} assume true; {47286#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:26,985 INFO L273 TraceCheckUtils]: 163: Hoare triple {47286#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47286#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:26,985 INFO L273 TraceCheckUtils]: 164: Hoare triple {47286#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47286#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:26,986 INFO L273 TraceCheckUtils]: 165: Hoare triple {47286#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {47287#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:26,987 INFO L273 TraceCheckUtils]: 166: Hoare triple {47287#(<= main_~i~0 40)} assume true; {47287#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:26,987 INFO L273 TraceCheckUtils]: 167: Hoare triple {47287#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47287#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:26,987 INFO L273 TraceCheckUtils]: 168: Hoare triple {47287#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47287#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:26,988 INFO L273 TraceCheckUtils]: 169: Hoare triple {47287#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {47288#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:26,989 INFO L273 TraceCheckUtils]: 170: Hoare triple {47288#(<= main_~i~0 41)} assume true; {47288#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:26,989 INFO L273 TraceCheckUtils]: 171: Hoare triple {47288#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47288#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:26,990 INFO L273 TraceCheckUtils]: 172: Hoare triple {47288#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47288#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:26,990 INFO L273 TraceCheckUtils]: 173: Hoare triple {47288#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {47289#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:26,991 INFO L273 TraceCheckUtils]: 174: Hoare triple {47289#(<= main_~i~0 42)} assume true; {47289#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:26,991 INFO L273 TraceCheckUtils]: 175: Hoare triple {47289#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47289#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:26,992 INFO L273 TraceCheckUtils]: 176: Hoare triple {47289#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47289#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:26,993 INFO L273 TraceCheckUtils]: 177: Hoare triple {47289#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {47290#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:26,993 INFO L273 TraceCheckUtils]: 178: Hoare triple {47290#(<= main_~i~0 43)} assume true; {47290#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:26,994 INFO L273 TraceCheckUtils]: 179: Hoare triple {47290#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47290#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:26,994 INFO L273 TraceCheckUtils]: 180: Hoare triple {47290#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47290#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:26,995 INFO L273 TraceCheckUtils]: 181: Hoare triple {47290#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {47291#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:26,995 INFO L273 TraceCheckUtils]: 182: Hoare triple {47291#(<= main_~i~0 44)} assume true; {47291#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:26,996 INFO L273 TraceCheckUtils]: 183: Hoare triple {47291#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47291#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:26,996 INFO L273 TraceCheckUtils]: 184: Hoare triple {47291#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47291#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:26,997 INFO L273 TraceCheckUtils]: 185: Hoare triple {47291#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {47292#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:26,997 INFO L273 TraceCheckUtils]: 186: Hoare triple {47292#(<= main_~i~0 45)} assume true; {47292#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:26,998 INFO L273 TraceCheckUtils]: 187: Hoare triple {47292#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47292#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:26,998 INFO L273 TraceCheckUtils]: 188: Hoare triple {47292#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47292#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:26,999 INFO L273 TraceCheckUtils]: 189: Hoare triple {47292#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {47293#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:27,000 INFO L273 TraceCheckUtils]: 190: Hoare triple {47293#(<= main_~i~0 46)} assume true; {47293#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:27,000 INFO L273 TraceCheckUtils]: 191: Hoare triple {47293#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47293#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:27,001 INFO L273 TraceCheckUtils]: 192: Hoare triple {47293#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47293#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:27,001 INFO L273 TraceCheckUtils]: 193: Hoare triple {47293#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {47294#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:27,002 INFO L273 TraceCheckUtils]: 194: Hoare triple {47294#(<= main_~i~0 47)} assume true; {47294#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:27,002 INFO L273 TraceCheckUtils]: 195: Hoare triple {47294#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47294#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:27,003 INFO L273 TraceCheckUtils]: 196: Hoare triple {47294#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47294#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:27,003 INFO L273 TraceCheckUtils]: 197: Hoare triple {47294#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {47295#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:27,004 INFO L273 TraceCheckUtils]: 198: Hoare triple {47295#(<= main_~i~0 48)} assume true; {47295#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:27,004 INFO L273 TraceCheckUtils]: 199: Hoare triple {47295#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47295#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:27,005 INFO L273 TraceCheckUtils]: 200: Hoare triple {47295#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47295#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:27,006 INFO L273 TraceCheckUtils]: 201: Hoare triple {47295#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {47296#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:27,006 INFO L273 TraceCheckUtils]: 202: Hoare triple {47296#(<= main_~i~0 49)} assume true; {47296#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:27,007 INFO L273 TraceCheckUtils]: 203: Hoare triple {47296#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47296#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:27,007 INFO L273 TraceCheckUtils]: 204: Hoare triple {47296#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47296#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:27,008 INFO L273 TraceCheckUtils]: 205: Hoare triple {47296#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {47297#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:27,008 INFO L273 TraceCheckUtils]: 206: Hoare triple {47297#(<= main_~i~0 50)} assume true; {47297#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:27,009 INFO L273 TraceCheckUtils]: 207: Hoare triple {47297#(<= main_~i~0 50)} assume !(~i~0 < 100000); {47246#false} is VALID [2018-11-18 22:58:27,009 INFO L273 TraceCheckUtils]: 208: Hoare triple {47246#false} havoc ~x~0;~x~0 := 0; {47246#false} is VALID [2018-11-18 22:58:27,009 INFO L273 TraceCheckUtils]: 209: Hoare triple {47246#false} assume true; {47246#false} is VALID [2018-11-18 22:58:27,010 INFO L273 TraceCheckUtils]: 210: Hoare triple {47246#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {47246#false} is VALID [2018-11-18 22:58:27,010 INFO L256 TraceCheckUtils]: 211: Hoare triple {47246#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {47246#false} is VALID [2018-11-18 22:58:27,010 INFO L273 TraceCheckUtils]: 212: Hoare triple {47246#false} ~cond := #in~cond; {47246#false} is VALID [2018-11-18 22:58:27,010 INFO L273 TraceCheckUtils]: 213: Hoare triple {47246#false} assume 0 == ~cond; {47246#false} is VALID [2018-11-18 22:58:27,010 INFO L273 TraceCheckUtils]: 214: Hoare triple {47246#false} assume !false; {47246#false} is VALID [2018-11-18 22:58:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:27,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:27,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:27,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:58:27,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:58:27,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:27,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:27,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {47245#true} call ULTIMATE.init(); {47245#true} is VALID [2018-11-18 22:58:27,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {47245#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47245#true} is VALID [2018-11-18 22:58:27,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {47245#true} assume true; {47245#true} is VALID [2018-11-18 22:58:27,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47245#true} {47245#true} #57#return; {47245#true} is VALID [2018-11-18 22:58:27,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {47245#true} call #t~ret4 := main(); {47245#true} is VALID [2018-11-18 22:58:27,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {47245#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {47316#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:27,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {47316#(<= main_~i~0 0)} assume true; {47316#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:27,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {47316#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47316#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:27,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {47316#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47316#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:27,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {47316#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {47248#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:27,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {47248#(<= main_~i~0 1)} assume true; {47248#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:27,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {47248#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47248#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:27,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {47248#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47248#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:27,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {47248#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {47249#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:27,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {47249#(<= main_~i~0 2)} assume true; {47249#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:27,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {47249#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47249#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:27,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {47249#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47249#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:27,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {47249#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {47250#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:27,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {47250#(<= main_~i~0 3)} assume true; {47250#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:27,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {47250#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47250#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:27,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {47250#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47250#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:27,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {47250#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {47251#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:27,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {47251#(<= main_~i~0 4)} assume true; {47251#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:27,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {47251#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47251#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:27,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {47251#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47251#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:27,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {47251#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {47252#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:27,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {47252#(<= main_~i~0 5)} assume true; {47252#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:27,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {47252#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47252#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:27,983 INFO L273 TraceCheckUtils]: 28: Hoare triple {47252#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47252#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:27,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {47252#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {47253#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:27,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {47253#(<= main_~i~0 6)} assume true; {47253#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:27,985 INFO L273 TraceCheckUtils]: 31: Hoare triple {47253#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47253#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:27,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {47253#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47253#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:27,986 INFO L273 TraceCheckUtils]: 33: Hoare triple {47253#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {47254#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:27,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {47254#(<= main_~i~0 7)} assume true; {47254#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:27,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {47254#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47254#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:27,988 INFO L273 TraceCheckUtils]: 36: Hoare triple {47254#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47254#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:27,988 INFO L273 TraceCheckUtils]: 37: Hoare triple {47254#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {47255#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:27,989 INFO L273 TraceCheckUtils]: 38: Hoare triple {47255#(<= main_~i~0 8)} assume true; {47255#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:27,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {47255#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47255#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:27,990 INFO L273 TraceCheckUtils]: 40: Hoare triple {47255#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47255#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:27,991 INFO L273 TraceCheckUtils]: 41: Hoare triple {47255#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {47256#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:27,991 INFO L273 TraceCheckUtils]: 42: Hoare triple {47256#(<= main_~i~0 9)} assume true; {47256#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:27,992 INFO L273 TraceCheckUtils]: 43: Hoare triple {47256#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47256#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:27,992 INFO L273 TraceCheckUtils]: 44: Hoare triple {47256#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47256#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:27,993 INFO L273 TraceCheckUtils]: 45: Hoare triple {47256#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {47257#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:27,993 INFO L273 TraceCheckUtils]: 46: Hoare triple {47257#(<= main_~i~0 10)} assume true; {47257#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:27,994 INFO L273 TraceCheckUtils]: 47: Hoare triple {47257#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47257#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:27,994 INFO L273 TraceCheckUtils]: 48: Hoare triple {47257#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47257#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:27,995 INFO L273 TraceCheckUtils]: 49: Hoare triple {47257#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {47258#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:27,995 INFO L273 TraceCheckUtils]: 50: Hoare triple {47258#(<= main_~i~0 11)} assume true; {47258#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:27,996 INFO L273 TraceCheckUtils]: 51: Hoare triple {47258#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47258#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:27,996 INFO L273 TraceCheckUtils]: 52: Hoare triple {47258#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47258#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:27,997 INFO L273 TraceCheckUtils]: 53: Hoare triple {47258#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {47259#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:27,998 INFO L273 TraceCheckUtils]: 54: Hoare triple {47259#(<= main_~i~0 12)} assume true; {47259#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:27,998 INFO L273 TraceCheckUtils]: 55: Hoare triple {47259#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47259#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:27,999 INFO L273 TraceCheckUtils]: 56: Hoare triple {47259#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47259#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:27,999 INFO L273 TraceCheckUtils]: 57: Hoare triple {47259#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {47260#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:28,000 INFO L273 TraceCheckUtils]: 58: Hoare triple {47260#(<= main_~i~0 13)} assume true; {47260#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:28,000 INFO L273 TraceCheckUtils]: 59: Hoare triple {47260#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47260#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:28,001 INFO L273 TraceCheckUtils]: 60: Hoare triple {47260#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47260#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:28,002 INFO L273 TraceCheckUtils]: 61: Hoare triple {47260#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {47261#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:28,002 INFO L273 TraceCheckUtils]: 62: Hoare triple {47261#(<= main_~i~0 14)} assume true; {47261#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:28,003 INFO L273 TraceCheckUtils]: 63: Hoare triple {47261#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47261#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:28,003 INFO L273 TraceCheckUtils]: 64: Hoare triple {47261#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47261#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:28,004 INFO L273 TraceCheckUtils]: 65: Hoare triple {47261#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {47262#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:28,004 INFO L273 TraceCheckUtils]: 66: Hoare triple {47262#(<= main_~i~0 15)} assume true; {47262#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:28,005 INFO L273 TraceCheckUtils]: 67: Hoare triple {47262#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47262#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:28,005 INFO L273 TraceCheckUtils]: 68: Hoare triple {47262#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47262#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:28,006 INFO L273 TraceCheckUtils]: 69: Hoare triple {47262#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {47263#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:28,007 INFO L273 TraceCheckUtils]: 70: Hoare triple {47263#(<= main_~i~0 16)} assume true; {47263#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:28,007 INFO L273 TraceCheckUtils]: 71: Hoare triple {47263#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47263#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:28,008 INFO L273 TraceCheckUtils]: 72: Hoare triple {47263#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47263#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:28,008 INFO L273 TraceCheckUtils]: 73: Hoare triple {47263#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {47264#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:28,009 INFO L273 TraceCheckUtils]: 74: Hoare triple {47264#(<= main_~i~0 17)} assume true; {47264#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:28,009 INFO L273 TraceCheckUtils]: 75: Hoare triple {47264#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47264#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:28,010 INFO L273 TraceCheckUtils]: 76: Hoare triple {47264#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47264#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:28,011 INFO L273 TraceCheckUtils]: 77: Hoare triple {47264#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {47265#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:28,011 INFO L273 TraceCheckUtils]: 78: Hoare triple {47265#(<= main_~i~0 18)} assume true; {47265#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:28,012 INFO L273 TraceCheckUtils]: 79: Hoare triple {47265#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47265#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:28,012 INFO L273 TraceCheckUtils]: 80: Hoare triple {47265#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47265#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:28,013 INFO L273 TraceCheckUtils]: 81: Hoare triple {47265#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {47266#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:28,013 INFO L273 TraceCheckUtils]: 82: Hoare triple {47266#(<= main_~i~0 19)} assume true; {47266#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:28,014 INFO L273 TraceCheckUtils]: 83: Hoare triple {47266#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47266#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:28,014 INFO L273 TraceCheckUtils]: 84: Hoare triple {47266#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47266#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:28,015 INFO L273 TraceCheckUtils]: 85: Hoare triple {47266#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {47267#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:28,015 INFO L273 TraceCheckUtils]: 86: Hoare triple {47267#(<= main_~i~0 20)} assume true; {47267#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:28,016 INFO L273 TraceCheckUtils]: 87: Hoare triple {47267#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47267#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:28,016 INFO L273 TraceCheckUtils]: 88: Hoare triple {47267#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47267#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:28,017 INFO L273 TraceCheckUtils]: 89: Hoare triple {47267#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {47268#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:28,018 INFO L273 TraceCheckUtils]: 90: Hoare triple {47268#(<= main_~i~0 21)} assume true; {47268#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:28,018 INFO L273 TraceCheckUtils]: 91: Hoare triple {47268#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47268#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:28,019 INFO L273 TraceCheckUtils]: 92: Hoare triple {47268#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47268#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:28,019 INFO L273 TraceCheckUtils]: 93: Hoare triple {47268#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {47269#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:28,020 INFO L273 TraceCheckUtils]: 94: Hoare triple {47269#(<= main_~i~0 22)} assume true; {47269#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:28,020 INFO L273 TraceCheckUtils]: 95: Hoare triple {47269#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47269#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:28,021 INFO L273 TraceCheckUtils]: 96: Hoare triple {47269#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47269#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:28,022 INFO L273 TraceCheckUtils]: 97: Hoare triple {47269#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {47270#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:28,022 INFO L273 TraceCheckUtils]: 98: Hoare triple {47270#(<= main_~i~0 23)} assume true; {47270#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:28,023 INFO L273 TraceCheckUtils]: 99: Hoare triple {47270#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47270#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:28,023 INFO L273 TraceCheckUtils]: 100: Hoare triple {47270#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47270#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:28,024 INFO L273 TraceCheckUtils]: 101: Hoare triple {47270#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {47271#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:28,024 INFO L273 TraceCheckUtils]: 102: Hoare triple {47271#(<= main_~i~0 24)} assume true; {47271#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:28,025 INFO L273 TraceCheckUtils]: 103: Hoare triple {47271#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47271#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:28,025 INFO L273 TraceCheckUtils]: 104: Hoare triple {47271#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47271#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:28,026 INFO L273 TraceCheckUtils]: 105: Hoare triple {47271#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {47272#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:28,026 INFO L273 TraceCheckUtils]: 106: Hoare triple {47272#(<= main_~i~0 25)} assume true; {47272#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:28,027 INFO L273 TraceCheckUtils]: 107: Hoare triple {47272#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47272#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:28,027 INFO L273 TraceCheckUtils]: 108: Hoare triple {47272#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47272#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:28,028 INFO L273 TraceCheckUtils]: 109: Hoare triple {47272#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {47273#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:28,029 INFO L273 TraceCheckUtils]: 110: Hoare triple {47273#(<= main_~i~0 26)} assume true; {47273#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:28,029 INFO L273 TraceCheckUtils]: 111: Hoare triple {47273#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47273#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:28,030 INFO L273 TraceCheckUtils]: 112: Hoare triple {47273#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47273#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:28,030 INFO L273 TraceCheckUtils]: 113: Hoare triple {47273#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {47274#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:28,031 INFO L273 TraceCheckUtils]: 114: Hoare triple {47274#(<= main_~i~0 27)} assume true; {47274#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:28,031 INFO L273 TraceCheckUtils]: 115: Hoare triple {47274#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47274#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:28,032 INFO L273 TraceCheckUtils]: 116: Hoare triple {47274#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47274#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:28,033 INFO L273 TraceCheckUtils]: 117: Hoare triple {47274#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {47275#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:28,033 INFO L273 TraceCheckUtils]: 118: Hoare triple {47275#(<= main_~i~0 28)} assume true; {47275#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:28,034 INFO L273 TraceCheckUtils]: 119: Hoare triple {47275#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47275#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:28,034 INFO L273 TraceCheckUtils]: 120: Hoare triple {47275#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47275#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:28,035 INFO L273 TraceCheckUtils]: 121: Hoare triple {47275#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {47276#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:28,035 INFO L273 TraceCheckUtils]: 122: Hoare triple {47276#(<= main_~i~0 29)} assume true; {47276#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:28,036 INFO L273 TraceCheckUtils]: 123: Hoare triple {47276#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47276#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:28,036 INFO L273 TraceCheckUtils]: 124: Hoare triple {47276#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47276#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:28,037 INFO L273 TraceCheckUtils]: 125: Hoare triple {47276#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {47277#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:28,038 INFO L273 TraceCheckUtils]: 126: Hoare triple {47277#(<= main_~i~0 30)} assume true; {47277#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:28,038 INFO L273 TraceCheckUtils]: 127: Hoare triple {47277#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47277#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:28,038 INFO L273 TraceCheckUtils]: 128: Hoare triple {47277#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47277#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:28,039 INFO L273 TraceCheckUtils]: 129: Hoare triple {47277#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {47278#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:28,040 INFO L273 TraceCheckUtils]: 130: Hoare triple {47278#(<= main_~i~0 31)} assume true; {47278#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:28,040 INFO L273 TraceCheckUtils]: 131: Hoare triple {47278#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47278#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:28,041 INFO L273 TraceCheckUtils]: 132: Hoare triple {47278#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47278#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:28,041 INFO L273 TraceCheckUtils]: 133: Hoare triple {47278#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {47279#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:28,042 INFO L273 TraceCheckUtils]: 134: Hoare triple {47279#(<= main_~i~0 32)} assume true; {47279#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:28,042 INFO L273 TraceCheckUtils]: 135: Hoare triple {47279#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47279#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:28,043 INFO L273 TraceCheckUtils]: 136: Hoare triple {47279#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47279#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:28,044 INFO L273 TraceCheckUtils]: 137: Hoare triple {47279#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {47280#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:28,044 INFO L273 TraceCheckUtils]: 138: Hoare triple {47280#(<= main_~i~0 33)} assume true; {47280#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:28,045 INFO L273 TraceCheckUtils]: 139: Hoare triple {47280#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47280#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:28,045 INFO L273 TraceCheckUtils]: 140: Hoare triple {47280#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47280#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:28,046 INFO L273 TraceCheckUtils]: 141: Hoare triple {47280#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {47281#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:28,046 INFO L273 TraceCheckUtils]: 142: Hoare triple {47281#(<= main_~i~0 34)} assume true; {47281#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:28,047 INFO L273 TraceCheckUtils]: 143: Hoare triple {47281#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47281#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:28,047 INFO L273 TraceCheckUtils]: 144: Hoare triple {47281#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47281#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:28,048 INFO L273 TraceCheckUtils]: 145: Hoare triple {47281#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {47282#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:28,049 INFO L273 TraceCheckUtils]: 146: Hoare triple {47282#(<= main_~i~0 35)} assume true; {47282#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:28,049 INFO L273 TraceCheckUtils]: 147: Hoare triple {47282#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47282#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:28,050 INFO L273 TraceCheckUtils]: 148: Hoare triple {47282#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47282#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:28,050 INFO L273 TraceCheckUtils]: 149: Hoare triple {47282#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {47283#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:28,051 INFO L273 TraceCheckUtils]: 150: Hoare triple {47283#(<= main_~i~0 36)} assume true; {47283#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:28,051 INFO L273 TraceCheckUtils]: 151: Hoare triple {47283#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47283#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:28,052 INFO L273 TraceCheckUtils]: 152: Hoare triple {47283#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47283#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:28,053 INFO L273 TraceCheckUtils]: 153: Hoare triple {47283#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {47284#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:28,053 INFO L273 TraceCheckUtils]: 154: Hoare triple {47284#(<= main_~i~0 37)} assume true; {47284#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:28,054 INFO L273 TraceCheckUtils]: 155: Hoare triple {47284#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47284#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:28,054 INFO L273 TraceCheckUtils]: 156: Hoare triple {47284#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47284#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:28,055 INFO L273 TraceCheckUtils]: 157: Hoare triple {47284#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {47285#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:28,055 INFO L273 TraceCheckUtils]: 158: Hoare triple {47285#(<= main_~i~0 38)} assume true; {47285#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:28,056 INFO L273 TraceCheckUtils]: 159: Hoare triple {47285#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47285#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:28,056 INFO L273 TraceCheckUtils]: 160: Hoare triple {47285#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47285#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:28,057 INFO L273 TraceCheckUtils]: 161: Hoare triple {47285#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {47286#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:28,057 INFO L273 TraceCheckUtils]: 162: Hoare triple {47286#(<= main_~i~0 39)} assume true; {47286#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:28,058 INFO L273 TraceCheckUtils]: 163: Hoare triple {47286#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47286#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:28,058 INFO L273 TraceCheckUtils]: 164: Hoare triple {47286#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47286#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:28,059 INFO L273 TraceCheckUtils]: 165: Hoare triple {47286#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {47287#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:28,060 INFO L273 TraceCheckUtils]: 166: Hoare triple {47287#(<= main_~i~0 40)} assume true; {47287#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:28,060 INFO L273 TraceCheckUtils]: 167: Hoare triple {47287#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47287#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:28,061 INFO L273 TraceCheckUtils]: 168: Hoare triple {47287#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47287#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:28,061 INFO L273 TraceCheckUtils]: 169: Hoare triple {47287#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {47288#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:28,062 INFO L273 TraceCheckUtils]: 170: Hoare triple {47288#(<= main_~i~0 41)} assume true; {47288#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:28,062 INFO L273 TraceCheckUtils]: 171: Hoare triple {47288#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47288#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:28,063 INFO L273 TraceCheckUtils]: 172: Hoare triple {47288#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47288#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:28,064 INFO L273 TraceCheckUtils]: 173: Hoare triple {47288#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {47289#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:28,064 INFO L273 TraceCheckUtils]: 174: Hoare triple {47289#(<= main_~i~0 42)} assume true; {47289#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:28,065 INFO L273 TraceCheckUtils]: 175: Hoare triple {47289#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47289#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:28,065 INFO L273 TraceCheckUtils]: 176: Hoare triple {47289#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47289#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:28,066 INFO L273 TraceCheckUtils]: 177: Hoare triple {47289#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {47290#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:28,066 INFO L273 TraceCheckUtils]: 178: Hoare triple {47290#(<= main_~i~0 43)} assume true; {47290#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:28,067 INFO L273 TraceCheckUtils]: 179: Hoare triple {47290#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47290#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:28,067 INFO L273 TraceCheckUtils]: 180: Hoare triple {47290#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47290#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:28,068 INFO L273 TraceCheckUtils]: 181: Hoare triple {47290#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {47291#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:28,068 INFO L273 TraceCheckUtils]: 182: Hoare triple {47291#(<= main_~i~0 44)} assume true; {47291#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:28,069 INFO L273 TraceCheckUtils]: 183: Hoare triple {47291#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47291#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:28,069 INFO L273 TraceCheckUtils]: 184: Hoare triple {47291#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47291#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:28,070 INFO L273 TraceCheckUtils]: 185: Hoare triple {47291#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {47292#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:28,071 INFO L273 TraceCheckUtils]: 186: Hoare triple {47292#(<= main_~i~0 45)} assume true; {47292#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:28,071 INFO L273 TraceCheckUtils]: 187: Hoare triple {47292#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47292#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:28,072 INFO L273 TraceCheckUtils]: 188: Hoare triple {47292#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47292#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:28,072 INFO L273 TraceCheckUtils]: 189: Hoare triple {47292#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {47293#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:28,073 INFO L273 TraceCheckUtils]: 190: Hoare triple {47293#(<= main_~i~0 46)} assume true; {47293#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:28,073 INFO L273 TraceCheckUtils]: 191: Hoare triple {47293#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47293#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:28,074 INFO L273 TraceCheckUtils]: 192: Hoare triple {47293#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47293#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:28,074 INFO L273 TraceCheckUtils]: 193: Hoare triple {47293#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {47294#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:28,075 INFO L273 TraceCheckUtils]: 194: Hoare triple {47294#(<= main_~i~0 47)} assume true; {47294#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:28,075 INFO L273 TraceCheckUtils]: 195: Hoare triple {47294#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47294#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:28,076 INFO L273 TraceCheckUtils]: 196: Hoare triple {47294#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47294#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:28,077 INFO L273 TraceCheckUtils]: 197: Hoare triple {47294#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {47295#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:28,077 INFO L273 TraceCheckUtils]: 198: Hoare triple {47295#(<= main_~i~0 48)} assume true; {47295#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:28,078 INFO L273 TraceCheckUtils]: 199: Hoare triple {47295#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47295#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:28,078 INFO L273 TraceCheckUtils]: 200: Hoare triple {47295#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47295#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:28,079 INFO L273 TraceCheckUtils]: 201: Hoare triple {47295#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {47296#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:28,079 INFO L273 TraceCheckUtils]: 202: Hoare triple {47296#(<= main_~i~0 49)} assume true; {47296#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:28,080 INFO L273 TraceCheckUtils]: 203: Hoare triple {47296#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47296#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:28,080 INFO L273 TraceCheckUtils]: 204: Hoare triple {47296#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47296#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:28,081 INFO L273 TraceCheckUtils]: 205: Hoare triple {47296#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {47297#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:28,082 INFO L273 TraceCheckUtils]: 206: Hoare triple {47297#(<= main_~i~0 50)} assume true; {47297#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:28,082 INFO L273 TraceCheckUtils]: 207: Hoare triple {47297#(<= main_~i~0 50)} assume !(~i~0 < 100000); {47246#false} is VALID [2018-11-18 22:58:28,082 INFO L273 TraceCheckUtils]: 208: Hoare triple {47246#false} havoc ~x~0;~x~0 := 0; {47246#false} is VALID [2018-11-18 22:58:28,083 INFO L273 TraceCheckUtils]: 209: Hoare triple {47246#false} assume true; {47246#false} is VALID [2018-11-18 22:58:28,083 INFO L273 TraceCheckUtils]: 210: Hoare triple {47246#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {47246#false} is VALID [2018-11-18 22:58:28,083 INFO L256 TraceCheckUtils]: 211: Hoare triple {47246#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {47246#false} is VALID [2018-11-18 22:58:28,083 INFO L273 TraceCheckUtils]: 212: Hoare triple {47246#false} ~cond := #in~cond; {47246#false} is VALID [2018-11-18 22:58:28,083 INFO L273 TraceCheckUtils]: 213: Hoare triple {47246#false} assume 0 == ~cond; {47246#false} is VALID [2018-11-18 22:58:28,084 INFO L273 TraceCheckUtils]: 214: Hoare triple {47246#false} assume !false; {47246#false} is VALID [2018-11-18 22:58:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:28,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:28,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2018-11-18 22:58:28,137 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 215 [2018-11-18 22:58:28,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:28,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-18 22:58:28,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:28,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-18 22:58:28,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-18 22:58:28,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-18 22:58:28,341 INFO L87 Difference]: Start difference. First operand 220 states and 271 transitions. Second operand 54 states. [2018-11-18 22:58:29,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:29,563 INFO L93 Difference]: Finished difference Result 238 states and 292 transitions. [2018-11-18 22:58:29,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-18 22:58:29,563 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 215 [2018-11-18 22:58:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 22:58:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 292 transitions. [2018-11-18 22:58:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 22:58:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 292 transitions. [2018-11-18 22:58:29,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 292 transitions. [2018-11-18 22:58:29,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:29,838 INFO L225 Difference]: With dead ends: 238 [2018-11-18 22:58:29,838 INFO L226 Difference]: Without dead ends: 226 [2018-11-18 22:58:29,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-18 22:58:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-18 22:58:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-11-18 22:58:29,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:29,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand 224 states. [2018-11-18 22:58:29,920 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 224 states. [2018-11-18 22:58:29,920 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 224 states. [2018-11-18 22:58:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:29,924 INFO L93 Difference]: Finished difference Result 226 states and 279 transitions. [2018-11-18 22:58:29,924 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 279 transitions. [2018-11-18 22:58:29,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:29,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:29,925 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand 226 states. [2018-11-18 22:58:29,925 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 226 states. [2018-11-18 22:58:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:29,928 INFO L93 Difference]: Finished difference Result 226 states and 279 transitions. [2018-11-18 22:58:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 279 transitions. [2018-11-18 22:58:29,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:29,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:29,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:29,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-18 22:58:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 276 transitions. [2018-11-18 22:58:29,932 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 276 transitions. Word has length 215 [2018-11-18 22:58:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:29,932 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 276 transitions. [2018-11-18 22:58:29,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-18 22:58:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 276 transitions. [2018-11-18 22:58:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 22:58:29,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:29,934 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:29,934 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:29,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:29,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1728656548, now seen corresponding path program 51 times [2018-11-18 22:58:29,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:29,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:29,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:29,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:29,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:31,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {48978#true} call ULTIMATE.init(); {48978#true} is VALID [2018-11-18 22:58:31,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {48978#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48978#true} is VALID [2018-11-18 22:58:31,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {48978#true} assume true; {48978#true} is VALID [2018-11-18 22:58:31,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48978#true} {48978#true} #57#return; {48978#true} is VALID [2018-11-18 22:58:31,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {48978#true} call #t~ret4 := main(); {48978#true} is VALID [2018-11-18 22:58:31,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {48978#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {48980#(= main_~i~0 0)} is VALID [2018-11-18 22:58:31,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {48980#(= main_~i~0 0)} assume true; {48980#(= main_~i~0 0)} is VALID [2018-11-18 22:58:31,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {48980#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48980#(= main_~i~0 0)} is VALID [2018-11-18 22:58:31,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {48980#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48980#(= main_~i~0 0)} is VALID [2018-11-18 22:58:31,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {48980#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {48981#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:31,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {48981#(<= main_~i~0 1)} assume true; {48981#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:31,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {48981#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48981#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:31,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {48981#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48981#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:31,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {48981#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {48982#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:31,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {48982#(<= main_~i~0 2)} assume true; {48982#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:31,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {48982#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48982#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:31,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {48982#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48982#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:31,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {48982#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {48983#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:31,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {48983#(<= main_~i~0 3)} assume true; {48983#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:31,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {48983#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48983#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:31,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {48983#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48983#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:31,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {48983#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {48984#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:31,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {48984#(<= main_~i~0 4)} assume true; {48984#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:31,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {48984#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48984#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:31,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {48984#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48984#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:31,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {48984#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {48985#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:31,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {48985#(<= main_~i~0 5)} assume true; {48985#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:31,241 INFO L273 TraceCheckUtils]: 27: Hoare triple {48985#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48985#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:31,242 INFO L273 TraceCheckUtils]: 28: Hoare triple {48985#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48985#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:31,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {48985#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {48986#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:31,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {48986#(<= main_~i~0 6)} assume true; {48986#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:31,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {48986#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48986#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:31,244 INFO L273 TraceCheckUtils]: 32: Hoare triple {48986#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48986#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:31,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {48986#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {48987#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:31,245 INFO L273 TraceCheckUtils]: 34: Hoare triple {48987#(<= main_~i~0 7)} assume true; {48987#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:31,246 INFO L273 TraceCheckUtils]: 35: Hoare triple {48987#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48987#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:31,246 INFO L273 TraceCheckUtils]: 36: Hoare triple {48987#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48987#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:31,247 INFO L273 TraceCheckUtils]: 37: Hoare triple {48987#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {48988#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:31,247 INFO L273 TraceCheckUtils]: 38: Hoare triple {48988#(<= main_~i~0 8)} assume true; {48988#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:31,248 INFO L273 TraceCheckUtils]: 39: Hoare triple {48988#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48988#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:31,248 INFO L273 TraceCheckUtils]: 40: Hoare triple {48988#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48988#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:31,249 INFO L273 TraceCheckUtils]: 41: Hoare triple {48988#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {48989#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:31,250 INFO L273 TraceCheckUtils]: 42: Hoare triple {48989#(<= main_~i~0 9)} assume true; {48989#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:31,250 INFO L273 TraceCheckUtils]: 43: Hoare triple {48989#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48989#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:31,251 INFO L273 TraceCheckUtils]: 44: Hoare triple {48989#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48989#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:31,251 INFO L273 TraceCheckUtils]: 45: Hoare triple {48989#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {48990#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:31,252 INFO L273 TraceCheckUtils]: 46: Hoare triple {48990#(<= main_~i~0 10)} assume true; {48990#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:31,252 INFO L273 TraceCheckUtils]: 47: Hoare triple {48990#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48990#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:31,253 INFO L273 TraceCheckUtils]: 48: Hoare triple {48990#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48990#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:31,253 INFO L273 TraceCheckUtils]: 49: Hoare triple {48990#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {48991#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:31,254 INFO L273 TraceCheckUtils]: 50: Hoare triple {48991#(<= main_~i~0 11)} assume true; {48991#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:31,254 INFO L273 TraceCheckUtils]: 51: Hoare triple {48991#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48991#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:31,255 INFO L273 TraceCheckUtils]: 52: Hoare triple {48991#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48991#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:31,256 INFO L273 TraceCheckUtils]: 53: Hoare triple {48991#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {48992#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:31,256 INFO L273 TraceCheckUtils]: 54: Hoare triple {48992#(<= main_~i~0 12)} assume true; {48992#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:31,257 INFO L273 TraceCheckUtils]: 55: Hoare triple {48992#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48992#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:31,257 INFO L273 TraceCheckUtils]: 56: Hoare triple {48992#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48992#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:31,258 INFO L273 TraceCheckUtils]: 57: Hoare triple {48992#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {48993#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:31,258 INFO L273 TraceCheckUtils]: 58: Hoare triple {48993#(<= main_~i~0 13)} assume true; {48993#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:31,259 INFO L273 TraceCheckUtils]: 59: Hoare triple {48993#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48993#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:31,259 INFO L273 TraceCheckUtils]: 60: Hoare triple {48993#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48993#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:31,260 INFO L273 TraceCheckUtils]: 61: Hoare triple {48993#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {48994#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:31,261 INFO L273 TraceCheckUtils]: 62: Hoare triple {48994#(<= main_~i~0 14)} assume true; {48994#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:31,261 INFO L273 TraceCheckUtils]: 63: Hoare triple {48994#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48994#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:31,262 INFO L273 TraceCheckUtils]: 64: Hoare triple {48994#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48994#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:31,262 INFO L273 TraceCheckUtils]: 65: Hoare triple {48994#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {48995#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:31,263 INFO L273 TraceCheckUtils]: 66: Hoare triple {48995#(<= main_~i~0 15)} assume true; {48995#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:31,263 INFO L273 TraceCheckUtils]: 67: Hoare triple {48995#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48995#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:31,264 INFO L273 TraceCheckUtils]: 68: Hoare triple {48995#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48995#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:31,264 INFO L273 TraceCheckUtils]: 69: Hoare triple {48995#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {48996#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:31,265 INFO L273 TraceCheckUtils]: 70: Hoare triple {48996#(<= main_~i~0 16)} assume true; {48996#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:31,265 INFO L273 TraceCheckUtils]: 71: Hoare triple {48996#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48996#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:31,266 INFO L273 TraceCheckUtils]: 72: Hoare triple {48996#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48996#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:31,267 INFO L273 TraceCheckUtils]: 73: Hoare triple {48996#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {48997#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:31,267 INFO L273 TraceCheckUtils]: 74: Hoare triple {48997#(<= main_~i~0 17)} assume true; {48997#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:31,268 INFO L273 TraceCheckUtils]: 75: Hoare triple {48997#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48997#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:31,268 INFO L273 TraceCheckUtils]: 76: Hoare triple {48997#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48997#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:31,269 INFO L273 TraceCheckUtils]: 77: Hoare triple {48997#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {48998#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:31,269 INFO L273 TraceCheckUtils]: 78: Hoare triple {48998#(<= main_~i~0 18)} assume true; {48998#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:31,270 INFO L273 TraceCheckUtils]: 79: Hoare triple {48998#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48998#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:31,270 INFO L273 TraceCheckUtils]: 80: Hoare triple {48998#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48998#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:31,271 INFO L273 TraceCheckUtils]: 81: Hoare triple {48998#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {48999#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:31,272 INFO L273 TraceCheckUtils]: 82: Hoare triple {48999#(<= main_~i~0 19)} assume true; {48999#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:31,272 INFO L273 TraceCheckUtils]: 83: Hoare triple {48999#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48999#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:31,273 INFO L273 TraceCheckUtils]: 84: Hoare triple {48999#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48999#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:31,273 INFO L273 TraceCheckUtils]: 85: Hoare triple {48999#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {49000#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:31,274 INFO L273 TraceCheckUtils]: 86: Hoare triple {49000#(<= main_~i~0 20)} assume true; {49000#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:31,274 INFO L273 TraceCheckUtils]: 87: Hoare triple {49000#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49000#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:31,275 INFO L273 TraceCheckUtils]: 88: Hoare triple {49000#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49000#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:31,275 INFO L273 TraceCheckUtils]: 89: Hoare triple {49000#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {49001#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:31,276 INFO L273 TraceCheckUtils]: 90: Hoare triple {49001#(<= main_~i~0 21)} assume true; {49001#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:31,276 INFO L273 TraceCheckUtils]: 91: Hoare triple {49001#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49001#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:31,277 INFO L273 TraceCheckUtils]: 92: Hoare triple {49001#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49001#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:31,278 INFO L273 TraceCheckUtils]: 93: Hoare triple {49001#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {49002#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:31,278 INFO L273 TraceCheckUtils]: 94: Hoare triple {49002#(<= main_~i~0 22)} assume true; {49002#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:31,279 INFO L273 TraceCheckUtils]: 95: Hoare triple {49002#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49002#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:31,279 INFO L273 TraceCheckUtils]: 96: Hoare triple {49002#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49002#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:31,280 INFO L273 TraceCheckUtils]: 97: Hoare triple {49002#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {49003#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:31,280 INFO L273 TraceCheckUtils]: 98: Hoare triple {49003#(<= main_~i~0 23)} assume true; {49003#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:31,281 INFO L273 TraceCheckUtils]: 99: Hoare triple {49003#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49003#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:31,281 INFO L273 TraceCheckUtils]: 100: Hoare triple {49003#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49003#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:31,282 INFO L273 TraceCheckUtils]: 101: Hoare triple {49003#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {49004#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:31,283 INFO L273 TraceCheckUtils]: 102: Hoare triple {49004#(<= main_~i~0 24)} assume true; {49004#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:31,283 INFO L273 TraceCheckUtils]: 103: Hoare triple {49004#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49004#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:31,284 INFO L273 TraceCheckUtils]: 104: Hoare triple {49004#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49004#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:31,284 INFO L273 TraceCheckUtils]: 105: Hoare triple {49004#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {49005#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:31,285 INFO L273 TraceCheckUtils]: 106: Hoare triple {49005#(<= main_~i~0 25)} assume true; {49005#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:31,285 INFO L273 TraceCheckUtils]: 107: Hoare triple {49005#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49005#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:31,286 INFO L273 TraceCheckUtils]: 108: Hoare triple {49005#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49005#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:31,287 INFO L273 TraceCheckUtils]: 109: Hoare triple {49005#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {49006#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:31,287 INFO L273 TraceCheckUtils]: 110: Hoare triple {49006#(<= main_~i~0 26)} assume true; {49006#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:31,288 INFO L273 TraceCheckUtils]: 111: Hoare triple {49006#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49006#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:31,288 INFO L273 TraceCheckUtils]: 112: Hoare triple {49006#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49006#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:31,289 INFO L273 TraceCheckUtils]: 113: Hoare triple {49006#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {49007#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:31,289 INFO L273 TraceCheckUtils]: 114: Hoare triple {49007#(<= main_~i~0 27)} assume true; {49007#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:31,290 INFO L273 TraceCheckUtils]: 115: Hoare triple {49007#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49007#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:31,290 INFO L273 TraceCheckUtils]: 116: Hoare triple {49007#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49007#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:31,291 INFO L273 TraceCheckUtils]: 117: Hoare triple {49007#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {49008#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:31,291 INFO L273 TraceCheckUtils]: 118: Hoare triple {49008#(<= main_~i~0 28)} assume true; {49008#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:31,292 INFO L273 TraceCheckUtils]: 119: Hoare triple {49008#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49008#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:31,292 INFO L273 TraceCheckUtils]: 120: Hoare triple {49008#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49008#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:31,293 INFO L273 TraceCheckUtils]: 121: Hoare triple {49008#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {49009#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:31,294 INFO L273 TraceCheckUtils]: 122: Hoare triple {49009#(<= main_~i~0 29)} assume true; {49009#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:31,294 INFO L273 TraceCheckUtils]: 123: Hoare triple {49009#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49009#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:31,295 INFO L273 TraceCheckUtils]: 124: Hoare triple {49009#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49009#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:31,295 INFO L273 TraceCheckUtils]: 125: Hoare triple {49009#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {49010#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:31,296 INFO L273 TraceCheckUtils]: 126: Hoare triple {49010#(<= main_~i~0 30)} assume true; {49010#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:31,296 INFO L273 TraceCheckUtils]: 127: Hoare triple {49010#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49010#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:31,297 INFO L273 TraceCheckUtils]: 128: Hoare triple {49010#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49010#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:31,298 INFO L273 TraceCheckUtils]: 129: Hoare triple {49010#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {49011#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:31,298 INFO L273 TraceCheckUtils]: 130: Hoare triple {49011#(<= main_~i~0 31)} assume true; {49011#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:31,299 INFO L273 TraceCheckUtils]: 131: Hoare triple {49011#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49011#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:31,299 INFO L273 TraceCheckUtils]: 132: Hoare triple {49011#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49011#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:31,300 INFO L273 TraceCheckUtils]: 133: Hoare triple {49011#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {49012#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:31,300 INFO L273 TraceCheckUtils]: 134: Hoare triple {49012#(<= main_~i~0 32)} assume true; {49012#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:31,301 INFO L273 TraceCheckUtils]: 135: Hoare triple {49012#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49012#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:31,301 INFO L273 TraceCheckUtils]: 136: Hoare triple {49012#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49012#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:31,302 INFO L273 TraceCheckUtils]: 137: Hoare triple {49012#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {49013#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:31,302 INFO L273 TraceCheckUtils]: 138: Hoare triple {49013#(<= main_~i~0 33)} assume true; {49013#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:31,303 INFO L273 TraceCheckUtils]: 139: Hoare triple {49013#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49013#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:31,303 INFO L273 TraceCheckUtils]: 140: Hoare triple {49013#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49013#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:31,304 INFO L273 TraceCheckUtils]: 141: Hoare triple {49013#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {49014#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:31,305 INFO L273 TraceCheckUtils]: 142: Hoare triple {49014#(<= main_~i~0 34)} assume true; {49014#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:31,305 INFO L273 TraceCheckUtils]: 143: Hoare triple {49014#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49014#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:31,306 INFO L273 TraceCheckUtils]: 144: Hoare triple {49014#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49014#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:31,306 INFO L273 TraceCheckUtils]: 145: Hoare triple {49014#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {49015#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:31,307 INFO L273 TraceCheckUtils]: 146: Hoare triple {49015#(<= main_~i~0 35)} assume true; {49015#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:31,307 INFO L273 TraceCheckUtils]: 147: Hoare triple {49015#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49015#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:31,308 INFO L273 TraceCheckUtils]: 148: Hoare triple {49015#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49015#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:31,309 INFO L273 TraceCheckUtils]: 149: Hoare triple {49015#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {49016#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:31,309 INFO L273 TraceCheckUtils]: 150: Hoare triple {49016#(<= main_~i~0 36)} assume true; {49016#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:31,309 INFO L273 TraceCheckUtils]: 151: Hoare triple {49016#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49016#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:31,310 INFO L273 TraceCheckUtils]: 152: Hoare triple {49016#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49016#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:31,311 INFO L273 TraceCheckUtils]: 153: Hoare triple {49016#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {49017#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:31,311 INFO L273 TraceCheckUtils]: 154: Hoare triple {49017#(<= main_~i~0 37)} assume true; {49017#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:31,312 INFO L273 TraceCheckUtils]: 155: Hoare triple {49017#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49017#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:31,312 INFO L273 TraceCheckUtils]: 156: Hoare triple {49017#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49017#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:31,313 INFO L273 TraceCheckUtils]: 157: Hoare triple {49017#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {49018#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:31,313 INFO L273 TraceCheckUtils]: 158: Hoare triple {49018#(<= main_~i~0 38)} assume true; {49018#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:31,314 INFO L273 TraceCheckUtils]: 159: Hoare triple {49018#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49018#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:31,314 INFO L273 TraceCheckUtils]: 160: Hoare triple {49018#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49018#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:31,315 INFO L273 TraceCheckUtils]: 161: Hoare triple {49018#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {49019#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:31,316 INFO L273 TraceCheckUtils]: 162: Hoare triple {49019#(<= main_~i~0 39)} assume true; {49019#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:31,316 INFO L273 TraceCheckUtils]: 163: Hoare triple {49019#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49019#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:31,317 INFO L273 TraceCheckUtils]: 164: Hoare triple {49019#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49019#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:31,317 INFO L273 TraceCheckUtils]: 165: Hoare triple {49019#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {49020#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:31,318 INFO L273 TraceCheckUtils]: 166: Hoare triple {49020#(<= main_~i~0 40)} assume true; {49020#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:31,318 INFO L273 TraceCheckUtils]: 167: Hoare triple {49020#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49020#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:31,319 INFO L273 TraceCheckUtils]: 168: Hoare triple {49020#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49020#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:31,320 INFO L273 TraceCheckUtils]: 169: Hoare triple {49020#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {49021#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:31,320 INFO L273 TraceCheckUtils]: 170: Hoare triple {49021#(<= main_~i~0 41)} assume true; {49021#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:31,321 INFO L273 TraceCheckUtils]: 171: Hoare triple {49021#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49021#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:31,321 INFO L273 TraceCheckUtils]: 172: Hoare triple {49021#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49021#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:31,322 INFO L273 TraceCheckUtils]: 173: Hoare triple {49021#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {49022#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:31,322 INFO L273 TraceCheckUtils]: 174: Hoare triple {49022#(<= main_~i~0 42)} assume true; {49022#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:31,323 INFO L273 TraceCheckUtils]: 175: Hoare triple {49022#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49022#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:31,323 INFO L273 TraceCheckUtils]: 176: Hoare triple {49022#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49022#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:31,324 INFO L273 TraceCheckUtils]: 177: Hoare triple {49022#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {49023#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:31,324 INFO L273 TraceCheckUtils]: 178: Hoare triple {49023#(<= main_~i~0 43)} assume true; {49023#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:31,325 INFO L273 TraceCheckUtils]: 179: Hoare triple {49023#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49023#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:31,325 INFO L273 TraceCheckUtils]: 180: Hoare triple {49023#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49023#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:31,326 INFO L273 TraceCheckUtils]: 181: Hoare triple {49023#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {49024#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:31,327 INFO L273 TraceCheckUtils]: 182: Hoare triple {49024#(<= main_~i~0 44)} assume true; {49024#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:31,327 INFO L273 TraceCheckUtils]: 183: Hoare triple {49024#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49024#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:31,328 INFO L273 TraceCheckUtils]: 184: Hoare triple {49024#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49024#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:31,328 INFO L273 TraceCheckUtils]: 185: Hoare triple {49024#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {49025#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:31,329 INFO L273 TraceCheckUtils]: 186: Hoare triple {49025#(<= main_~i~0 45)} assume true; {49025#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:31,329 INFO L273 TraceCheckUtils]: 187: Hoare triple {49025#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49025#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:31,330 INFO L273 TraceCheckUtils]: 188: Hoare triple {49025#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49025#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:31,331 INFO L273 TraceCheckUtils]: 189: Hoare triple {49025#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {49026#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:31,331 INFO L273 TraceCheckUtils]: 190: Hoare triple {49026#(<= main_~i~0 46)} assume true; {49026#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:31,332 INFO L273 TraceCheckUtils]: 191: Hoare triple {49026#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49026#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:31,332 INFO L273 TraceCheckUtils]: 192: Hoare triple {49026#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49026#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:31,333 INFO L273 TraceCheckUtils]: 193: Hoare triple {49026#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {49027#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:31,333 INFO L273 TraceCheckUtils]: 194: Hoare triple {49027#(<= main_~i~0 47)} assume true; {49027#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:31,334 INFO L273 TraceCheckUtils]: 195: Hoare triple {49027#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49027#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:31,334 INFO L273 TraceCheckUtils]: 196: Hoare triple {49027#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49027#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:31,335 INFO L273 TraceCheckUtils]: 197: Hoare triple {49027#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {49028#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:31,335 INFO L273 TraceCheckUtils]: 198: Hoare triple {49028#(<= main_~i~0 48)} assume true; {49028#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:31,336 INFO L273 TraceCheckUtils]: 199: Hoare triple {49028#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49028#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:31,336 INFO L273 TraceCheckUtils]: 200: Hoare triple {49028#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49028#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:31,337 INFO L273 TraceCheckUtils]: 201: Hoare triple {49028#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {49029#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:31,338 INFO L273 TraceCheckUtils]: 202: Hoare triple {49029#(<= main_~i~0 49)} assume true; {49029#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:31,338 INFO L273 TraceCheckUtils]: 203: Hoare triple {49029#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49029#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:31,339 INFO L273 TraceCheckUtils]: 204: Hoare triple {49029#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49029#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:31,339 INFO L273 TraceCheckUtils]: 205: Hoare triple {49029#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {49030#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:31,340 INFO L273 TraceCheckUtils]: 206: Hoare triple {49030#(<= main_~i~0 50)} assume true; {49030#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:31,340 INFO L273 TraceCheckUtils]: 207: Hoare triple {49030#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49030#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:31,341 INFO L273 TraceCheckUtils]: 208: Hoare triple {49030#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49030#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:31,342 INFO L273 TraceCheckUtils]: 209: Hoare triple {49030#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {49031#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:31,342 INFO L273 TraceCheckUtils]: 210: Hoare triple {49031#(<= main_~i~0 51)} assume true; {49031#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:31,343 INFO L273 TraceCheckUtils]: 211: Hoare triple {49031#(<= main_~i~0 51)} assume !(~i~0 < 100000); {48979#false} is VALID [2018-11-18 22:58:31,343 INFO L273 TraceCheckUtils]: 212: Hoare triple {48979#false} havoc ~x~0;~x~0 := 0; {48979#false} is VALID [2018-11-18 22:58:31,343 INFO L273 TraceCheckUtils]: 213: Hoare triple {48979#false} assume true; {48979#false} is VALID [2018-11-18 22:58:31,343 INFO L273 TraceCheckUtils]: 214: Hoare triple {48979#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {48979#false} is VALID [2018-11-18 22:58:31,344 INFO L256 TraceCheckUtils]: 215: Hoare triple {48979#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {48979#false} is VALID [2018-11-18 22:58:31,344 INFO L273 TraceCheckUtils]: 216: Hoare triple {48979#false} ~cond := #in~cond; {48979#false} is VALID [2018-11-18 22:58:31,344 INFO L273 TraceCheckUtils]: 217: Hoare triple {48979#false} assume 0 == ~cond; {48979#false} is VALID [2018-11-18 22:58:31,344 INFO L273 TraceCheckUtils]: 218: Hoare triple {48979#false} assume !false; {48979#false} is VALID [2018-11-18 22:58:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:31,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:31,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:31,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:58:31,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-11-18 22:58:31,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:31,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:32,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {48978#true} call ULTIMATE.init(); {48978#true} is VALID [2018-11-18 22:58:32,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {48978#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48978#true} is VALID [2018-11-18 22:58:32,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {48978#true} assume true; {48978#true} is VALID [2018-11-18 22:58:32,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48978#true} {48978#true} #57#return; {48978#true} is VALID [2018-11-18 22:58:32,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {48978#true} call #t~ret4 := main(); {48978#true} is VALID [2018-11-18 22:58:32,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {48978#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {49050#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:32,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {49050#(<= main_~i~0 0)} assume true; {49050#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:32,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {49050#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49050#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:32,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {49050#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49050#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:32,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {49050#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {48981#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:32,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {48981#(<= main_~i~0 1)} assume true; {48981#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:32,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {48981#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48981#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:32,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {48981#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48981#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:32,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {48981#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {48982#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:32,240 INFO L273 TraceCheckUtils]: 14: Hoare triple {48982#(<= main_~i~0 2)} assume true; {48982#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:32,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {48982#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48982#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:32,241 INFO L273 TraceCheckUtils]: 16: Hoare triple {48982#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48982#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:32,241 INFO L273 TraceCheckUtils]: 17: Hoare triple {48982#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {48983#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:32,242 INFO L273 TraceCheckUtils]: 18: Hoare triple {48983#(<= main_~i~0 3)} assume true; {48983#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:32,242 INFO L273 TraceCheckUtils]: 19: Hoare triple {48983#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48983#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:32,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {48983#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48983#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:32,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {48983#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {48984#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:32,244 INFO L273 TraceCheckUtils]: 22: Hoare triple {48984#(<= main_~i~0 4)} assume true; {48984#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:32,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {48984#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48984#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:32,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {48984#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48984#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:32,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {48984#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {48985#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:32,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {48985#(<= main_~i~0 5)} assume true; {48985#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:32,247 INFO L273 TraceCheckUtils]: 27: Hoare triple {48985#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48985#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:32,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {48985#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48985#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:32,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {48985#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {48986#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:32,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {48986#(<= main_~i~0 6)} assume true; {48986#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:32,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {48986#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48986#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:32,249 INFO L273 TraceCheckUtils]: 32: Hoare triple {48986#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48986#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:32,250 INFO L273 TraceCheckUtils]: 33: Hoare triple {48986#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {48987#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:32,251 INFO L273 TraceCheckUtils]: 34: Hoare triple {48987#(<= main_~i~0 7)} assume true; {48987#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:32,251 INFO L273 TraceCheckUtils]: 35: Hoare triple {48987#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48987#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:32,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {48987#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48987#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:32,252 INFO L273 TraceCheckUtils]: 37: Hoare triple {48987#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {48988#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:32,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {48988#(<= main_~i~0 8)} assume true; {48988#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:32,253 INFO L273 TraceCheckUtils]: 39: Hoare triple {48988#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48988#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:32,254 INFO L273 TraceCheckUtils]: 40: Hoare triple {48988#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48988#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:32,255 INFO L273 TraceCheckUtils]: 41: Hoare triple {48988#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {48989#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:32,255 INFO L273 TraceCheckUtils]: 42: Hoare triple {48989#(<= main_~i~0 9)} assume true; {48989#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:32,256 INFO L273 TraceCheckUtils]: 43: Hoare triple {48989#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48989#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:32,256 INFO L273 TraceCheckUtils]: 44: Hoare triple {48989#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48989#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:32,257 INFO L273 TraceCheckUtils]: 45: Hoare triple {48989#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {48990#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:32,257 INFO L273 TraceCheckUtils]: 46: Hoare triple {48990#(<= main_~i~0 10)} assume true; {48990#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:32,258 INFO L273 TraceCheckUtils]: 47: Hoare triple {48990#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48990#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:32,258 INFO L273 TraceCheckUtils]: 48: Hoare triple {48990#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48990#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:32,259 INFO L273 TraceCheckUtils]: 49: Hoare triple {48990#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {48991#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:32,260 INFO L273 TraceCheckUtils]: 50: Hoare triple {48991#(<= main_~i~0 11)} assume true; {48991#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:32,260 INFO L273 TraceCheckUtils]: 51: Hoare triple {48991#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48991#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:32,261 INFO L273 TraceCheckUtils]: 52: Hoare triple {48991#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48991#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:32,261 INFO L273 TraceCheckUtils]: 53: Hoare triple {48991#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {48992#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:32,262 INFO L273 TraceCheckUtils]: 54: Hoare triple {48992#(<= main_~i~0 12)} assume true; {48992#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:32,262 INFO L273 TraceCheckUtils]: 55: Hoare triple {48992#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48992#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:32,263 INFO L273 TraceCheckUtils]: 56: Hoare triple {48992#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48992#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:32,263 INFO L273 TraceCheckUtils]: 57: Hoare triple {48992#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {48993#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:32,264 INFO L273 TraceCheckUtils]: 58: Hoare triple {48993#(<= main_~i~0 13)} assume true; {48993#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:32,264 INFO L273 TraceCheckUtils]: 59: Hoare triple {48993#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48993#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:32,265 INFO L273 TraceCheckUtils]: 60: Hoare triple {48993#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48993#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:32,266 INFO L273 TraceCheckUtils]: 61: Hoare triple {48993#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {48994#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:32,266 INFO L273 TraceCheckUtils]: 62: Hoare triple {48994#(<= main_~i~0 14)} assume true; {48994#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:32,267 INFO L273 TraceCheckUtils]: 63: Hoare triple {48994#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48994#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:32,267 INFO L273 TraceCheckUtils]: 64: Hoare triple {48994#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48994#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:32,268 INFO L273 TraceCheckUtils]: 65: Hoare triple {48994#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {48995#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:32,268 INFO L273 TraceCheckUtils]: 66: Hoare triple {48995#(<= main_~i~0 15)} assume true; {48995#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:32,269 INFO L273 TraceCheckUtils]: 67: Hoare triple {48995#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48995#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:32,269 INFO L273 TraceCheckUtils]: 68: Hoare triple {48995#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48995#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:32,270 INFO L273 TraceCheckUtils]: 69: Hoare triple {48995#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {48996#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:32,271 INFO L273 TraceCheckUtils]: 70: Hoare triple {48996#(<= main_~i~0 16)} assume true; {48996#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:32,271 INFO L273 TraceCheckUtils]: 71: Hoare triple {48996#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48996#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:32,272 INFO L273 TraceCheckUtils]: 72: Hoare triple {48996#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48996#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:32,272 INFO L273 TraceCheckUtils]: 73: Hoare triple {48996#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {48997#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:32,273 INFO L273 TraceCheckUtils]: 74: Hoare triple {48997#(<= main_~i~0 17)} assume true; {48997#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:32,273 INFO L273 TraceCheckUtils]: 75: Hoare triple {48997#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48997#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:32,274 INFO L273 TraceCheckUtils]: 76: Hoare triple {48997#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48997#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:32,275 INFO L273 TraceCheckUtils]: 77: Hoare triple {48997#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {48998#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:32,275 INFO L273 TraceCheckUtils]: 78: Hoare triple {48998#(<= main_~i~0 18)} assume true; {48998#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:32,276 INFO L273 TraceCheckUtils]: 79: Hoare triple {48998#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48998#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:32,276 INFO L273 TraceCheckUtils]: 80: Hoare triple {48998#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48998#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:32,277 INFO L273 TraceCheckUtils]: 81: Hoare triple {48998#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {48999#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:32,277 INFO L273 TraceCheckUtils]: 82: Hoare triple {48999#(<= main_~i~0 19)} assume true; {48999#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:32,278 INFO L273 TraceCheckUtils]: 83: Hoare triple {48999#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48999#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:32,278 INFO L273 TraceCheckUtils]: 84: Hoare triple {48999#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {48999#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:32,279 INFO L273 TraceCheckUtils]: 85: Hoare triple {48999#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {49000#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:32,280 INFO L273 TraceCheckUtils]: 86: Hoare triple {49000#(<= main_~i~0 20)} assume true; {49000#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:32,280 INFO L273 TraceCheckUtils]: 87: Hoare triple {49000#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49000#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:32,281 INFO L273 TraceCheckUtils]: 88: Hoare triple {49000#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49000#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:32,281 INFO L273 TraceCheckUtils]: 89: Hoare triple {49000#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {49001#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:32,282 INFO L273 TraceCheckUtils]: 90: Hoare triple {49001#(<= main_~i~0 21)} assume true; {49001#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:32,282 INFO L273 TraceCheckUtils]: 91: Hoare triple {49001#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49001#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:32,283 INFO L273 TraceCheckUtils]: 92: Hoare triple {49001#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49001#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:32,284 INFO L273 TraceCheckUtils]: 93: Hoare triple {49001#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {49002#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:32,284 INFO L273 TraceCheckUtils]: 94: Hoare triple {49002#(<= main_~i~0 22)} assume true; {49002#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:32,285 INFO L273 TraceCheckUtils]: 95: Hoare triple {49002#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49002#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:32,285 INFO L273 TraceCheckUtils]: 96: Hoare triple {49002#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49002#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:32,286 INFO L273 TraceCheckUtils]: 97: Hoare triple {49002#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {49003#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:32,286 INFO L273 TraceCheckUtils]: 98: Hoare triple {49003#(<= main_~i~0 23)} assume true; {49003#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:32,287 INFO L273 TraceCheckUtils]: 99: Hoare triple {49003#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49003#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:32,287 INFO L273 TraceCheckUtils]: 100: Hoare triple {49003#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49003#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:32,288 INFO L273 TraceCheckUtils]: 101: Hoare triple {49003#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {49004#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:32,288 INFO L273 TraceCheckUtils]: 102: Hoare triple {49004#(<= main_~i~0 24)} assume true; {49004#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:32,289 INFO L273 TraceCheckUtils]: 103: Hoare triple {49004#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49004#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:32,289 INFO L273 TraceCheckUtils]: 104: Hoare triple {49004#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49004#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:32,290 INFO L273 TraceCheckUtils]: 105: Hoare triple {49004#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {49005#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:32,291 INFO L273 TraceCheckUtils]: 106: Hoare triple {49005#(<= main_~i~0 25)} assume true; {49005#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:32,291 INFO L273 TraceCheckUtils]: 107: Hoare triple {49005#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49005#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:32,292 INFO L273 TraceCheckUtils]: 108: Hoare triple {49005#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49005#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:32,292 INFO L273 TraceCheckUtils]: 109: Hoare triple {49005#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {49006#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:32,293 INFO L273 TraceCheckUtils]: 110: Hoare triple {49006#(<= main_~i~0 26)} assume true; {49006#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:32,293 INFO L273 TraceCheckUtils]: 111: Hoare triple {49006#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49006#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:32,294 INFO L273 TraceCheckUtils]: 112: Hoare triple {49006#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49006#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:32,295 INFO L273 TraceCheckUtils]: 113: Hoare triple {49006#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {49007#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:32,295 INFO L273 TraceCheckUtils]: 114: Hoare triple {49007#(<= main_~i~0 27)} assume true; {49007#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:32,296 INFO L273 TraceCheckUtils]: 115: Hoare triple {49007#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49007#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:32,296 INFO L273 TraceCheckUtils]: 116: Hoare triple {49007#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49007#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:32,297 INFO L273 TraceCheckUtils]: 117: Hoare triple {49007#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {49008#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:32,297 INFO L273 TraceCheckUtils]: 118: Hoare triple {49008#(<= main_~i~0 28)} assume true; {49008#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:32,298 INFO L273 TraceCheckUtils]: 119: Hoare triple {49008#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49008#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:32,298 INFO L273 TraceCheckUtils]: 120: Hoare triple {49008#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49008#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:32,299 INFO L273 TraceCheckUtils]: 121: Hoare triple {49008#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {49009#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:32,300 INFO L273 TraceCheckUtils]: 122: Hoare triple {49009#(<= main_~i~0 29)} assume true; {49009#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:32,300 INFO L273 TraceCheckUtils]: 123: Hoare triple {49009#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49009#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:32,301 INFO L273 TraceCheckUtils]: 124: Hoare triple {49009#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49009#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:32,301 INFO L273 TraceCheckUtils]: 125: Hoare triple {49009#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {49010#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:32,302 INFO L273 TraceCheckUtils]: 126: Hoare triple {49010#(<= main_~i~0 30)} assume true; {49010#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:32,302 INFO L273 TraceCheckUtils]: 127: Hoare triple {49010#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49010#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:32,303 INFO L273 TraceCheckUtils]: 128: Hoare triple {49010#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49010#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:32,304 INFO L273 TraceCheckUtils]: 129: Hoare triple {49010#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {49011#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:32,304 INFO L273 TraceCheckUtils]: 130: Hoare triple {49011#(<= main_~i~0 31)} assume true; {49011#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:32,305 INFO L273 TraceCheckUtils]: 131: Hoare triple {49011#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49011#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:32,305 INFO L273 TraceCheckUtils]: 132: Hoare triple {49011#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49011#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:32,306 INFO L273 TraceCheckUtils]: 133: Hoare triple {49011#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {49012#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:32,306 INFO L273 TraceCheckUtils]: 134: Hoare triple {49012#(<= main_~i~0 32)} assume true; {49012#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:32,307 INFO L273 TraceCheckUtils]: 135: Hoare triple {49012#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49012#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:32,307 INFO L273 TraceCheckUtils]: 136: Hoare triple {49012#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49012#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:32,308 INFO L273 TraceCheckUtils]: 137: Hoare triple {49012#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {49013#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:32,308 INFO L273 TraceCheckUtils]: 138: Hoare triple {49013#(<= main_~i~0 33)} assume true; {49013#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:32,309 INFO L273 TraceCheckUtils]: 139: Hoare triple {49013#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49013#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:32,309 INFO L273 TraceCheckUtils]: 140: Hoare triple {49013#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49013#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:32,310 INFO L273 TraceCheckUtils]: 141: Hoare triple {49013#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {49014#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:32,311 INFO L273 TraceCheckUtils]: 142: Hoare triple {49014#(<= main_~i~0 34)} assume true; {49014#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:32,311 INFO L273 TraceCheckUtils]: 143: Hoare triple {49014#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49014#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:32,312 INFO L273 TraceCheckUtils]: 144: Hoare triple {49014#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49014#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:32,312 INFO L273 TraceCheckUtils]: 145: Hoare triple {49014#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {49015#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:32,313 INFO L273 TraceCheckUtils]: 146: Hoare triple {49015#(<= main_~i~0 35)} assume true; {49015#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:32,313 INFO L273 TraceCheckUtils]: 147: Hoare triple {49015#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49015#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:32,314 INFO L273 TraceCheckUtils]: 148: Hoare triple {49015#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49015#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:32,315 INFO L273 TraceCheckUtils]: 149: Hoare triple {49015#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {49016#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:32,315 INFO L273 TraceCheckUtils]: 150: Hoare triple {49016#(<= main_~i~0 36)} assume true; {49016#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:32,316 INFO L273 TraceCheckUtils]: 151: Hoare triple {49016#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49016#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:32,316 INFO L273 TraceCheckUtils]: 152: Hoare triple {49016#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49016#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:32,317 INFO L273 TraceCheckUtils]: 153: Hoare triple {49016#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {49017#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:32,317 INFO L273 TraceCheckUtils]: 154: Hoare triple {49017#(<= main_~i~0 37)} assume true; {49017#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:32,318 INFO L273 TraceCheckUtils]: 155: Hoare triple {49017#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49017#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:32,318 INFO L273 TraceCheckUtils]: 156: Hoare triple {49017#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49017#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:32,319 INFO L273 TraceCheckUtils]: 157: Hoare triple {49017#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {49018#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:32,319 INFO L273 TraceCheckUtils]: 158: Hoare triple {49018#(<= main_~i~0 38)} assume true; {49018#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:32,320 INFO L273 TraceCheckUtils]: 159: Hoare triple {49018#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49018#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:32,320 INFO L273 TraceCheckUtils]: 160: Hoare triple {49018#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49018#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:32,321 INFO L273 TraceCheckUtils]: 161: Hoare triple {49018#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {49019#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:32,322 INFO L273 TraceCheckUtils]: 162: Hoare triple {49019#(<= main_~i~0 39)} assume true; {49019#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:32,322 INFO L273 TraceCheckUtils]: 163: Hoare triple {49019#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49019#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:32,323 INFO L273 TraceCheckUtils]: 164: Hoare triple {49019#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49019#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:32,323 INFO L273 TraceCheckUtils]: 165: Hoare triple {49019#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {49020#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:32,324 INFO L273 TraceCheckUtils]: 166: Hoare triple {49020#(<= main_~i~0 40)} assume true; {49020#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:32,324 INFO L273 TraceCheckUtils]: 167: Hoare triple {49020#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49020#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:32,325 INFO L273 TraceCheckUtils]: 168: Hoare triple {49020#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49020#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:32,326 INFO L273 TraceCheckUtils]: 169: Hoare triple {49020#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {49021#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:32,326 INFO L273 TraceCheckUtils]: 170: Hoare triple {49021#(<= main_~i~0 41)} assume true; {49021#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:32,327 INFO L273 TraceCheckUtils]: 171: Hoare triple {49021#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49021#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:32,327 INFO L273 TraceCheckUtils]: 172: Hoare triple {49021#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49021#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:32,328 INFO L273 TraceCheckUtils]: 173: Hoare triple {49021#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {49022#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:32,328 INFO L273 TraceCheckUtils]: 174: Hoare triple {49022#(<= main_~i~0 42)} assume true; {49022#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:32,329 INFO L273 TraceCheckUtils]: 175: Hoare triple {49022#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49022#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:32,329 INFO L273 TraceCheckUtils]: 176: Hoare triple {49022#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49022#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:32,330 INFO L273 TraceCheckUtils]: 177: Hoare triple {49022#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {49023#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:32,330 INFO L273 TraceCheckUtils]: 178: Hoare triple {49023#(<= main_~i~0 43)} assume true; {49023#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:32,331 INFO L273 TraceCheckUtils]: 179: Hoare triple {49023#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49023#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:32,331 INFO L273 TraceCheckUtils]: 180: Hoare triple {49023#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49023#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:32,332 INFO L273 TraceCheckUtils]: 181: Hoare triple {49023#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {49024#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:32,333 INFO L273 TraceCheckUtils]: 182: Hoare triple {49024#(<= main_~i~0 44)} assume true; {49024#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:32,333 INFO L273 TraceCheckUtils]: 183: Hoare triple {49024#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49024#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:32,334 INFO L273 TraceCheckUtils]: 184: Hoare triple {49024#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49024#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:32,334 INFO L273 TraceCheckUtils]: 185: Hoare triple {49024#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {49025#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:32,335 INFO L273 TraceCheckUtils]: 186: Hoare triple {49025#(<= main_~i~0 45)} assume true; {49025#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:32,335 INFO L273 TraceCheckUtils]: 187: Hoare triple {49025#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49025#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:32,336 INFO L273 TraceCheckUtils]: 188: Hoare triple {49025#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49025#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:32,337 INFO L273 TraceCheckUtils]: 189: Hoare triple {49025#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {49026#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:32,337 INFO L273 TraceCheckUtils]: 190: Hoare triple {49026#(<= main_~i~0 46)} assume true; {49026#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:32,338 INFO L273 TraceCheckUtils]: 191: Hoare triple {49026#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49026#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:32,338 INFO L273 TraceCheckUtils]: 192: Hoare triple {49026#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49026#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:32,339 INFO L273 TraceCheckUtils]: 193: Hoare triple {49026#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {49027#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:32,339 INFO L273 TraceCheckUtils]: 194: Hoare triple {49027#(<= main_~i~0 47)} assume true; {49027#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:32,340 INFO L273 TraceCheckUtils]: 195: Hoare triple {49027#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49027#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:32,340 INFO L273 TraceCheckUtils]: 196: Hoare triple {49027#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49027#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:32,341 INFO L273 TraceCheckUtils]: 197: Hoare triple {49027#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {49028#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:32,342 INFO L273 TraceCheckUtils]: 198: Hoare triple {49028#(<= main_~i~0 48)} assume true; {49028#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:32,342 INFO L273 TraceCheckUtils]: 199: Hoare triple {49028#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49028#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:32,342 INFO L273 TraceCheckUtils]: 200: Hoare triple {49028#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49028#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:32,343 INFO L273 TraceCheckUtils]: 201: Hoare triple {49028#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {49029#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:32,344 INFO L273 TraceCheckUtils]: 202: Hoare triple {49029#(<= main_~i~0 49)} assume true; {49029#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:32,344 INFO L273 TraceCheckUtils]: 203: Hoare triple {49029#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49029#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:32,345 INFO L273 TraceCheckUtils]: 204: Hoare triple {49029#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49029#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:32,345 INFO L273 TraceCheckUtils]: 205: Hoare triple {49029#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {49030#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:32,346 INFO L273 TraceCheckUtils]: 206: Hoare triple {49030#(<= main_~i~0 50)} assume true; {49030#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:32,346 INFO L273 TraceCheckUtils]: 207: Hoare triple {49030#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49030#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:32,347 INFO L273 TraceCheckUtils]: 208: Hoare triple {49030#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49030#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:32,348 INFO L273 TraceCheckUtils]: 209: Hoare triple {49030#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {49031#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:32,348 INFO L273 TraceCheckUtils]: 210: Hoare triple {49031#(<= main_~i~0 51)} assume true; {49031#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:32,349 INFO L273 TraceCheckUtils]: 211: Hoare triple {49031#(<= main_~i~0 51)} assume !(~i~0 < 100000); {48979#false} is VALID [2018-11-18 22:58:32,349 INFO L273 TraceCheckUtils]: 212: Hoare triple {48979#false} havoc ~x~0;~x~0 := 0; {48979#false} is VALID [2018-11-18 22:58:32,349 INFO L273 TraceCheckUtils]: 213: Hoare triple {48979#false} assume true; {48979#false} is VALID [2018-11-18 22:58:32,349 INFO L273 TraceCheckUtils]: 214: Hoare triple {48979#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {48979#false} is VALID [2018-11-18 22:58:32,350 INFO L256 TraceCheckUtils]: 215: Hoare triple {48979#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {48979#false} is VALID [2018-11-18 22:58:32,350 INFO L273 TraceCheckUtils]: 216: Hoare triple {48979#false} ~cond := #in~cond; {48979#false} is VALID [2018-11-18 22:58:32,350 INFO L273 TraceCheckUtils]: 217: Hoare triple {48979#false} assume 0 == ~cond; {48979#false} is VALID [2018-11-18 22:58:32,350 INFO L273 TraceCheckUtils]: 218: Hoare triple {48979#false} assume !false; {48979#false} is VALID [2018-11-18 22:58:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:32,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:32,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2018-11-18 22:58:32,404 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 219 [2018-11-18 22:58:32,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:32,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-18 22:58:32,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:32,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-18 22:58:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-18 22:58:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-18 22:58:32,614 INFO L87 Difference]: Start difference. First operand 224 states and 276 transitions. Second operand 55 states. [2018-11-18 22:58:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:33,528 INFO L93 Difference]: Finished difference Result 242 states and 297 transitions. [2018-11-18 22:58:33,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-18 22:58:33,529 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 219 [2018-11-18 22:58:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 22:58:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 297 transitions. [2018-11-18 22:58:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 22:58:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 297 transitions. [2018-11-18 22:58:33,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 297 transitions. [2018-11-18 22:58:33,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:33,808 INFO L225 Difference]: With dead ends: 242 [2018-11-18 22:58:33,808 INFO L226 Difference]: Without dead ends: 230 [2018-11-18 22:58:33,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-18 22:58:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-18 22:58:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-11-18 22:58:33,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:33,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand 228 states. [2018-11-18 22:58:33,947 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand 228 states. [2018-11-18 22:58:33,947 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 228 states. [2018-11-18 22:58:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:33,952 INFO L93 Difference]: Finished difference Result 230 states and 284 transitions. [2018-11-18 22:58:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 284 transitions. [2018-11-18 22:58:33,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:33,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:33,952 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand 230 states. [2018-11-18 22:58:33,952 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 230 states. [2018-11-18 22:58:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:33,956 INFO L93 Difference]: Finished difference Result 230 states and 284 transitions. [2018-11-18 22:58:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 284 transitions. [2018-11-18 22:58:33,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:33,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:33,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:33,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-18 22:58:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 281 transitions. [2018-11-18 22:58:33,960 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 281 transitions. Word has length 219 [2018-11-18 22:58:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:33,960 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 281 transitions. [2018-11-18 22:58:33,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-18 22:58:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 281 transitions. [2018-11-18 22:58:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-18 22:58:33,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:33,961 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:33,961 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:33,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:33,961 INFO L82 PathProgramCache]: Analyzing trace with hash 947445498, now seen corresponding path program 52 times [2018-11-18 22:58:33,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:33,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:33,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:33,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:33,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:35,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {50742#true} call ULTIMATE.init(); {50742#true} is VALID [2018-11-18 22:58:35,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {50742#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50742#true} is VALID [2018-11-18 22:58:35,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {50742#true} assume true; {50742#true} is VALID [2018-11-18 22:58:35,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50742#true} {50742#true} #57#return; {50742#true} is VALID [2018-11-18 22:58:35,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {50742#true} call #t~ret4 := main(); {50742#true} is VALID [2018-11-18 22:58:35,305 INFO L273 TraceCheckUtils]: 5: Hoare triple {50742#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {50744#(= main_~i~0 0)} is VALID [2018-11-18 22:58:35,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {50744#(= main_~i~0 0)} assume true; {50744#(= main_~i~0 0)} is VALID [2018-11-18 22:58:35,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {50744#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50744#(= main_~i~0 0)} is VALID [2018-11-18 22:58:35,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {50744#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50744#(= main_~i~0 0)} is VALID [2018-11-18 22:58:35,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {50744#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {50745#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:35,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {50745#(<= main_~i~0 1)} assume true; {50745#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:35,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {50745#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50745#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:35,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {50745#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50745#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:35,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {50745#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {50746#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:35,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {50746#(<= main_~i~0 2)} assume true; {50746#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:35,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {50746#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50746#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:35,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {50746#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50746#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:35,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {50746#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {50747#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:35,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {50747#(<= main_~i~0 3)} assume true; {50747#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:35,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {50747#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50747#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:35,311 INFO L273 TraceCheckUtils]: 20: Hoare triple {50747#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50747#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:35,311 INFO L273 TraceCheckUtils]: 21: Hoare triple {50747#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {50748#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:35,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {50748#(<= main_~i~0 4)} assume true; {50748#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:35,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {50748#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50748#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:35,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {50748#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50748#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:35,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {50748#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {50749#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:35,314 INFO L273 TraceCheckUtils]: 26: Hoare triple {50749#(<= main_~i~0 5)} assume true; {50749#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:35,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {50749#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50749#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:35,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {50749#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50749#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:35,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {50749#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {50750#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:35,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {50750#(<= main_~i~0 6)} assume true; {50750#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:35,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {50750#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50750#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:35,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {50750#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50750#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:35,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {50750#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {50751#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:35,319 INFO L273 TraceCheckUtils]: 34: Hoare triple {50751#(<= main_~i~0 7)} assume true; {50751#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:35,319 INFO L273 TraceCheckUtils]: 35: Hoare triple {50751#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50751#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:35,320 INFO L273 TraceCheckUtils]: 36: Hoare triple {50751#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50751#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:35,320 INFO L273 TraceCheckUtils]: 37: Hoare triple {50751#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {50752#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:35,321 INFO L273 TraceCheckUtils]: 38: Hoare triple {50752#(<= main_~i~0 8)} assume true; {50752#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:35,321 INFO L273 TraceCheckUtils]: 39: Hoare triple {50752#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50752#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:35,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {50752#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50752#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:35,322 INFO L273 TraceCheckUtils]: 41: Hoare triple {50752#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {50753#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:35,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {50753#(<= main_~i~0 9)} assume true; {50753#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:35,323 INFO L273 TraceCheckUtils]: 43: Hoare triple {50753#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50753#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:35,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {50753#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50753#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:35,325 INFO L273 TraceCheckUtils]: 45: Hoare triple {50753#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {50754#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:35,325 INFO L273 TraceCheckUtils]: 46: Hoare triple {50754#(<= main_~i~0 10)} assume true; {50754#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:35,326 INFO L273 TraceCheckUtils]: 47: Hoare triple {50754#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50754#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:35,326 INFO L273 TraceCheckUtils]: 48: Hoare triple {50754#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50754#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:35,327 INFO L273 TraceCheckUtils]: 49: Hoare triple {50754#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {50755#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:35,327 INFO L273 TraceCheckUtils]: 50: Hoare triple {50755#(<= main_~i~0 11)} assume true; {50755#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:35,328 INFO L273 TraceCheckUtils]: 51: Hoare triple {50755#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50755#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:35,328 INFO L273 TraceCheckUtils]: 52: Hoare triple {50755#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50755#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:35,329 INFO L273 TraceCheckUtils]: 53: Hoare triple {50755#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {50756#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:35,330 INFO L273 TraceCheckUtils]: 54: Hoare triple {50756#(<= main_~i~0 12)} assume true; {50756#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:35,330 INFO L273 TraceCheckUtils]: 55: Hoare triple {50756#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50756#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:35,331 INFO L273 TraceCheckUtils]: 56: Hoare triple {50756#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50756#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:35,331 INFO L273 TraceCheckUtils]: 57: Hoare triple {50756#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {50757#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:35,332 INFO L273 TraceCheckUtils]: 58: Hoare triple {50757#(<= main_~i~0 13)} assume true; {50757#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:35,332 INFO L273 TraceCheckUtils]: 59: Hoare triple {50757#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50757#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:35,333 INFO L273 TraceCheckUtils]: 60: Hoare triple {50757#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50757#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:35,334 INFO L273 TraceCheckUtils]: 61: Hoare triple {50757#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {50758#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:35,334 INFO L273 TraceCheckUtils]: 62: Hoare triple {50758#(<= main_~i~0 14)} assume true; {50758#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:35,335 INFO L273 TraceCheckUtils]: 63: Hoare triple {50758#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50758#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:35,335 INFO L273 TraceCheckUtils]: 64: Hoare triple {50758#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50758#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:35,336 INFO L273 TraceCheckUtils]: 65: Hoare triple {50758#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {50759#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:35,336 INFO L273 TraceCheckUtils]: 66: Hoare triple {50759#(<= main_~i~0 15)} assume true; {50759#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:35,337 INFO L273 TraceCheckUtils]: 67: Hoare triple {50759#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50759#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:35,337 INFO L273 TraceCheckUtils]: 68: Hoare triple {50759#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50759#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:35,338 INFO L273 TraceCheckUtils]: 69: Hoare triple {50759#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {50760#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:35,338 INFO L273 TraceCheckUtils]: 70: Hoare triple {50760#(<= main_~i~0 16)} assume true; {50760#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:35,339 INFO L273 TraceCheckUtils]: 71: Hoare triple {50760#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50760#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:35,339 INFO L273 TraceCheckUtils]: 72: Hoare triple {50760#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50760#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:35,340 INFO L273 TraceCheckUtils]: 73: Hoare triple {50760#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {50761#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:35,341 INFO L273 TraceCheckUtils]: 74: Hoare triple {50761#(<= main_~i~0 17)} assume true; {50761#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:35,341 INFO L273 TraceCheckUtils]: 75: Hoare triple {50761#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50761#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:35,342 INFO L273 TraceCheckUtils]: 76: Hoare triple {50761#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50761#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:35,342 INFO L273 TraceCheckUtils]: 77: Hoare triple {50761#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {50762#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:35,343 INFO L273 TraceCheckUtils]: 78: Hoare triple {50762#(<= main_~i~0 18)} assume true; {50762#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:35,343 INFO L273 TraceCheckUtils]: 79: Hoare triple {50762#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50762#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:35,344 INFO L273 TraceCheckUtils]: 80: Hoare triple {50762#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50762#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:35,345 INFO L273 TraceCheckUtils]: 81: Hoare triple {50762#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {50763#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:35,345 INFO L273 TraceCheckUtils]: 82: Hoare triple {50763#(<= main_~i~0 19)} assume true; {50763#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:35,346 INFO L273 TraceCheckUtils]: 83: Hoare triple {50763#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50763#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:35,346 INFO L273 TraceCheckUtils]: 84: Hoare triple {50763#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50763#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:35,347 INFO L273 TraceCheckUtils]: 85: Hoare triple {50763#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {50764#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:35,347 INFO L273 TraceCheckUtils]: 86: Hoare triple {50764#(<= main_~i~0 20)} assume true; {50764#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:35,348 INFO L273 TraceCheckUtils]: 87: Hoare triple {50764#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50764#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:35,348 INFO L273 TraceCheckUtils]: 88: Hoare triple {50764#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50764#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:35,349 INFO L273 TraceCheckUtils]: 89: Hoare triple {50764#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {50765#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:35,350 INFO L273 TraceCheckUtils]: 90: Hoare triple {50765#(<= main_~i~0 21)} assume true; {50765#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:35,350 INFO L273 TraceCheckUtils]: 91: Hoare triple {50765#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50765#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:35,351 INFO L273 TraceCheckUtils]: 92: Hoare triple {50765#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50765#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:35,351 INFO L273 TraceCheckUtils]: 93: Hoare triple {50765#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {50766#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:35,352 INFO L273 TraceCheckUtils]: 94: Hoare triple {50766#(<= main_~i~0 22)} assume true; {50766#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:35,352 INFO L273 TraceCheckUtils]: 95: Hoare triple {50766#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50766#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:35,353 INFO L273 TraceCheckUtils]: 96: Hoare triple {50766#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50766#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:35,353 INFO L273 TraceCheckUtils]: 97: Hoare triple {50766#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {50767#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:35,354 INFO L273 TraceCheckUtils]: 98: Hoare triple {50767#(<= main_~i~0 23)} assume true; {50767#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:35,354 INFO L273 TraceCheckUtils]: 99: Hoare triple {50767#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50767#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:35,355 INFO L273 TraceCheckUtils]: 100: Hoare triple {50767#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50767#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:35,356 INFO L273 TraceCheckUtils]: 101: Hoare triple {50767#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {50768#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:35,356 INFO L273 TraceCheckUtils]: 102: Hoare triple {50768#(<= main_~i~0 24)} assume true; {50768#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:35,357 INFO L273 TraceCheckUtils]: 103: Hoare triple {50768#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50768#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:35,357 INFO L273 TraceCheckUtils]: 104: Hoare triple {50768#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50768#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:35,358 INFO L273 TraceCheckUtils]: 105: Hoare triple {50768#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {50769#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:35,358 INFO L273 TraceCheckUtils]: 106: Hoare triple {50769#(<= main_~i~0 25)} assume true; {50769#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:35,359 INFO L273 TraceCheckUtils]: 107: Hoare triple {50769#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50769#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:35,359 INFO L273 TraceCheckUtils]: 108: Hoare triple {50769#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50769#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:35,360 INFO L273 TraceCheckUtils]: 109: Hoare triple {50769#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {50770#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:35,361 INFO L273 TraceCheckUtils]: 110: Hoare triple {50770#(<= main_~i~0 26)} assume true; {50770#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:35,361 INFO L273 TraceCheckUtils]: 111: Hoare triple {50770#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50770#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:35,362 INFO L273 TraceCheckUtils]: 112: Hoare triple {50770#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50770#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:35,362 INFO L273 TraceCheckUtils]: 113: Hoare triple {50770#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {50771#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:35,363 INFO L273 TraceCheckUtils]: 114: Hoare triple {50771#(<= main_~i~0 27)} assume true; {50771#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:35,363 INFO L273 TraceCheckUtils]: 115: Hoare triple {50771#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50771#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:35,364 INFO L273 TraceCheckUtils]: 116: Hoare triple {50771#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50771#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:35,365 INFO L273 TraceCheckUtils]: 117: Hoare triple {50771#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {50772#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:35,365 INFO L273 TraceCheckUtils]: 118: Hoare triple {50772#(<= main_~i~0 28)} assume true; {50772#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:35,366 INFO L273 TraceCheckUtils]: 119: Hoare triple {50772#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50772#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:35,368 INFO L273 TraceCheckUtils]: 120: Hoare triple {50772#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50772#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:35,369 INFO L273 TraceCheckUtils]: 121: Hoare triple {50772#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {50773#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:35,369 INFO L273 TraceCheckUtils]: 122: Hoare triple {50773#(<= main_~i~0 29)} assume true; {50773#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:35,369 INFO L273 TraceCheckUtils]: 123: Hoare triple {50773#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50773#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:35,370 INFO L273 TraceCheckUtils]: 124: Hoare triple {50773#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50773#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:35,370 INFO L273 TraceCheckUtils]: 125: Hoare triple {50773#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {50774#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:35,370 INFO L273 TraceCheckUtils]: 126: Hoare triple {50774#(<= main_~i~0 30)} assume true; {50774#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:35,371 INFO L273 TraceCheckUtils]: 127: Hoare triple {50774#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50774#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:35,371 INFO L273 TraceCheckUtils]: 128: Hoare triple {50774#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50774#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:35,372 INFO L273 TraceCheckUtils]: 129: Hoare triple {50774#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {50775#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:35,372 INFO L273 TraceCheckUtils]: 130: Hoare triple {50775#(<= main_~i~0 31)} assume true; {50775#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:35,373 INFO L273 TraceCheckUtils]: 131: Hoare triple {50775#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50775#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:35,373 INFO L273 TraceCheckUtils]: 132: Hoare triple {50775#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50775#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:35,374 INFO L273 TraceCheckUtils]: 133: Hoare triple {50775#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {50776#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:35,374 INFO L273 TraceCheckUtils]: 134: Hoare triple {50776#(<= main_~i~0 32)} assume true; {50776#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:35,375 INFO L273 TraceCheckUtils]: 135: Hoare triple {50776#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50776#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:35,375 INFO L273 TraceCheckUtils]: 136: Hoare triple {50776#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50776#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:35,376 INFO L273 TraceCheckUtils]: 137: Hoare triple {50776#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {50777#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:35,377 INFO L273 TraceCheckUtils]: 138: Hoare triple {50777#(<= main_~i~0 33)} assume true; {50777#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:35,377 INFO L273 TraceCheckUtils]: 139: Hoare triple {50777#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50777#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:35,377 INFO L273 TraceCheckUtils]: 140: Hoare triple {50777#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50777#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:35,378 INFO L273 TraceCheckUtils]: 141: Hoare triple {50777#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {50778#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:35,379 INFO L273 TraceCheckUtils]: 142: Hoare triple {50778#(<= main_~i~0 34)} assume true; {50778#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:35,379 INFO L273 TraceCheckUtils]: 143: Hoare triple {50778#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50778#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:35,380 INFO L273 TraceCheckUtils]: 144: Hoare triple {50778#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50778#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:35,380 INFO L273 TraceCheckUtils]: 145: Hoare triple {50778#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {50779#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:35,381 INFO L273 TraceCheckUtils]: 146: Hoare triple {50779#(<= main_~i~0 35)} assume true; {50779#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:35,381 INFO L273 TraceCheckUtils]: 147: Hoare triple {50779#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50779#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:35,382 INFO L273 TraceCheckUtils]: 148: Hoare triple {50779#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50779#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:35,383 INFO L273 TraceCheckUtils]: 149: Hoare triple {50779#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {50780#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:35,383 INFO L273 TraceCheckUtils]: 150: Hoare triple {50780#(<= main_~i~0 36)} assume true; {50780#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:35,384 INFO L273 TraceCheckUtils]: 151: Hoare triple {50780#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50780#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:35,384 INFO L273 TraceCheckUtils]: 152: Hoare triple {50780#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50780#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:35,385 INFO L273 TraceCheckUtils]: 153: Hoare triple {50780#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {50781#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:35,385 INFO L273 TraceCheckUtils]: 154: Hoare triple {50781#(<= main_~i~0 37)} assume true; {50781#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:35,386 INFO L273 TraceCheckUtils]: 155: Hoare triple {50781#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50781#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:35,386 INFO L273 TraceCheckUtils]: 156: Hoare triple {50781#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50781#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:35,387 INFO L273 TraceCheckUtils]: 157: Hoare triple {50781#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {50782#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:35,388 INFO L273 TraceCheckUtils]: 158: Hoare triple {50782#(<= main_~i~0 38)} assume true; {50782#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:35,388 INFO L273 TraceCheckUtils]: 159: Hoare triple {50782#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50782#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:35,389 INFO L273 TraceCheckUtils]: 160: Hoare triple {50782#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50782#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:35,389 INFO L273 TraceCheckUtils]: 161: Hoare triple {50782#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {50783#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:35,390 INFO L273 TraceCheckUtils]: 162: Hoare triple {50783#(<= main_~i~0 39)} assume true; {50783#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:35,390 INFO L273 TraceCheckUtils]: 163: Hoare triple {50783#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50783#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:35,391 INFO L273 TraceCheckUtils]: 164: Hoare triple {50783#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50783#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:35,391 INFO L273 TraceCheckUtils]: 165: Hoare triple {50783#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {50784#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:35,392 INFO L273 TraceCheckUtils]: 166: Hoare triple {50784#(<= main_~i~0 40)} assume true; {50784#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:35,392 INFO L273 TraceCheckUtils]: 167: Hoare triple {50784#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50784#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:35,393 INFO L273 TraceCheckUtils]: 168: Hoare triple {50784#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50784#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:35,394 INFO L273 TraceCheckUtils]: 169: Hoare triple {50784#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {50785#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:35,394 INFO L273 TraceCheckUtils]: 170: Hoare triple {50785#(<= main_~i~0 41)} assume true; {50785#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:35,395 INFO L273 TraceCheckUtils]: 171: Hoare triple {50785#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50785#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:35,395 INFO L273 TraceCheckUtils]: 172: Hoare triple {50785#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50785#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:35,396 INFO L273 TraceCheckUtils]: 173: Hoare triple {50785#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {50786#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:35,396 INFO L273 TraceCheckUtils]: 174: Hoare triple {50786#(<= main_~i~0 42)} assume true; {50786#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:35,397 INFO L273 TraceCheckUtils]: 175: Hoare triple {50786#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50786#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:35,397 INFO L273 TraceCheckUtils]: 176: Hoare triple {50786#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50786#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:35,398 INFO L273 TraceCheckUtils]: 177: Hoare triple {50786#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {50787#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:35,399 INFO L273 TraceCheckUtils]: 178: Hoare triple {50787#(<= main_~i~0 43)} assume true; {50787#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:35,399 INFO L273 TraceCheckUtils]: 179: Hoare triple {50787#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50787#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:35,400 INFO L273 TraceCheckUtils]: 180: Hoare triple {50787#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50787#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:35,400 INFO L273 TraceCheckUtils]: 181: Hoare triple {50787#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {50788#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:35,401 INFO L273 TraceCheckUtils]: 182: Hoare triple {50788#(<= main_~i~0 44)} assume true; {50788#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:35,401 INFO L273 TraceCheckUtils]: 183: Hoare triple {50788#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50788#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:35,402 INFO L273 TraceCheckUtils]: 184: Hoare triple {50788#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50788#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:35,403 INFO L273 TraceCheckUtils]: 185: Hoare triple {50788#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {50789#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:35,403 INFO L273 TraceCheckUtils]: 186: Hoare triple {50789#(<= main_~i~0 45)} assume true; {50789#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:35,404 INFO L273 TraceCheckUtils]: 187: Hoare triple {50789#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50789#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:35,404 INFO L273 TraceCheckUtils]: 188: Hoare triple {50789#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50789#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:35,405 INFO L273 TraceCheckUtils]: 189: Hoare triple {50789#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {50790#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:35,405 INFO L273 TraceCheckUtils]: 190: Hoare triple {50790#(<= main_~i~0 46)} assume true; {50790#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:35,406 INFO L273 TraceCheckUtils]: 191: Hoare triple {50790#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50790#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:35,406 INFO L273 TraceCheckUtils]: 192: Hoare triple {50790#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50790#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:35,407 INFO L273 TraceCheckUtils]: 193: Hoare triple {50790#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {50791#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:35,408 INFO L273 TraceCheckUtils]: 194: Hoare triple {50791#(<= main_~i~0 47)} assume true; {50791#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:35,408 INFO L273 TraceCheckUtils]: 195: Hoare triple {50791#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50791#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:35,409 INFO L273 TraceCheckUtils]: 196: Hoare triple {50791#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50791#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:35,409 INFO L273 TraceCheckUtils]: 197: Hoare triple {50791#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {50792#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:35,410 INFO L273 TraceCheckUtils]: 198: Hoare triple {50792#(<= main_~i~0 48)} assume true; {50792#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:35,410 INFO L273 TraceCheckUtils]: 199: Hoare triple {50792#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50792#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:35,411 INFO L273 TraceCheckUtils]: 200: Hoare triple {50792#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50792#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:35,411 INFO L273 TraceCheckUtils]: 201: Hoare triple {50792#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {50793#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:35,412 INFO L273 TraceCheckUtils]: 202: Hoare triple {50793#(<= main_~i~0 49)} assume true; {50793#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:35,412 INFO L273 TraceCheckUtils]: 203: Hoare triple {50793#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50793#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:35,413 INFO L273 TraceCheckUtils]: 204: Hoare triple {50793#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50793#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:35,414 INFO L273 TraceCheckUtils]: 205: Hoare triple {50793#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {50794#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:35,414 INFO L273 TraceCheckUtils]: 206: Hoare triple {50794#(<= main_~i~0 50)} assume true; {50794#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:35,415 INFO L273 TraceCheckUtils]: 207: Hoare triple {50794#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50794#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:35,415 INFO L273 TraceCheckUtils]: 208: Hoare triple {50794#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50794#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:35,416 INFO L273 TraceCheckUtils]: 209: Hoare triple {50794#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {50795#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:35,416 INFO L273 TraceCheckUtils]: 210: Hoare triple {50795#(<= main_~i~0 51)} assume true; {50795#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:35,417 INFO L273 TraceCheckUtils]: 211: Hoare triple {50795#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50795#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:35,417 INFO L273 TraceCheckUtils]: 212: Hoare triple {50795#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50795#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:35,418 INFO L273 TraceCheckUtils]: 213: Hoare triple {50795#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {50796#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:35,419 INFO L273 TraceCheckUtils]: 214: Hoare triple {50796#(<= main_~i~0 52)} assume true; {50796#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:35,419 INFO L273 TraceCheckUtils]: 215: Hoare triple {50796#(<= main_~i~0 52)} assume !(~i~0 < 100000); {50743#false} is VALID [2018-11-18 22:58:35,419 INFO L273 TraceCheckUtils]: 216: Hoare triple {50743#false} havoc ~x~0;~x~0 := 0; {50743#false} is VALID [2018-11-18 22:58:35,420 INFO L273 TraceCheckUtils]: 217: Hoare triple {50743#false} assume true; {50743#false} is VALID [2018-11-18 22:58:35,420 INFO L273 TraceCheckUtils]: 218: Hoare triple {50743#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {50743#false} is VALID [2018-11-18 22:58:35,420 INFO L256 TraceCheckUtils]: 219: Hoare triple {50743#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {50743#false} is VALID [2018-11-18 22:58:35,420 INFO L273 TraceCheckUtils]: 220: Hoare triple {50743#false} ~cond := #in~cond; {50743#false} is VALID [2018-11-18 22:58:35,420 INFO L273 TraceCheckUtils]: 221: Hoare triple {50743#false} assume 0 == ~cond; {50743#false} is VALID [2018-11-18 22:58:35,420 INFO L273 TraceCheckUtils]: 222: Hoare triple {50743#false} assume !false; {50743#false} is VALID [2018-11-18 22:58:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:35,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:35,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:35,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:58:35,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:58:35,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:35,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:36,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {50742#true} call ULTIMATE.init(); {50742#true} is VALID [2018-11-18 22:58:36,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {50742#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50742#true} is VALID [2018-11-18 22:58:36,481 INFO L273 TraceCheckUtils]: 2: Hoare triple {50742#true} assume true; {50742#true} is VALID [2018-11-18 22:58:36,482 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50742#true} {50742#true} #57#return; {50742#true} is VALID [2018-11-18 22:58:36,482 INFO L256 TraceCheckUtils]: 4: Hoare triple {50742#true} call #t~ret4 := main(); {50742#true} is VALID [2018-11-18 22:58:36,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {50742#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {50815#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:36,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {50815#(<= main_~i~0 0)} assume true; {50815#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:36,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {50815#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50815#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:36,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {50815#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50815#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:36,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {50815#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {50745#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:36,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {50745#(<= main_~i~0 1)} assume true; {50745#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:36,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {50745#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50745#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:36,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {50745#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50745#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:36,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {50745#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {50746#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:36,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {50746#(<= main_~i~0 2)} assume true; {50746#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:36,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {50746#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50746#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:36,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {50746#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50746#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:36,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {50746#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {50747#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:36,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {50747#(<= main_~i~0 3)} assume true; {50747#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:36,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {50747#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50747#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:36,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {50747#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50747#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:36,489 INFO L273 TraceCheckUtils]: 21: Hoare triple {50747#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {50748#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:36,490 INFO L273 TraceCheckUtils]: 22: Hoare triple {50748#(<= main_~i~0 4)} assume true; {50748#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:36,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {50748#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50748#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:36,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {50748#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50748#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:36,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {50748#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {50749#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:36,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {50749#(<= main_~i~0 5)} assume true; {50749#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:36,493 INFO L273 TraceCheckUtils]: 27: Hoare triple {50749#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50749#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:36,493 INFO L273 TraceCheckUtils]: 28: Hoare triple {50749#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50749#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:36,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {50749#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {50750#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:36,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {50750#(<= main_~i~0 6)} assume true; {50750#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:36,495 INFO L273 TraceCheckUtils]: 31: Hoare triple {50750#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50750#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:36,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {50750#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50750#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:36,496 INFO L273 TraceCheckUtils]: 33: Hoare triple {50750#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {50751#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:36,496 INFO L273 TraceCheckUtils]: 34: Hoare triple {50751#(<= main_~i~0 7)} assume true; {50751#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:36,497 INFO L273 TraceCheckUtils]: 35: Hoare triple {50751#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50751#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:36,497 INFO L273 TraceCheckUtils]: 36: Hoare triple {50751#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50751#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:36,498 INFO L273 TraceCheckUtils]: 37: Hoare triple {50751#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {50752#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:36,499 INFO L273 TraceCheckUtils]: 38: Hoare triple {50752#(<= main_~i~0 8)} assume true; {50752#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:36,499 INFO L273 TraceCheckUtils]: 39: Hoare triple {50752#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50752#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:36,500 INFO L273 TraceCheckUtils]: 40: Hoare triple {50752#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50752#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:36,500 INFO L273 TraceCheckUtils]: 41: Hoare triple {50752#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {50753#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:36,501 INFO L273 TraceCheckUtils]: 42: Hoare triple {50753#(<= main_~i~0 9)} assume true; {50753#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:36,501 INFO L273 TraceCheckUtils]: 43: Hoare triple {50753#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50753#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:36,502 INFO L273 TraceCheckUtils]: 44: Hoare triple {50753#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50753#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:36,502 INFO L273 TraceCheckUtils]: 45: Hoare triple {50753#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {50754#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:36,503 INFO L273 TraceCheckUtils]: 46: Hoare triple {50754#(<= main_~i~0 10)} assume true; {50754#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:36,503 INFO L273 TraceCheckUtils]: 47: Hoare triple {50754#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50754#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:36,504 INFO L273 TraceCheckUtils]: 48: Hoare triple {50754#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50754#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:36,505 INFO L273 TraceCheckUtils]: 49: Hoare triple {50754#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {50755#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:36,505 INFO L273 TraceCheckUtils]: 50: Hoare triple {50755#(<= main_~i~0 11)} assume true; {50755#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:36,506 INFO L273 TraceCheckUtils]: 51: Hoare triple {50755#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50755#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:36,506 INFO L273 TraceCheckUtils]: 52: Hoare triple {50755#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50755#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:36,507 INFO L273 TraceCheckUtils]: 53: Hoare triple {50755#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {50756#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:36,507 INFO L273 TraceCheckUtils]: 54: Hoare triple {50756#(<= main_~i~0 12)} assume true; {50756#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:36,508 INFO L273 TraceCheckUtils]: 55: Hoare triple {50756#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50756#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:36,508 INFO L273 TraceCheckUtils]: 56: Hoare triple {50756#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50756#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:36,509 INFO L273 TraceCheckUtils]: 57: Hoare triple {50756#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {50757#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:36,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {50757#(<= main_~i~0 13)} assume true; {50757#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:36,510 INFO L273 TraceCheckUtils]: 59: Hoare triple {50757#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50757#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:36,510 INFO L273 TraceCheckUtils]: 60: Hoare triple {50757#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50757#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:36,511 INFO L273 TraceCheckUtils]: 61: Hoare triple {50757#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {50758#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:36,512 INFO L273 TraceCheckUtils]: 62: Hoare triple {50758#(<= main_~i~0 14)} assume true; {50758#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:36,512 INFO L273 TraceCheckUtils]: 63: Hoare triple {50758#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50758#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:36,513 INFO L273 TraceCheckUtils]: 64: Hoare triple {50758#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50758#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:36,513 INFO L273 TraceCheckUtils]: 65: Hoare triple {50758#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {50759#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:36,514 INFO L273 TraceCheckUtils]: 66: Hoare triple {50759#(<= main_~i~0 15)} assume true; {50759#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:36,514 INFO L273 TraceCheckUtils]: 67: Hoare triple {50759#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50759#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:36,515 INFO L273 TraceCheckUtils]: 68: Hoare triple {50759#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50759#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:36,516 INFO L273 TraceCheckUtils]: 69: Hoare triple {50759#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {50760#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:36,516 INFO L273 TraceCheckUtils]: 70: Hoare triple {50760#(<= main_~i~0 16)} assume true; {50760#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:36,517 INFO L273 TraceCheckUtils]: 71: Hoare triple {50760#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50760#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:36,517 INFO L273 TraceCheckUtils]: 72: Hoare triple {50760#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50760#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:36,518 INFO L273 TraceCheckUtils]: 73: Hoare triple {50760#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {50761#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:36,518 INFO L273 TraceCheckUtils]: 74: Hoare triple {50761#(<= main_~i~0 17)} assume true; {50761#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:36,519 INFO L273 TraceCheckUtils]: 75: Hoare triple {50761#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50761#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:36,519 INFO L273 TraceCheckUtils]: 76: Hoare triple {50761#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50761#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:36,520 INFO L273 TraceCheckUtils]: 77: Hoare triple {50761#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {50762#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:36,520 INFO L273 TraceCheckUtils]: 78: Hoare triple {50762#(<= main_~i~0 18)} assume true; {50762#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:36,521 INFO L273 TraceCheckUtils]: 79: Hoare triple {50762#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50762#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:36,521 INFO L273 TraceCheckUtils]: 80: Hoare triple {50762#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50762#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:36,522 INFO L273 TraceCheckUtils]: 81: Hoare triple {50762#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {50763#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:36,523 INFO L273 TraceCheckUtils]: 82: Hoare triple {50763#(<= main_~i~0 19)} assume true; {50763#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:36,523 INFO L273 TraceCheckUtils]: 83: Hoare triple {50763#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50763#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:36,524 INFO L273 TraceCheckUtils]: 84: Hoare triple {50763#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50763#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:36,524 INFO L273 TraceCheckUtils]: 85: Hoare triple {50763#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {50764#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:36,525 INFO L273 TraceCheckUtils]: 86: Hoare triple {50764#(<= main_~i~0 20)} assume true; {50764#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:36,525 INFO L273 TraceCheckUtils]: 87: Hoare triple {50764#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50764#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:36,526 INFO L273 TraceCheckUtils]: 88: Hoare triple {50764#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50764#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:36,527 INFO L273 TraceCheckUtils]: 89: Hoare triple {50764#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {50765#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:36,527 INFO L273 TraceCheckUtils]: 90: Hoare triple {50765#(<= main_~i~0 21)} assume true; {50765#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:36,528 INFO L273 TraceCheckUtils]: 91: Hoare triple {50765#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50765#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:36,528 INFO L273 TraceCheckUtils]: 92: Hoare triple {50765#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50765#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:36,529 INFO L273 TraceCheckUtils]: 93: Hoare triple {50765#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {50766#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:36,529 INFO L273 TraceCheckUtils]: 94: Hoare triple {50766#(<= main_~i~0 22)} assume true; {50766#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:36,530 INFO L273 TraceCheckUtils]: 95: Hoare triple {50766#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50766#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:36,530 INFO L273 TraceCheckUtils]: 96: Hoare triple {50766#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50766#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:36,531 INFO L273 TraceCheckUtils]: 97: Hoare triple {50766#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {50767#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:36,531 INFO L273 TraceCheckUtils]: 98: Hoare triple {50767#(<= main_~i~0 23)} assume true; {50767#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:36,532 INFO L273 TraceCheckUtils]: 99: Hoare triple {50767#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50767#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:36,532 INFO L273 TraceCheckUtils]: 100: Hoare triple {50767#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50767#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:36,533 INFO L273 TraceCheckUtils]: 101: Hoare triple {50767#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {50768#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:36,534 INFO L273 TraceCheckUtils]: 102: Hoare triple {50768#(<= main_~i~0 24)} assume true; {50768#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:36,534 INFO L273 TraceCheckUtils]: 103: Hoare triple {50768#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50768#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:36,535 INFO L273 TraceCheckUtils]: 104: Hoare triple {50768#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50768#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:36,535 INFO L273 TraceCheckUtils]: 105: Hoare triple {50768#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {50769#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:36,536 INFO L273 TraceCheckUtils]: 106: Hoare triple {50769#(<= main_~i~0 25)} assume true; {50769#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:36,536 INFO L273 TraceCheckUtils]: 107: Hoare triple {50769#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50769#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:36,537 INFO L273 TraceCheckUtils]: 108: Hoare triple {50769#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50769#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:36,538 INFO L273 TraceCheckUtils]: 109: Hoare triple {50769#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {50770#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:36,538 INFO L273 TraceCheckUtils]: 110: Hoare triple {50770#(<= main_~i~0 26)} assume true; {50770#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:36,539 INFO L273 TraceCheckUtils]: 111: Hoare triple {50770#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50770#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:36,539 INFO L273 TraceCheckUtils]: 112: Hoare triple {50770#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50770#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:36,540 INFO L273 TraceCheckUtils]: 113: Hoare triple {50770#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {50771#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:36,540 INFO L273 TraceCheckUtils]: 114: Hoare triple {50771#(<= main_~i~0 27)} assume true; {50771#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:36,541 INFO L273 TraceCheckUtils]: 115: Hoare triple {50771#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50771#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:36,541 INFO L273 TraceCheckUtils]: 116: Hoare triple {50771#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50771#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:36,542 INFO L273 TraceCheckUtils]: 117: Hoare triple {50771#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {50772#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:36,542 INFO L273 TraceCheckUtils]: 118: Hoare triple {50772#(<= main_~i~0 28)} assume true; {50772#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:36,543 INFO L273 TraceCheckUtils]: 119: Hoare triple {50772#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50772#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:36,543 INFO L273 TraceCheckUtils]: 120: Hoare triple {50772#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50772#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:36,544 INFO L273 TraceCheckUtils]: 121: Hoare triple {50772#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {50773#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:36,545 INFO L273 TraceCheckUtils]: 122: Hoare triple {50773#(<= main_~i~0 29)} assume true; {50773#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:36,545 INFO L273 TraceCheckUtils]: 123: Hoare triple {50773#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50773#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:36,546 INFO L273 TraceCheckUtils]: 124: Hoare triple {50773#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50773#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:36,546 INFO L273 TraceCheckUtils]: 125: Hoare triple {50773#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {50774#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:36,547 INFO L273 TraceCheckUtils]: 126: Hoare triple {50774#(<= main_~i~0 30)} assume true; {50774#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:36,547 INFO L273 TraceCheckUtils]: 127: Hoare triple {50774#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50774#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:36,548 INFO L273 TraceCheckUtils]: 128: Hoare triple {50774#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50774#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:36,549 INFO L273 TraceCheckUtils]: 129: Hoare triple {50774#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {50775#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:36,549 INFO L273 TraceCheckUtils]: 130: Hoare triple {50775#(<= main_~i~0 31)} assume true; {50775#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:36,550 INFO L273 TraceCheckUtils]: 131: Hoare triple {50775#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50775#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:36,550 INFO L273 TraceCheckUtils]: 132: Hoare triple {50775#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50775#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:36,551 INFO L273 TraceCheckUtils]: 133: Hoare triple {50775#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {50776#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:36,551 INFO L273 TraceCheckUtils]: 134: Hoare triple {50776#(<= main_~i~0 32)} assume true; {50776#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:36,552 INFO L273 TraceCheckUtils]: 135: Hoare triple {50776#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50776#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:36,552 INFO L273 TraceCheckUtils]: 136: Hoare triple {50776#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50776#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:36,553 INFO L273 TraceCheckUtils]: 137: Hoare triple {50776#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {50777#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:36,553 INFO L273 TraceCheckUtils]: 138: Hoare triple {50777#(<= main_~i~0 33)} assume true; {50777#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:36,554 INFO L273 TraceCheckUtils]: 139: Hoare triple {50777#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50777#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:36,554 INFO L273 TraceCheckUtils]: 140: Hoare triple {50777#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50777#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:36,555 INFO L273 TraceCheckUtils]: 141: Hoare triple {50777#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {50778#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:36,556 INFO L273 TraceCheckUtils]: 142: Hoare triple {50778#(<= main_~i~0 34)} assume true; {50778#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:36,556 INFO L273 TraceCheckUtils]: 143: Hoare triple {50778#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50778#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:36,557 INFO L273 TraceCheckUtils]: 144: Hoare triple {50778#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50778#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:36,557 INFO L273 TraceCheckUtils]: 145: Hoare triple {50778#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {50779#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:36,558 INFO L273 TraceCheckUtils]: 146: Hoare triple {50779#(<= main_~i~0 35)} assume true; {50779#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:36,558 INFO L273 TraceCheckUtils]: 147: Hoare triple {50779#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50779#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:36,559 INFO L273 TraceCheckUtils]: 148: Hoare triple {50779#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50779#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:36,560 INFO L273 TraceCheckUtils]: 149: Hoare triple {50779#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {50780#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:36,560 INFO L273 TraceCheckUtils]: 150: Hoare triple {50780#(<= main_~i~0 36)} assume true; {50780#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:36,561 INFO L273 TraceCheckUtils]: 151: Hoare triple {50780#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50780#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:36,561 INFO L273 TraceCheckUtils]: 152: Hoare triple {50780#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50780#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:36,562 INFO L273 TraceCheckUtils]: 153: Hoare triple {50780#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {50781#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:36,562 INFO L273 TraceCheckUtils]: 154: Hoare triple {50781#(<= main_~i~0 37)} assume true; {50781#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:36,563 INFO L273 TraceCheckUtils]: 155: Hoare triple {50781#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50781#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:36,563 INFO L273 TraceCheckUtils]: 156: Hoare triple {50781#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50781#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:36,564 INFO L273 TraceCheckUtils]: 157: Hoare triple {50781#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {50782#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:36,564 INFO L273 TraceCheckUtils]: 158: Hoare triple {50782#(<= main_~i~0 38)} assume true; {50782#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:36,565 INFO L273 TraceCheckUtils]: 159: Hoare triple {50782#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50782#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:36,565 INFO L273 TraceCheckUtils]: 160: Hoare triple {50782#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50782#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:36,566 INFO L273 TraceCheckUtils]: 161: Hoare triple {50782#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {50783#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:36,567 INFO L273 TraceCheckUtils]: 162: Hoare triple {50783#(<= main_~i~0 39)} assume true; {50783#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:36,567 INFO L273 TraceCheckUtils]: 163: Hoare triple {50783#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50783#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:36,568 INFO L273 TraceCheckUtils]: 164: Hoare triple {50783#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50783#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:36,568 INFO L273 TraceCheckUtils]: 165: Hoare triple {50783#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {50784#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:36,569 INFO L273 TraceCheckUtils]: 166: Hoare triple {50784#(<= main_~i~0 40)} assume true; {50784#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:36,569 INFO L273 TraceCheckUtils]: 167: Hoare triple {50784#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50784#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:36,570 INFO L273 TraceCheckUtils]: 168: Hoare triple {50784#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50784#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:36,571 INFO L273 TraceCheckUtils]: 169: Hoare triple {50784#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {50785#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:36,571 INFO L273 TraceCheckUtils]: 170: Hoare triple {50785#(<= main_~i~0 41)} assume true; {50785#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:36,572 INFO L273 TraceCheckUtils]: 171: Hoare triple {50785#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50785#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:36,572 INFO L273 TraceCheckUtils]: 172: Hoare triple {50785#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50785#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:36,573 INFO L273 TraceCheckUtils]: 173: Hoare triple {50785#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {50786#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:36,573 INFO L273 TraceCheckUtils]: 174: Hoare triple {50786#(<= main_~i~0 42)} assume true; {50786#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:36,574 INFO L273 TraceCheckUtils]: 175: Hoare triple {50786#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50786#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:36,574 INFO L273 TraceCheckUtils]: 176: Hoare triple {50786#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50786#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:36,575 INFO L273 TraceCheckUtils]: 177: Hoare triple {50786#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {50787#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:36,575 INFO L273 TraceCheckUtils]: 178: Hoare triple {50787#(<= main_~i~0 43)} assume true; {50787#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:36,576 INFO L273 TraceCheckUtils]: 179: Hoare triple {50787#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50787#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:36,576 INFO L273 TraceCheckUtils]: 180: Hoare triple {50787#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50787#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:36,577 INFO L273 TraceCheckUtils]: 181: Hoare triple {50787#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {50788#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:36,578 INFO L273 TraceCheckUtils]: 182: Hoare triple {50788#(<= main_~i~0 44)} assume true; {50788#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:36,578 INFO L273 TraceCheckUtils]: 183: Hoare triple {50788#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50788#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:36,579 INFO L273 TraceCheckUtils]: 184: Hoare triple {50788#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50788#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:36,579 INFO L273 TraceCheckUtils]: 185: Hoare triple {50788#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {50789#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:36,580 INFO L273 TraceCheckUtils]: 186: Hoare triple {50789#(<= main_~i~0 45)} assume true; {50789#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:36,580 INFO L273 TraceCheckUtils]: 187: Hoare triple {50789#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50789#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:36,581 INFO L273 TraceCheckUtils]: 188: Hoare triple {50789#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50789#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:36,582 INFO L273 TraceCheckUtils]: 189: Hoare triple {50789#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {50790#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:36,582 INFO L273 TraceCheckUtils]: 190: Hoare triple {50790#(<= main_~i~0 46)} assume true; {50790#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:36,583 INFO L273 TraceCheckUtils]: 191: Hoare triple {50790#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50790#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:36,583 INFO L273 TraceCheckUtils]: 192: Hoare triple {50790#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50790#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:36,584 INFO L273 TraceCheckUtils]: 193: Hoare triple {50790#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {50791#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:36,584 INFO L273 TraceCheckUtils]: 194: Hoare triple {50791#(<= main_~i~0 47)} assume true; {50791#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:36,585 INFO L273 TraceCheckUtils]: 195: Hoare triple {50791#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50791#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:36,585 INFO L273 TraceCheckUtils]: 196: Hoare triple {50791#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50791#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:36,586 INFO L273 TraceCheckUtils]: 197: Hoare triple {50791#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {50792#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:36,587 INFO L273 TraceCheckUtils]: 198: Hoare triple {50792#(<= main_~i~0 48)} assume true; {50792#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:36,587 INFO L273 TraceCheckUtils]: 199: Hoare triple {50792#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50792#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:36,587 INFO L273 TraceCheckUtils]: 200: Hoare triple {50792#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50792#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:36,588 INFO L273 TraceCheckUtils]: 201: Hoare triple {50792#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {50793#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:36,589 INFO L273 TraceCheckUtils]: 202: Hoare triple {50793#(<= main_~i~0 49)} assume true; {50793#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:36,589 INFO L273 TraceCheckUtils]: 203: Hoare triple {50793#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50793#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:36,590 INFO L273 TraceCheckUtils]: 204: Hoare triple {50793#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50793#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:36,590 INFO L273 TraceCheckUtils]: 205: Hoare triple {50793#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {50794#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:36,591 INFO L273 TraceCheckUtils]: 206: Hoare triple {50794#(<= main_~i~0 50)} assume true; {50794#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:36,591 INFO L273 TraceCheckUtils]: 207: Hoare triple {50794#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50794#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:36,592 INFO L273 TraceCheckUtils]: 208: Hoare triple {50794#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50794#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:36,593 INFO L273 TraceCheckUtils]: 209: Hoare triple {50794#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {50795#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:36,593 INFO L273 TraceCheckUtils]: 210: Hoare triple {50795#(<= main_~i~0 51)} assume true; {50795#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:36,594 INFO L273 TraceCheckUtils]: 211: Hoare triple {50795#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50795#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:36,594 INFO L273 TraceCheckUtils]: 212: Hoare triple {50795#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50795#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:36,595 INFO L273 TraceCheckUtils]: 213: Hoare triple {50795#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {50796#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:36,595 INFO L273 TraceCheckUtils]: 214: Hoare triple {50796#(<= main_~i~0 52)} assume true; {50796#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:36,596 INFO L273 TraceCheckUtils]: 215: Hoare triple {50796#(<= main_~i~0 52)} assume !(~i~0 < 100000); {50743#false} is VALID [2018-11-18 22:58:36,596 INFO L273 TraceCheckUtils]: 216: Hoare triple {50743#false} havoc ~x~0;~x~0 := 0; {50743#false} is VALID [2018-11-18 22:58:36,596 INFO L273 TraceCheckUtils]: 217: Hoare triple {50743#false} assume true; {50743#false} is VALID [2018-11-18 22:58:36,597 INFO L273 TraceCheckUtils]: 218: Hoare triple {50743#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {50743#false} is VALID [2018-11-18 22:58:36,597 INFO L256 TraceCheckUtils]: 219: Hoare triple {50743#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {50743#false} is VALID [2018-11-18 22:58:36,597 INFO L273 TraceCheckUtils]: 220: Hoare triple {50743#false} ~cond := #in~cond; {50743#false} is VALID [2018-11-18 22:58:36,597 INFO L273 TraceCheckUtils]: 221: Hoare triple {50743#false} assume 0 == ~cond; {50743#false} is VALID [2018-11-18 22:58:36,597 INFO L273 TraceCheckUtils]: 222: Hoare triple {50743#false} assume !false; {50743#false} is VALID [2018-11-18 22:58:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:36,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:36,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2018-11-18 22:58:36,653 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 223 [2018-11-18 22:58:36,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:36,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-18 22:58:36,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:36,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-18 22:58:36,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-18 22:58:36,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 22:58:36,865 INFO L87 Difference]: Start difference. First operand 228 states and 281 transitions. Second operand 56 states. [2018-11-18 22:58:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:38,167 INFO L93 Difference]: Finished difference Result 246 states and 302 transitions. [2018-11-18 22:58:38,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-18 22:58:38,167 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 223 [2018-11-18 22:58:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 22:58:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 302 transitions. [2018-11-18 22:58:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 22:58:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 302 transitions. [2018-11-18 22:58:38,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 302 transitions. [2018-11-18 22:58:38,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:38,464 INFO L225 Difference]: With dead ends: 246 [2018-11-18 22:58:38,464 INFO L226 Difference]: Without dead ends: 234 [2018-11-18 22:58:38,464 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 22:58:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-18 22:58:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-11-18 22:58:38,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:38,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 232 states. [2018-11-18 22:58:38,538 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 232 states. [2018-11-18 22:58:38,538 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 232 states. [2018-11-18 22:58:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:38,542 INFO L93 Difference]: Finished difference Result 234 states and 289 transitions. [2018-11-18 22:58:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 289 transitions. [2018-11-18 22:58:38,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:38,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:38,542 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 234 states. [2018-11-18 22:58:38,542 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 234 states. [2018-11-18 22:58:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:38,546 INFO L93 Difference]: Finished difference Result 234 states and 289 transitions. [2018-11-18 22:58:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 289 transitions. [2018-11-18 22:58:38,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:38,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:38,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:38,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-18 22:58:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 286 transitions. [2018-11-18 22:58:38,550 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 286 transitions. Word has length 223 [2018-11-18 22:58:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:38,550 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 286 transitions. [2018-11-18 22:58:38,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-18 22:58:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 286 transitions. [2018-11-18 22:58:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-18 22:58:38,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:38,552 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:38,552 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:38,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash 448753232, now seen corresponding path program 53 times [2018-11-18 22:58:38,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:38,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:38,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:38,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:38,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:39,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {52537#true} call ULTIMATE.init(); {52537#true} is VALID [2018-11-18 22:58:39,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {52537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52537#true} is VALID [2018-11-18 22:58:39,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {52537#true} assume true; {52537#true} is VALID [2018-11-18 22:58:39,954 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52537#true} {52537#true} #57#return; {52537#true} is VALID [2018-11-18 22:58:39,954 INFO L256 TraceCheckUtils]: 4: Hoare triple {52537#true} call #t~ret4 := main(); {52537#true} is VALID [2018-11-18 22:58:39,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {52537#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {52539#(= main_~i~0 0)} is VALID [2018-11-18 22:58:39,955 INFO L273 TraceCheckUtils]: 6: Hoare triple {52539#(= main_~i~0 0)} assume true; {52539#(= main_~i~0 0)} is VALID [2018-11-18 22:58:39,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {52539#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52539#(= main_~i~0 0)} is VALID [2018-11-18 22:58:39,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {52539#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52539#(= main_~i~0 0)} is VALID [2018-11-18 22:58:39,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {52539#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {52540#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:39,957 INFO L273 TraceCheckUtils]: 10: Hoare triple {52540#(<= main_~i~0 1)} assume true; {52540#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:39,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {52540#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52540#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:39,958 INFO L273 TraceCheckUtils]: 12: Hoare triple {52540#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52540#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:39,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {52540#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {52541#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:39,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {52541#(<= main_~i~0 2)} assume true; {52541#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:39,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {52541#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52541#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:39,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {52541#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52541#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:39,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {52541#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {52542#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:39,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {52542#(<= main_~i~0 3)} assume true; {52542#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:39,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {52542#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52542#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:39,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {52542#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52542#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:39,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {52542#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {52543#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:39,964 INFO L273 TraceCheckUtils]: 22: Hoare triple {52543#(<= main_~i~0 4)} assume true; {52543#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:39,964 INFO L273 TraceCheckUtils]: 23: Hoare triple {52543#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52543#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:39,965 INFO L273 TraceCheckUtils]: 24: Hoare triple {52543#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52543#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:39,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {52543#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {52544#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:39,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {52544#(<= main_~i~0 5)} assume true; {52544#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:39,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {52544#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52544#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:39,967 INFO L273 TraceCheckUtils]: 28: Hoare triple {52544#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52544#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:39,968 INFO L273 TraceCheckUtils]: 29: Hoare triple {52544#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {52545#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:39,968 INFO L273 TraceCheckUtils]: 30: Hoare triple {52545#(<= main_~i~0 6)} assume true; {52545#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:39,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {52545#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52545#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:39,969 INFO L273 TraceCheckUtils]: 32: Hoare triple {52545#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52545#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:39,970 INFO L273 TraceCheckUtils]: 33: Hoare triple {52545#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {52546#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:39,971 INFO L273 TraceCheckUtils]: 34: Hoare triple {52546#(<= main_~i~0 7)} assume true; {52546#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:39,971 INFO L273 TraceCheckUtils]: 35: Hoare triple {52546#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52546#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:39,972 INFO L273 TraceCheckUtils]: 36: Hoare triple {52546#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52546#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:39,972 INFO L273 TraceCheckUtils]: 37: Hoare triple {52546#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {52547#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:39,973 INFO L273 TraceCheckUtils]: 38: Hoare triple {52547#(<= main_~i~0 8)} assume true; {52547#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:39,973 INFO L273 TraceCheckUtils]: 39: Hoare triple {52547#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52547#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:39,974 INFO L273 TraceCheckUtils]: 40: Hoare triple {52547#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52547#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:39,975 INFO L273 TraceCheckUtils]: 41: Hoare triple {52547#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {52548#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:39,975 INFO L273 TraceCheckUtils]: 42: Hoare triple {52548#(<= main_~i~0 9)} assume true; {52548#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:39,976 INFO L273 TraceCheckUtils]: 43: Hoare triple {52548#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52548#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:39,976 INFO L273 TraceCheckUtils]: 44: Hoare triple {52548#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52548#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:39,977 INFO L273 TraceCheckUtils]: 45: Hoare triple {52548#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {52549#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:39,977 INFO L273 TraceCheckUtils]: 46: Hoare triple {52549#(<= main_~i~0 10)} assume true; {52549#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:39,978 INFO L273 TraceCheckUtils]: 47: Hoare triple {52549#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52549#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:39,978 INFO L273 TraceCheckUtils]: 48: Hoare triple {52549#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52549#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:39,979 INFO L273 TraceCheckUtils]: 49: Hoare triple {52549#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {52550#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:39,980 INFO L273 TraceCheckUtils]: 50: Hoare triple {52550#(<= main_~i~0 11)} assume true; {52550#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:39,980 INFO L273 TraceCheckUtils]: 51: Hoare triple {52550#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52550#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:39,980 INFO L273 TraceCheckUtils]: 52: Hoare triple {52550#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52550#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:39,981 INFO L273 TraceCheckUtils]: 53: Hoare triple {52550#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {52551#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:39,982 INFO L273 TraceCheckUtils]: 54: Hoare triple {52551#(<= main_~i~0 12)} assume true; {52551#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:39,982 INFO L273 TraceCheckUtils]: 55: Hoare triple {52551#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52551#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:39,983 INFO L273 TraceCheckUtils]: 56: Hoare triple {52551#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52551#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:39,983 INFO L273 TraceCheckUtils]: 57: Hoare triple {52551#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {52552#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:39,984 INFO L273 TraceCheckUtils]: 58: Hoare triple {52552#(<= main_~i~0 13)} assume true; {52552#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:39,984 INFO L273 TraceCheckUtils]: 59: Hoare triple {52552#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52552#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:39,985 INFO L273 TraceCheckUtils]: 60: Hoare triple {52552#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52552#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:39,986 INFO L273 TraceCheckUtils]: 61: Hoare triple {52552#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {52553#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:39,986 INFO L273 TraceCheckUtils]: 62: Hoare triple {52553#(<= main_~i~0 14)} assume true; {52553#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:39,987 INFO L273 TraceCheckUtils]: 63: Hoare triple {52553#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52553#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:39,987 INFO L273 TraceCheckUtils]: 64: Hoare triple {52553#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52553#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:39,988 INFO L273 TraceCheckUtils]: 65: Hoare triple {52553#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {52554#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:39,988 INFO L273 TraceCheckUtils]: 66: Hoare triple {52554#(<= main_~i~0 15)} assume true; {52554#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:39,989 INFO L273 TraceCheckUtils]: 67: Hoare triple {52554#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52554#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:39,989 INFO L273 TraceCheckUtils]: 68: Hoare triple {52554#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52554#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:39,990 INFO L273 TraceCheckUtils]: 69: Hoare triple {52554#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {52555#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:39,991 INFO L273 TraceCheckUtils]: 70: Hoare triple {52555#(<= main_~i~0 16)} assume true; {52555#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:39,991 INFO L273 TraceCheckUtils]: 71: Hoare triple {52555#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52555#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:39,992 INFO L273 TraceCheckUtils]: 72: Hoare triple {52555#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52555#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:39,992 INFO L273 TraceCheckUtils]: 73: Hoare triple {52555#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {52556#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:39,993 INFO L273 TraceCheckUtils]: 74: Hoare triple {52556#(<= main_~i~0 17)} assume true; {52556#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:39,993 INFO L273 TraceCheckUtils]: 75: Hoare triple {52556#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52556#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:39,994 INFO L273 TraceCheckUtils]: 76: Hoare triple {52556#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52556#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:39,994 INFO L273 TraceCheckUtils]: 77: Hoare triple {52556#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {52557#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:39,995 INFO L273 TraceCheckUtils]: 78: Hoare triple {52557#(<= main_~i~0 18)} assume true; {52557#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:39,995 INFO L273 TraceCheckUtils]: 79: Hoare triple {52557#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52557#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:39,996 INFO L273 TraceCheckUtils]: 80: Hoare triple {52557#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52557#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:39,997 INFO L273 TraceCheckUtils]: 81: Hoare triple {52557#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {52558#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:39,997 INFO L273 TraceCheckUtils]: 82: Hoare triple {52558#(<= main_~i~0 19)} assume true; {52558#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:39,998 INFO L273 TraceCheckUtils]: 83: Hoare triple {52558#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52558#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:39,998 INFO L273 TraceCheckUtils]: 84: Hoare triple {52558#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52558#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:39,999 INFO L273 TraceCheckUtils]: 85: Hoare triple {52558#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {52559#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:39,999 INFO L273 TraceCheckUtils]: 86: Hoare triple {52559#(<= main_~i~0 20)} assume true; {52559#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:40,000 INFO L273 TraceCheckUtils]: 87: Hoare triple {52559#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52559#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:40,000 INFO L273 TraceCheckUtils]: 88: Hoare triple {52559#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52559#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:40,001 INFO L273 TraceCheckUtils]: 89: Hoare triple {52559#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {52560#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:40,002 INFO L273 TraceCheckUtils]: 90: Hoare triple {52560#(<= main_~i~0 21)} assume true; {52560#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:40,002 INFO L273 TraceCheckUtils]: 91: Hoare triple {52560#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52560#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:40,003 INFO L273 TraceCheckUtils]: 92: Hoare triple {52560#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52560#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:40,003 INFO L273 TraceCheckUtils]: 93: Hoare triple {52560#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {52561#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:40,004 INFO L273 TraceCheckUtils]: 94: Hoare triple {52561#(<= main_~i~0 22)} assume true; {52561#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:40,004 INFO L273 TraceCheckUtils]: 95: Hoare triple {52561#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52561#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:40,005 INFO L273 TraceCheckUtils]: 96: Hoare triple {52561#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52561#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:40,006 INFO L273 TraceCheckUtils]: 97: Hoare triple {52561#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {52562#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:40,006 INFO L273 TraceCheckUtils]: 98: Hoare triple {52562#(<= main_~i~0 23)} assume true; {52562#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:40,007 INFO L273 TraceCheckUtils]: 99: Hoare triple {52562#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52562#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:40,007 INFO L273 TraceCheckUtils]: 100: Hoare triple {52562#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52562#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:40,008 INFO L273 TraceCheckUtils]: 101: Hoare triple {52562#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {52563#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:40,008 INFO L273 TraceCheckUtils]: 102: Hoare triple {52563#(<= main_~i~0 24)} assume true; {52563#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:40,009 INFO L273 TraceCheckUtils]: 103: Hoare triple {52563#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52563#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:40,009 INFO L273 TraceCheckUtils]: 104: Hoare triple {52563#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52563#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:40,010 INFO L273 TraceCheckUtils]: 105: Hoare triple {52563#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {52564#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:40,011 INFO L273 TraceCheckUtils]: 106: Hoare triple {52564#(<= main_~i~0 25)} assume true; {52564#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:40,011 INFO L273 TraceCheckUtils]: 107: Hoare triple {52564#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52564#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:40,012 INFO L273 TraceCheckUtils]: 108: Hoare triple {52564#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52564#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:40,012 INFO L273 TraceCheckUtils]: 109: Hoare triple {52564#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {52565#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:40,013 INFO L273 TraceCheckUtils]: 110: Hoare triple {52565#(<= main_~i~0 26)} assume true; {52565#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:40,013 INFO L273 TraceCheckUtils]: 111: Hoare triple {52565#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52565#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:40,014 INFO L273 TraceCheckUtils]: 112: Hoare triple {52565#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52565#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:40,014 INFO L273 TraceCheckUtils]: 113: Hoare triple {52565#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {52566#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:40,015 INFO L273 TraceCheckUtils]: 114: Hoare triple {52566#(<= main_~i~0 27)} assume true; {52566#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:40,015 INFO L273 TraceCheckUtils]: 115: Hoare triple {52566#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52566#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:40,016 INFO L273 TraceCheckUtils]: 116: Hoare triple {52566#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52566#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:40,017 INFO L273 TraceCheckUtils]: 117: Hoare triple {52566#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {52567#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:40,017 INFO L273 TraceCheckUtils]: 118: Hoare triple {52567#(<= main_~i~0 28)} assume true; {52567#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:40,018 INFO L273 TraceCheckUtils]: 119: Hoare triple {52567#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52567#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:40,018 INFO L273 TraceCheckUtils]: 120: Hoare triple {52567#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52567#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:40,019 INFO L273 TraceCheckUtils]: 121: Hoare triple {52567#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {52568#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:40,019 INFO L273 TraceCheckUtils]: 122: Hoare triple {52568#(<= main_~i~0 29)} assume true; {52568#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:40,020 INFO L273 TraceCheckUtils]: 123: Hoare triple {52568#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52568#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:40,020 INFO L273 TraceCheckUtils]: 124: Hoare triple {52568#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52568#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:40,021 INFO L273 TraceCheckUtils]: 125: Hoare triple {52568#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {52569#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:40,022 INFO L273 TraceCheckUtils]: 126: Hoare triple {52569#(<= main_~i~0 30)} assume true; {52569#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:40,022 INFO L273 TraceCheckUtils]: 127: Hoare triple {52569#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52569#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:40,023 INFO L273 TraceCheckUtils]: 128: Hoare triple {52569#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52569#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:40,023 INFO L273 TraceCheckUtils]: 129: Hoare triple {52569#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {52570#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:40,024 INFO L273 TraceCheckUtils]: 130: Hoare triple {52570#(<= main_~i~0 31)} assume true; {52570#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:40,024 INFO L273 TraceCheckUtils]: 131: Hoare triple {52570#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52570#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:40,025 INFO L273 TraceCheckUtils]: 132: Hoare triple {52570#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52570#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:40,025 INFO L273 TraceCheckUtils]: 133: Hoare triple {52570#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {52571#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:40,026 INFO L273 TraceCheckUtils]: 134: Hoare triple {52571#(<= main_~i~0 32)} assume true; {52571#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:40,026 INFO L273 TraceCheckUtils]: 135: Hoare triple {52571#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52571#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:40,027 INFO L273 TraceCheckUtils]: 136: Hoare triple {52571#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52571#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:40,028 INFO L273 TraceCheckUtils]: 137: Hoare triple {52571#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {52572#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:40,028 INFO L273 TraceCheckUtils]: 138: Hoare triple {52572#(<= main_~i~0 33)} assume true; {52572#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:40,029 INFO L273 TraceCheckUtils]: 139: Hoare triple {52572#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52572#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:40,029 INFO L273 TraceCheckUtils]: 140: Hoare triple {52572#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52572#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:40,030 INFO L273 TraceCheckUtils]: 141: Hoare triple {52572#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {52573#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:40,031 INFO L273 TraceCheckUtils]: 142: Hoare triple {52573#(<= main_~i~0 34)} assume true; {52573#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:40,031 INFO L273 TraceCheckUtils]: 143: Hoare triple {52573#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52573#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:40,031 INFO L273 TraceCheckUtils]: 144: Hoare triple {52573#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52573#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:40,032 INFO L273 TraceCheckUtils]: 145: Hoare triple {52573#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {52574#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:40,033 INFO L273 TraceCheckUtils]: 146: Hoare triple {52574#(<= main_~i~0 35)} assume true; {52574#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:40,033 INFO L273 TraceCheckUtils]: 147: Hoare triple {52574#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52574#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:40,034 INFO L273 TraceCheckUtils]: 148: Hoare triple {52574#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52574#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:40,034 INFO L273 TraceCheckUtils]: 149: Hoare triple {52574#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {52575#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:40,035 INFO L273 TraceCheckUtils]: 150: Hoare triple {52575#(<= main_~i~0 36)} assume true; {52575#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:40,035 INFO L273 TraceCheckUtils]: 151: Hoare triple {52575#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52575#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:40,036 INFO L273 TraceCheckUtils]: 152: Hoare triple {52575#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52575#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:40,037 INFO L273 TraceCheckUtils]: 153: Hoare triple {52575#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {52576#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:40,037 INFO L273 TraceCheckUtils]: 154: Hoare triple {52576#(<= main_~i~0 37)} assume true; {52576#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:40,038 INFO L273 TraceCheckUtils]: 155: Hoare triple {52576#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52576#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:40,038 INFO L273 TraceCheckUtils]: 156: Hoare triple {52576#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52576#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:40,039 INFO L273 TraceCheckUtils]: 157: Hoare triple {52576#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {52577#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:40,039 INFO L273 TraceCheckUtils]: 158: Hoare triple {52577#(<= main_~i~0 38)} assume true; {52577#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:40,040 INFO L273 TraceCheckUtils]: 159: Hoare triple {52577#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52577#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:40,040 INFO L273 TraceCheckUtils]: 160: Hoare triple {52577#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52577#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:40,058 INFO L273 TraceCheckUtils]: 161: Hoare triple {52577#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {52578#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:40,064 INFO L273 TraceCheckUtils]: 162: Hoare triple {52578#(<= main_~i~0 39)} assume true; {52578#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:40,066 INFO L273 TraceCheckUtils]: 163: Hoare triple {52578#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52578#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:40,068 INFO L273 TraceCheckUtils]: 164: Hoare triple {52578#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52578#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:40,068 INFO L273 TraceCheckUtils]: 165: Hoare triple {52578#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {52579#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:40,068 INFO L273 TraceCheckUtils]: 166: Hoare triple {52579#(<= main_~i~0 40)} assume true; {52579#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:40,069 INFO L273 TraceCheckUtils]: 167: Hoare triple {52579#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52579#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:40,069 INFO L273 TraceCheckUtils]: 168: Hoare triple {52579#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52579#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:40,069 INFO L273 TraceCheckUtils]: 169: Hoare triple {52579#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {52580#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:40,070 INFO L273 TraceCheckUtils]: 170: Hoare triple {52580#(<= main_~i~0 41)} assume true; {52580#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:40,070 INFO L273 TraceCheckUtils]: 171: Hoare triple {52580#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52580#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:40,070 INFO L273 TraceCheckUtils]: 172: Hoare triple {52580#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52580#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:40,071 INFO L273 TraceCheckUtils]: 173: Hoare triple {52580#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {52581#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:40,072 INFO L273 TraceCheckUtils]: 174: Hoare triple {52581#(<= main_~i~0 42)} assume true; {52581#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:40,072 INFO L273 TraceCheckUtils]: 175: Hoare triple {52581#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52581#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:40,073 INFO L273 TraceCheckUtils]: 176: Hoare triple {52581#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52581#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:40,073 INFO L273 TraceCheckUtils]: 177: Hoare triple {52581#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {52582#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:40,074 INFO L273 TraceCheckUtils]: 178: Hoare triple {52582#(<= main_~i~0 43)} assume true; {52582#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:40,074 INFO L273 TraceCheckUtils]: 179: Hoare triple {52582#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52582#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:40,075 INFO L273 TraceCheckUtils]: 180: Hoare triple {52582#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52582#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:40,076 INFO L273 TraceCheckUtils]: 181: Hoare triple {52582#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {52583#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:40,076 INFO L273 TraceCheckUtils]: 182: Hoare triple {52583#(<= main_~i~0 44)} assume true; {52583#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:40,077 INFO L273 TraceCheckUtils]: 183: Hoare triple {52583#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52583#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:40,077 INFO L273 TraceCheckUtils]: 184: Hoare triple {52583#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52583#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:40,078 INFO L273 TraceCheckUtils]: 185: Hoare triple {52583#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {52584#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:40,078 INFO L273 TraceCheckUtils]: 186: Hoare triple {52584#(<= main_~i~0 45)} assume true; {52584#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:40,079 INFO L273 TraceCheckUtils]: 187: Hoare triple {52584#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52584#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:40,079 INFO L273 TraceCheckUtils]: 188: Hoare triple {52584#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52584#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:40,080 INFO L273 TraceCheckUtils]: 189: Hoare triple {52584#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {52585#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:40,081 INFO L273 TraceCheckUtils]: 190: Hoare triple {52585#(<= main_~i~0 46)} assume true; {52585#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:40,081 INFO L273 TraceCheckUtils]: 191: Hoare triple {52585#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52585#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:40,082 INFO L273 TraceCheckUtils]: 192: Hoare triple {52585#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52585#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:40,082 INFO L273 TraceCheckUtils]: 193: Hoare triple {52585#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {52586#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:40,083 INFO L273 TraceCheckUtils]: 194: Hoare triple {52586#(<= main_~i~0 47)} assume true; {52586#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:40,083 INFO L273 TraceCheckUtils]: 195: Hoare triple {52586#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52586#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:40,084 INFO L273 TraceCheckUtils]: 196: Hoare triple {52586#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52586#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:40,085 INFO L273 TraceCheckUtils]: 197: Hoare triple {52586#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {52587#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:40,085 INFO L273 TraceCheckUtils]: 198: Hoare triple {52587#(<= main_~i~0 48)} assume true; {52587#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:40,086 INFO L273 TraceCheckUtils]: 199: Hoare triple {52587#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52587#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:40,086 INFO L273 TraceCheckUtils]: 200: Hoare triple {52587#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52587#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:40,087 INFO L273 TraceCheckUtils]: 201: Hoare triple {52587#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {52588#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:40,087 INFO L273 TraceCheckUtils]: 202: Hoare triple {52588#(<= main_~i~0 49)} assume true; {52588#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:40,088 INFO L273 TraceCheckUtils]: 203: Hoare triple {52588#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52588#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:40,088 INFO L273 TraceCheckUtils]: 204: Hoare triple {52588#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52588#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:40,089 INFO L273 TraceCheckUtils]: 205: Hoare triple {52588#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {52589#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:40,089 INFO L273 TraceCheckUtils]: 206: Hoare triple {52589#(<= main_~i~0 50)} assume true; {52589#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:40,090 INFO L273 TraceCheckUtils]: 207: Hoare triple {52589#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52589#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:40,090 INFO L273 TraceCheckUtils]: 208: Hoare triple {52589#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52589#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:40,091 INFO L273 TraceCheckUtils]: 209: Hoare triple {52589#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {52590#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:40,092 INFO L273 TraceCheckUtils]: 210: Hoare triple {52590#(<= main_~i~0 51)} assume true; {52590#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:40,092 INFO L273 TraceCheckUtils]: 211: Hoare triple {52590#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52590#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:40,093 INFO L273 TraceCheckUtils]: 212: Hoare triple {52590#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52590#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:40,093 INFO L273 TraceCheckUtils]: 213: Hoare triple {52590#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {52591#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:40,094 INFO L273 TraceCheckUtils]: 214: Hoare triple {52591#(<= main_~i~0 52)} assume true; {52591#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:40,094 INFO L273 TraceCheckUtils]: 215: Hoare triple {52591#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52591#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:40,095 INFO L273 TraceCheckUtils]: 216: Hoare triple {52591#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52591#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:40,096 INFO L273 TraceCheckUtils]: 217: Hoare triple {52591#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {52592#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:40,096 INFO L273 TraceCheckUtils]: 218: Hoare triple {52592#(<= main_~i~0 53)} assume true; {52592#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:40,097 INFO L273 TraceCheckUtils]: 219: Hoare triple {52592#(<= main_~i~0 53)} assume !(~i~0 < 100000); {52538#false} is VALID [2018-11-18 22:58:40,097 INFO L273 TraceCheckUtils]: 220: Hoare triple {52538#false} havoc ~x~0;~x~0 := 0; {52538#false} is VALID [2018-11-18 22:58:40,097 INFO L273 TraceCheckUtils]: 221: Hoare triple {52538#false} assume true; {52538#false} is VALID [2018-11-18 22:58:40,097 INFO L273 TraceCheckUtils]: 222: Hoare triple {52538#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {52538#false} is VALID [2018-11-18 22:58:40,098 INFO L256 TraceCheckUtils]: 223: Hoare triple {52538#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {52538#false} is VALID [2018-11-18 22:58:40,098 INFO L273 TraceCheckUtils]: 224: Hoare triple {52538#false} ~cond := #in~cond; {52538#false} is VALID [2018-11-18 22:58:40,098 INFO L273 TraceCheckUtils]: 225: Hoare triple {52538#false} assume 0 == ~cond; {52538#false} is VALID [2018-11-18 22:58:40,098 INFO L273 TraceCheckUtils]: 226: Hoare triple {52538#false} assume !false; {52538#false} is VALID [2018-11-18 22:58:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:40,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:40,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:40,145 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:58:40,349 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-11-18 22:58:40,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:40,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:40,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {52537#true} call ULTIMATE.init(); {52537#true} is VALID [2018-11-18 22:58:40,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {52537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52537#true} is VALID [2018-11-18 22:58:40,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {52537#true} assume true; {52537#true} is VALID [2018-11-18 22:58:40,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52537#true} {52537#true} #57#return; {52537#true} is VALID [2018-11-18 22:58:40,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {52537#true} call #t~ret4 := main(); {52537#true} is VALID [2018-11-18 22:58:40,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {52537#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {52611#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:40,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {52611#(<= main_~i~0 0)} assume true; {52611#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:40,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {52611#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52611#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:40,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {52611#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52611#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:40,812 INFO L273 TraceCheckUtils]: 9: Hoare triple {52611#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {52540#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:40,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {52540#(<= main_~i~0 1)} assume true; {52540#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:40,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {52540#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52540#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:40,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {52540#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52540#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:40,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {52540#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {52541#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:40,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {52541#(<= main_~i~0 2)} assume true; {52541#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:40,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {52541#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52541#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:40,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {52541#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52541#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:40,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {52541#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {52542#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:40,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {52542#(<= main_~i~0 3)} assume true; {52542#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:40,817 INFO L273 TraceCheckUtils]: 19: Hoare triple {52542#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52542#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:40,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {52542#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52542#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:40,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {52542#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {52543#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:40,818 INFO L273 TraceCheckUtils]: 22: Hoare triple {52543#(<= main_~i~0 4)} assume true; {52543#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:40,819 INFO L273 TraceCheckUtils]: 23: Hoare triple {52543#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52543#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:40,819 INFO L273 TraceCheckUtils]: 24: Hoare triple {52543#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52543#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:40,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {52543#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {52544#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:40,820 INFO L273 TraceCheckUtils]: 26: Hoare triple {52544#(<= main_~i~0 5)} assume true; {52544#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:40,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {52544#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52544#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:40,821 INFO L273 TraceCheckUtils]: 28: Hoare triple {52544#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52544#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:40,822 INFO L273 TraceCheckUtils]: 29: Hoare triple {52544#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {52545#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:40,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {52545#(<= main_~i~0 6)} assume true; {52545#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:40,823 INFO L273 TraceCheckUtils]: 31: Hoare triple {52545#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52545#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:40,824 INFO L273 TraceCheckUtils]: 32: Hoare triple {52545#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52545#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:40,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {52545#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {52546#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:40,825 INFO L273 TraceCheckUtils]: 34: Hoare triple {52546#(<= main_~i~0 7)} assume true; {52546#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:40,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {52546#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52546#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:40,826 INFO L273 TraceCheckUtils]: 36: Hoare triple {52546#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52546#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:40,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {52546#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {52547#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:40,827 INFO L273 TraceCheckUtils]: 38: Hoare triple {52547#(<= main_~i~0 8)} assume true; {52547#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:40,828 INFO L273 TraceCheckUtils]: 39: Hoare triple {52547#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52547#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:40,828 INFO L273 TraceCheckUtils]: 40: Hoare triple {52547#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52547#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:40,829 INFO L273 TraceCheckUtils]: 41: Hoare triple {52547#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {52548#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:40,829 INFO L273 TraceCheckUtils]: 42: Hoare triple {52548#(<= main_~i~0 9)} assume true; {52548#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:40,830 INFO L273 TraceCheckUtils]: 43: Hoare triple {52548#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52548#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:40,830 INFO L273 TraceCheckUtils]: 44: Hoare triple {52548#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52548#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:40,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {52548#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {52549#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:40,831 INFO L273 TraceCheckUtils]: 46: Hoare triple {52549#(<= main_~i~0 10)} assume true; {52549#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:40,832 INFO L273 TraceCheckUtils]: 47: Hoare triple {52549#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52549#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:40,832 INFO L273 TraceCheckUtils]: 48: Hoare triple {52549#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52549#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:40,833 INFO L273 TraceCheckUtils]: 49: Hoare triple {52549#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {52550#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:40,834 INFO L273 TraceCheckUtils]: 50: Hoare triple {52550#(<= main_~i~0 11)} assume true; {52550#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:40,834 INFO L273 TraceCheckUtils]: 51: Hoare triple {52550#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52550#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:40,835 INFO L273 TraceCheckUtils]: 52: Hoare triple {52550#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52550#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:40,835 INFO L273 TraceCheckUtils]: 53: Hoare triple {52550#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {52551#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:40,836 INFO L273 TraceCheckUtils]: 54: Hoare triple {52551#(<= main_~i~0 12)} assume true; {52551#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:40,836 INFO L273 TraceCheckUtils]: 55: Hoare triple {52551#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52551#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:40,837 INFO L273 TraceCheckUtils]: 56: Hoare triple {52551#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52551#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:40,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {52551#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {52552#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:40,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {52552#(<= main_~i~0 13)} assume true; {52552#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:40,839 INFO L273 TraceCheckUtils]: 59: Hoare triple {52552#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52552#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:40,839 INFO L273 TraceCheckUtils]: 60: Hoare triple {52552#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52552#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:40,840 INFO L273 TraceCheckUtils]: 61: Hoare triple {52552#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {52553#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:40,840 INFO L273 TraceCheckUtils]: 62: Hoare triple {52553#(<= main_~i~0 14)} assume true; {52553#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:40,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {52553#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52553#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:40,841 INFO L273 TraceCheckUtils]: 64: Hoare triple {52553#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52553#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:40,842 INFO L273 TraceCheckUtils]: 65: Hoare triple {52553#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {52554#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:40,843 INFO L273 TraceCheckUtils]: 66: Hoare triple {52554#(<= main_~i~0 15)} assume true; {52554#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:40,843 INFO L273 TraceCheckUtils]: 67: Hoare triple {52554#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52554#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:40,843 INFO L273 TraceCheckUtils]: 68: Hoare triple {52554#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52554#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:40,844 INFO L273 TraceCheckUtils]: 69: Hoare triple {52554#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {52555#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:40,845 INFO L273 TraceCheckUtils]: 70: Hoare triple {52555#(<= main_~i~0 16)} assume true; {52555#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:40,845 INFO L273 TraceCheckUtils]: 71: Hoare triple {52555#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52555#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:40,846 INFO L273 TraceCheckUtils]: 72: Hoare triple {52555#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52555#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:40,846 INFO L273 TraceCheckUtils]: 73: Hoare triple {52555#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {52556#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:40,847 INFO L273 TraceCheckUtils]: 74: Hoare triple {52556#(<= main_~i~0 17)} assume true; {52556#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:40,847 INFO L273 TraceCheckUtils]: 75: Hoare triple {52556#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52556#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:40,848 INFO L273 TraceCheckUtils]: 76: Hoare triple {52556#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52556#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:40,849 INFO L273 TraceCheckUtils]: 77: Hoare triple {52556#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {52557#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:40,849 INFO L273 TraceCheckUtils]: 78: Hoare triple {52557#(<= main_~i~0 18)} assume true; {52557#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:40,850 INFO L273 TraceCheckUtils]: 79: Hoare triple {52557#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52557#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:40,850 INFO L273 TraceCheckUtils]: 80: Hoare triple {52557#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52557#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:40,851 INFO L273 TraceCheckUtils]: 81: Hoare triple {52557#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {52558#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:40,851 INFO L273 TraceCheckUtils]: 82: Hoare triple {52558#(<= main_~i~0 19)} assume true; {52558#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:40,852 INFO L273 TraceCheckUtils]: 83: Hoare triple {52558#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52558#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:40,852 INFO L273 TraceCheckUtils]: 84: Hoare triple {52558#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52558#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:40,853 INFO L273 TraceCheckUtils]: 85: Hoare triple {52558#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {52559#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:40,853 INFO L273 TraceCheckUtils]: 86: Hoare triple {52559#(<= main_~i~0 20)} assume true; {52559#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:40,854 INFO L273 TraceCheckUtils]: 87: Hoare triple {52559#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52559#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:40,854 INFO L273 TraceCheckUtils]: 88: Hoare triple {52559#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52559#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:40,855 INFO L273 TraceCheckUtils]: 89: Hoare triple {52559#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {52560#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:40,856 INFO L273 TraceCheckUtils]: 90: Hoare triple {52560#(<= main_~i~0 21)} assume true; {52560#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:40,856 INFO L273 TraceCheckUtils]: 91: Hoare triple {52560#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52560#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:40,857 INFO L273 TraceCheckUtils]: 92: Hoare triple {52560#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52560#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:40,857 INFO L273 TraceCheckUtils]: 93: Hoare triple {52560#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {52561#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:40,858 INFO L273 TraceCheckUtils]: 94: Hoare triple {52561#(<= main_~i~0 22)} assume true; {52561#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:40,858 INFO L273 TraceCheckUtils]: 95: Hoare triple {52561#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52561#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:40,859 INFO L273 TraceCheckUtils]: 96: Hoare triple {52561#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52561#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:40,860 INFO L273 TraceCheckUtils]: 97: Hoare triple {52561#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {52562#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:40,860 INFO L273 TraceCheckUtils]: 98: Hoare triple {52562#(<= main_~i~0 23)} assume true; {52562#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:40,861 INFO L273 TraceCheckUtils]: 99: Hoare triple {52562#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52562#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:40,861 INFO L273 TraceCheckUtils]: 100: Hoare triple {52562#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52562#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:40,862 INFO L273 TraceCheckUtils]: 101: Hoare triple {52562#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {52563#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:40,862 INFO L273 TraceCheckUtils]: 102: Hoare triple {52563#(<= main_~i~0 24)} assume true; {52563#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:40,863 INFO L273 TraceCheckUtils]: 103: Hoare triple {52563#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52563#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:40,863 INFO L273 TraceCheckUtils]: 104: Hoare triple {52563#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52563#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:40,864 INFO L273 TraceCheckUtils]: 105: Hoare triple {52563#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {52564#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:40,865 INFO L273 TraceCheckUtils]: 106: Hoare triple {52564#(<= main_~i~0 25)} assume true; {52564#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:40,865 INFO L273 TraceCheckUtils]: 107: Hoare triple {52564#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52564#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:40,866 INFO L273 TraceCheckUtils]: 108: Hoare triple {52564#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52564#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:40,866 INFO L273 TraceCheckUtils]: 109: Hoare triple {52564#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {52565#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:40,867 INFO L273 TraceCheckUtils]: 110: Hoare triple {52565#(<= main_~i~0 26)} assume true; {52565#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:40,867 INFO L273 TraceCheckUtils]: 111: Hoare triple {52565#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52565#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:40,868 INFO L273 TraceCheckUtils]: 112: Hoare triple {52565#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52565#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:40,868 INFO L273 TraceCheckUtils]: 113: Hoare triple {52565#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {52566#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:40,869 INFO L273 TraceCheckUtils]: 114: Hoare triple {52566#(<= main_~i~0 27)} assume true; {52566#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:40,869 INFO L273 TraceCheckUtils]: 115: Hoare triple {52566#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52566#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:40,870 INFO L273 TraceCheckUtils]: 116: Hoare triple {52566#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52566#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:40,871 INFO L273 TraceCheckUtils]: 117: Hoare triple {52566#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {52567#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:40,871 INFO L273 TraceCheckUtils]: 118: Hoare triple {52567#(<= main_~i~0 28)} assume true; {52567#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:40,872 INFO L273 TraceCheckUtils]: 119: Hoare triple {52567#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52567#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:40,872 INFO L273 TraceCheckUtils]: 120: Hoare triple {52567#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52567#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:40,873 INFO L273 TraceCheckUtils]: 121: Hoare triple {52567#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {52568#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:40,873 INFO L273 TraceCheckUtils]: 122: Hoare triple {52568#(<= main_~i~0 29)} assume true; {52568#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:40,874 INFO L273 TraceCheckUtils]: 123: Hoare triple {52568#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52568#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:40,874 INFO L273 TraceCheckUtils]: 124: Hoare triple {52568#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52568#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:40,875 INFO L273 TraceCheckUtils]: 125: Hoare triple {52568#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {52569#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:40,876 INFO L273 TraceCheckUtils]: 126: Hoare triple {52569#(<= main_~i~0 30)} assume true; {52569#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:40,876 INFO L273 TraceCheckUtils]: 127: Hoare triple {52569#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52569#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:40,877 INFO L273 TraceCheckUtils]: 128: Hoare triple {52569#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52569#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:40,877 INFO L273 TraceCheckUtils]: 129: Hoare triple {52569#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {52570#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:40,878 INFO L273 TraceCheckUtils]: 130: Hoare triple {52570#(<= main_~i~0 31)} assume true; {52570#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:40,878 INFO L273 TraceCheckUtils]: 131: Hoare triple {52570#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52570#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:40,879 INFO L273 TraceCheckUtils]: 132: Hoare triple {52570#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52570#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:40,880 INFO L273 TraceCheckUtils]: 133: Hoare triple {52570#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {52571#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:40,880 INFO L273 TraceCheckUtils]: 134: Hoare triple {52571#(<= main_~i~0 32)} assume true; {52571#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:40,881 INFO L273 TraceCheckUtils]: 135: Hoare triple {52571#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52571#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:40,881 INFO L273 TraceCheckUtils]: 136: Hoare triple {52571#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52571#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:40,882 INFO L273 TraceCheckUtils]: 137: Hoare triple {52571#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {52572#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:40,882 INFO L273 TraceCheckUtils]: 138: Hoare triple {52572#(<= main_~i~0 33)} assume true; {52572#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:40,883 INFO L273 TraceCheckUtils]: 139: Hoare triple {52572#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52572#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:40,883 INFO L273 TraceCheckUtils]: 140: Hoare triple {52572#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52572#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:40,884 INFO L273 TraceCheckUtils]: 141: Hoare triple {52572#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {52573#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:40,884 INFO L273 TraceCheckUtils]: 142: Hoare triple {52573#(<= main_~i~0 34)} assume true; {52573#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:40,885 INFO L273 TraceCheckUtils]: 143: Hoare triple {52573#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52573#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:40,885 INFO L273 TraceCheckUtils]: 144: Hoare triple {52573#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52573#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:40,886 INFO L273 TraceCheckUtils]: 145: Hoare triple {52573#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {52574#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:40,887 INFO L273 TraceCheckUtils]: 146: Hoare triple {52574#(<= main_~i~0 35)} assume true; {52574#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:40,887 INFO L273 TraceCheckUtils]: 147: Hoare triple {52574#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52574#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:40,888 INFO L273 TraceCheckUtils]: 148: Hoare triple {52574#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52574#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:40,888 INFO L273 TraceCheckUtils]: 149: Hoare triple {52574#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {52575#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:40,889 INFO L273 TraceCheckUtils]: 150: Hoare triple {52575#(<= main_~i~0 36)} assume true; {52575#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:40,889 INFO L273 TraceCheckUtils]: 151: Hoare triple {52575#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52575#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:40,890 INFO L273 TraceCheckUtils]: 152: Hoare triple {52575#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52575#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:40,890 INFO L273 TraceCheckUtils]: 153: Hoare triple {52575#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {52576#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:40,891 INFO L273 TraceCheckUtils]: 154: Hoare triple {52576#(<= main_~i~0 37)} assume true; {52576#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:40,892 INFO L273 TraceCheckUtils]: 155: Hoare triple {52576#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52576#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:40,892 INFO L273 TraceCheckUtils]: 156: Hoare triple {52576#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52576#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:40,893 INFO L273 TraceCheckUtils]: 157: Hoare triple {52576#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {52577#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:40,893 INFO L273 TraceCheckUtils]: 158: Hoare triple {52577#(<= main_~i~0 38)} assume true; {52577#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:40,894 INFO L273 TraceCheckUtils]: 159: Hoare triple {52577#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52577#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:40,894 INFO L273 TraceCheckUtils]: 160: Hoare triple {52577#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52577#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:40,895 INFO L273 TraceCheckUtils]: 161: Hoare triple {52577#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {52578#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:40,895 INFO L273 TraceCheckUtils]: 162: Hoare triple {52578#(<= main_~i~0 39)} assume true; {52578#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:40,896 INFO L273 TraceCheckUtils]: 163: Hoare triple {52578#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52578#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:40,896 INFO L273 TraceCheckUtils]: 164: Hoare triple {52578#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52578#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:40,897 INFO L273 TraceCheckUtils]: 165: Hoare triple {52578#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {52579#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:40,898 INFO L273 TraceCheckUtils]: 166: Hoare triple {52579#(<= main_~i~0 40)} assume true; {52579#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:40,898 INFO L273 TraceCheckUtils]: 167: Hoare triple {52579#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52579#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:40,899 INFO L273 TraceCheckUtils]: 168: Hoare triple {52579#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52579#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:40,899 INFO L273 TraceCheckUtils]: 169: Hoare triple {52579#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {52580#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:40,900 INFO L273 TraceCheckUtils]: 170: Hoare triple {52580#(<= main_~i~0 41)} assume true; {52580#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:40,900 INFO L273 TraceCheckUtils]: 171: Hoare triple {52580#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52580#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:40,901 INFO L273 TraceCheckUtils]: 172: Hoare triple {52580#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52580#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:40,902 INFO L273 TraceCheckUtils]: 173: Hoare triple {52580#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {52581#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:40,902 INFO L273 TraceCheckUtils]: 174: Hoare triple {52581#(<= main_~i~0 42)} assume true; {52581#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:40,903 INFO L273 TraceCheckUtils]: 175: Hoare triple {52581#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52581#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:40,903 INFO L273 TraceCheckUtils]: 176: Hoare triple {52581#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52581#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:40,904 INFO L273 TraceCheckUtils]: 177: Hoare triple {52581#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {52582#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:40,904 INFO L273 TraceCheckUtils]: 178: Hoare triple {52582#(<= main_~i~0 43)} assume true; {52582#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:40,905 INFO L273 TraceCheckUtils]: 179: Hoare triple {52582#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52582#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:40,905 INFO L273 TraceCheckUtils]: 180: Hoare triple {52582#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52582#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:40,906 INFO L273 TraceCheckUtils]: 181: Hoare triple {52582#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {52583#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:40,906 INFO L273 TraceCheckUtils]: 182: Hoare triple {52583#(<= main_~i~0 44)} assume true; {52583#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:40,907 INFO L273 TraceCheckUtils]: 183: Hoare triple {52583#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52583#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:40,907 INFO L273 TraceCheckUtils]: 184: Hoare triple {52583#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52583#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:40,908 INFO L273 TraceCheckUtils]: 185: Hoare triple {52583#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {52584#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:40,909 INFO L273 TraceCheckUtils]: 186: Hoare triple {52584#(<= main_~i~0 45)} assume true; {52584#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:40,909 INFO L273 TraceCheckUtils]: 187: Hoare triple {52584#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52584#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:40,910 INFO L273 TraceCheckUtils]: 188: Hoare triple {52584#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52584#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:40,910 INFO L273 TraceCheckUtils]: 189: Hoare triple {52584#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {52585#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:40,911 INFO L273 TraceCheckUtils]: 190: Hoare triple {52585#(<= main_~i~0 46)} assume true; {52585#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:40,911 INFO L273 TraceCheckUtils]: 191: Hoare triple {52585#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52585#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:40,912 INFO L273 TraceCheckUtils]: 192: Hoare triple {52585#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52585#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:40,913 INFO L273 TraceCheckUtils]: 193: Hoare triple {52585#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {52586#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:40,913 INFO L273 TraceCheckUtils]: 194: Hoare triple {52586#(<= main_~i~0 47)} assume true; {52586#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:40,914 INFO L273 TraceCheckUtils]: 195: Hoare triple {52586#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52586#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:40,914 INFO L273 TraceCheckUtils]: 196: Hoare triple {52586#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52586#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:40,915 INFO L273 TraceCheckUtils]: 197: Hoare triple {52586#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {52587#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:40,915 INFO L273 TraceCheckUtils]: 198: Hoare triple {52587#(<= main_~i~0 48)} assume true; {52587#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:40,916 INFO L273 TraceCheckUtils]: 199: Hoare triple {52587#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52587#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:40,916 INFO L273 TraceCheckUtils]: 200: Hoare triple {52587#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52587#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:40,917 INFO L273 TraceCheckUtils]: 201: Hoare triple {52587#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {52588#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:40,918 INFO L273 TraceCheckUtils]: 202: Hoare triple {52588#(<= main_~i~0 49)} assume true; {52588#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:40,918 INFO L273 TraceCheckUtils]: 203: Hoare triple {52588#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52588#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:40,919 INFO L273 TraceCheckUtils]: 204: Hoare triple {52588#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52588#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:40,919 INFO L273 TraceCheckUtils]: 205: Hoare triple {52588#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {52589#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:40,920 INFO L273 TraceCheckUtils]: 206: Hoare triple {52589#(<= main_~i~0 50)} assume true; {52589#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:40,920 INFO L273 TraceCheckUtils]: 207: Hoare triple {52589#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52589#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:40,921 INFO L273 TraceCheckUtils]: 208: Hoare triple {52589#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52589#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:40,921 INFO L273 TraceCheckUtils]: 209: Hoare triple {52589#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {52590#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:40,922 INFO L273 TraceCheckUtils]: 210: Hoare triple {52590#(<= main_~i~0 51)} assume true; {52590#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:40,922 INFO L273 TraceCheckUtils]: 211: Hoare triple {52590#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52590#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:40,923 INFO L273 TraceCheckUtils]: 212: Hoare triple {52590#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52590#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:40,924 INFO L273 TraceCheckUtils]: 213: Hoare triple {52590#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {52591#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:40,924 INFO L273 TraceCheckUtils]: 214: Hoare triple {52591#(<= main_~i~0 52)} assume true; {52591#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:40,925 INFO L273 TraceCheckUtils]: 215: Hoare triple {52591#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52591#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:40,925 INFO L273 TraceCheckUtils]: 216: Hoare triple {52591#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52591#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:40,926 INFO L273 TraceCheckUtils]: 217: Hoare triple {52591#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {52592#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:40,926 INFO L273 TraceCheckUtils]: 218: Hoare triple {52592#(<= main_~i~0 53)} assume true; {52592#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:40,927 INFO L273 TraceCheckUtils]: 219: Hoare triple {52592#(<= main_~i~0 53)} assume !(~i~0 < 100000); {52538#false} is VALID [2018-11-18 22:58:40,927 INFO L273 TraceCheckUtils]: 220: Hoare triple {52538#false} havoc ~x~0;~x~0 := 0; {52538#false} is VALID [2018-11-18 22:58:40,927 INFO L273 TraceCheckUtils]: 221: Hoare triple {52538#false} assume true; {52538#false} is VALID [2018-11-18 22:58:40,928 INFO L273 TraceCheckUtils]: 222: Hoare triple {52538#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {52538#false} is VALID [2018-11-18 22:58:40,928 INFO L256 TraceCheckUtils]: 223: Hoare triple {52538#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {52538#false} is VALID [2018-11-18 22:58:40,928 INFO L273 TraceCheckUtils]: 224: Hoare triple {52538#false} ~cond := #in~cond; {52538#false} is VALID [2018-11-18 22:58:40,928 INFO L273 TraceCheckUtils]: 225: Hoare triple {52538#false} assume 0 == ~cond; {52538#false} is VALID [2018-11-18 22:58:40,928 INFO L273 TraceCheckUtils]: 226: Hoare triple {52538#false} assume !false; {52538#false} is VALID [2018-11-18 22:58:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:40,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:40,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2018-11-18 22:58:40,985 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 227 [2018-11-18 22:58:40,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:40,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-18 22:58:41,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:41,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-18 22:58:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-18 22:58:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-18 22:58:41,206 INFO L87 Difference]: Start difference. First operand 232 states and 286 transitions. Second operand 57 states. [2018-11-18 22:58:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:42,464 INFO L93 Difference]: Finished difference Result 250 states and 307 transitions. [2018-11-18 22:58:42,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-18 22:58:42,464 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 227 [2018-11-18 22:58:42,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 22:58:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 307 transitions. [2018-11-18 22:58:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 22:58:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 307 transitions. [2018-11-18 22:58:42,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 307 transitions. [2018-11-18 22:58:42,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:42,753 INFO L225 Difference]: With dead ends: 250 [2018-11-18 22:58:42,753 INFO L226 Difference]: Without dead ends: 238 [2018-11-18 22:58:42,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-18 22:58:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-18 22:58:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-11-18 22:58:42,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:42,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 236 states. [2018-11-18 22:58:42,803 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 236 states. [2018-11-18 22:58:42,803 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 236 states. [2018-11-18 22:58:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:42,807 INFO L93 Difference]: Finished difference Result 238 states and 294 transitions. [2018-11-18 22:58:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 294 transitions. [2018-11-18 22:58:42,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:42,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:42,807 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 238 states. [2018-11-18 22:58:42,808 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 238 states. [2018-11-18 22:58:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:42,811 INFO L93 Difference]: Finished difference Result 238 states and 294 transitions. [2018-11-18 22:58:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 294 transitions. [2018-11-18 22:58:42,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:42,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:42,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:42,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-18 22:58:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 291 transitions. [2018-11-18 22:58:42,815 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 291 transitions. Word has length 227 [2018-11-18 22:58:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:42,816 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 291 transitions. [2018-11-18 22:58:42,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-18 22:58:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 291 transitions. [2018-11-18 22:58:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-18 22:58:42,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:42,817 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:42,817 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:42,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:42,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1306682022, now seen corresponding path program 54 times [2018-11-18 22:58:42,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:42,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:42,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:42,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:42,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:44,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {54363#true} call ULTIMATE.init(); {54363#true} is VALID [2018-11-18 22:58:44,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {54363#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54363#true} is VALID [2018-11-18 22:58:44,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {54363#true} assume true; {54363#true} is VALID [2018-11-18 22:58:44,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54363#true} {54363#true} #57#return; {54363#true} is VALID [2018-11-18 22:58:44,343 INFO L256 TraceCheckUtils]: 4: Hoare triple {54363#true} call #t~ret4 := main(); {54363#true} is VALID [2018-11-18 22:58:44,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {54363#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {54365#(= main_~i~0 0)} is VALID [2018-11-18 22:58:44,344 INFO L273 TraceCheckUtils]: 6: Hoare triple {54365#(= main_~i~0 0)} assume true; {54365#(= main_~i~0 0)} is VALID [2018-11-18 22:58:44,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {54365#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54365#(= main_~i~0 0)} is VALID [2018-11-18 22:58:44,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {54365#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54365#(= main_~i~0 0)} is VALID [2018-11-18 22:58:44,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {54365#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {54366#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:44,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {54366#(<= main_~i~0 1)} assume true; {54366#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:44,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {54366#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54366#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:44,348 INFO L273 TraceCheckUtils]: 12: Hoare triple {54366#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54366#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:44,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {54366#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {54367#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:44,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {54367#(<= main_~i~0 2)} assume true; {54367#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:44,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {54367#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54367#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:44,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {54367#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54367#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:44,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {54367#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {54368#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:44,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {54368#(<= main_~i~0 3)} assume true; {54368#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:44,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {54368#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54368#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:44,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {54368#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54368#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:44,353 INFO L273 TraceCheckUtils]: 21: Hoare triple {54368#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {54369#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:44,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {54369#(<= main_~i~0 4)} assume true; {54369#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:44,354 INFO L273 TraceCheckUtils]: 23: Hoare triple {54369#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54369#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:44,354 INFO L273 TraceCheckUtils]: 24: Hoare triple {54369#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54369#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:44,355 INFO L273 TraceCheckUtils]: 25: Hoare triple {54369#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {54370#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:44,355 INFO L273 TraceCheckUtils]: 26: Hoare triple {54370#(<= main_~i~0 5)} assume true; {54370#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:44,356 INFO L273 TraceCheckUtils]: 27: Hoare triple {54370#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54370#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:44,356 INFO L273 TraceCheckUtils]: 28: Hoare triple {54370#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54370#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:44,357 INFO L273 TraceCheckUtils]: 29: Hoare triple {54370#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {54371#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:44,358 INFO L273 TraceCheckUtils]: 30: Hoare triple {54371#(<= main_~i~0 6)} assume true; {54371#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:44,358 INFO L273 TraceCheckUtils]: 31: Hoare triple {54371#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54371#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:44,359 INFO L273 TraceCheckUtils]: 32: Hoare triple {54371#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54371#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:44,359 INFO L273 TraceCheckUtils]: 33: Hoare triple {54371#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {54372#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:44,360 INFO L273 TraceCheckUtils]: 34: Hoare triple {54372#(<= main_~i~0 7)} assume true; {54372#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:44,360 INFO L273 TraceCheckUtils]: 35: Hoare triple {54372#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54372#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:44,361 INFO L273 TraceCheckUtils]: 36: Hoare triple {54372#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54372#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:44,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {54372#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {54373#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:44,362 INFO L273 TraceCheckUtils]: 38: Hoare triple {54373#(<= main_~i~0 8)} assume true; {54373#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:44,363 INFO L273 TraceCheckUtils]: 39: Hoare triple {54373#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54373#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:44,363 INFO L273 TraceCheckUtils]: 40: Hoare triple {54373#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54373#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:44,364 INFO L273 TraceCheckUtils]: 41: Hoare triple {54373#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {54374#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:44,364 INFO L273 TraceCheckUtils]: 42: Hoare triple {54374#(<= main_~i~0 9)} assume true; {54374#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:44,365 INFO L273 TraceCheckUtils]: 43: Hoare triple {54374#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54374#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:44,365 INFO L273 TraceCheckUtils]: 44: Hoare triple {54374#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54374#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:44,366 INFO L273 TraceCheckUtils]: 45: Hoare triple {54374#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {54375#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:44,367 INFO L273 TraceCheckUtils]: 46: Hoare triple {54375#(<= main_~i~0 10)} assume true; {54375#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:44,367 INFO L273 TraceCheckUtils]: 47: Hoare triple {54375#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54375#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:44,367 INFO L273 TraceCheckUtils]: 48: Hoare triple {54375#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54375#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:44,368 INFO L273 TraceCheckUtils]: 49: Hoare triple {54375#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {54376#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:44,369 INFO L273 TraceCheckUtils]: 50: Hoare triple {54376#(<= main_~i~0 11)} assume true; {54376#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:44,369 INFO L273 TraceCheckUtils]: 51: Hoare triple {54376#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54376#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:44,370 INFO L273 TraceCheckUtils]: 52: Hoare triple {54376#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54376#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:44,370 INFO L273 TraceCheckUtils]: 53: Hoare triple {54376#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {54377#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:44,371 INFO L273 TraceCheckUtils]: 54: Hoare triple {54377#(<= main_~i~0 12)} assume true; {54377#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:44,371 INFO L273 TraceCheckUtils]: 55: Hoare triple {54377#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54377#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:44,372 INFO L273 TraceCheckUtils]: 56: Hoare triple {54377#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54377#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:44,373 INFO L273 TraceCheckUtils]: 57: Hoare triple {54377#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {54378#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:44,373 INFO L273 TraceCheckUtils]: 58: Hoare triple {54378#(<= main_~i~0 13)} assume true; {54378#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:44,374 INFO L273 TraceCheckUtils]: 59: Hoare triple {54378#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54378#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:44,374 INFO L273 TraceCheckUtils]: 60: Hoare triple {54378#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54378#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:44,375 INFO L273 TraceCheckUtils]: 61: Hoare triple {54378#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {54379#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:44,375 INFO L273 TraceCheckUtils]: 62: Hoare triple {54379#(<= main_~i~0 14)} assume true; {54379#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:44,376 INFO L273 TraceCheckUtils]: 63: Hoare triple {54379#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54379#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:44,376 INFO L273 TraceCheckUtils]: 64: Hoare triple {54379#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54379#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:44,377 INFO L273 TraceCheckUtils]: 65: Hoare triple {54379#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {54380#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:44,378 INFO L273 TraceCheckUtils]: 66: Hoare triple {54380#(<= main_~i~0 15)} assume true; {54380#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:44,378 INFO L273 TraceCheckUtils]: 67: Hoare triple {54380#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54380#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:44,378 INFO L273 TraceCheckUtils]: 68: Hoare triple {54380#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54380#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:44,379 INFO L273 TraceCheckUtils]: 69: Hoare triple {54380#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {54381#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:44,380 INFO L273 TraceCheckUtils]: 70: Hoare triple {54381#(<= main_~i~0 16)} assume true; {54381#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:44,380 INFO L273 TraceCheckUtils]: 71: Hoare triple {54381#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54381#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:44,381 INFO L273 TraceCheckUtils]: 72: Hoare triple {54381#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54381#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:44,381 INFO L273 TraceCheckUtils]: 73: Hoare triple {54381#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {54382#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:44,382 INFO L273 TraceCheckUtils]: 74: Hoare triple {54382#(<= main_~i~0 17)} assume true; {54382#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:44,382 INFO L273 TraceCheckUtils]: 75: Hoare triple {54382#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54382#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:44,383 INFO L273 TraceCheckUtils]: 76: Hoare triple {54382#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54382#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:44,384 INFO L273 TraceCheckUtils]: 77: Hoare triple {54382#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {54383#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:44,384 INFO L273 TraceCheckUtils]: 78: Hoare triple {54383#(<= main_~i~0 18)} assume true; {54383#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:44,385 INFO L273 TraceCheckUtils]: 79: Hoare triple {54383#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54383#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:44,385 INFO L273 TraceCheckUtils]: 80: Hoare triple {54383#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54383#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:44,386 INFO L273 TraceCheckUtils]: 81: Hoare triple {54383#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {54384#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:44,386 INFO L273 TraceCheckUtils]: 82: Hoare triple {54384#(<= main_~i~0 19)} assume true; {54384#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:44,387 INFO L273 TraceCheckUtils]: 83: Hoare triple {54384#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54384#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:44,387 INFO L273 TraceCheckUtils]: 84: Hoare triple {54384#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54384#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:44,388 INFO L273 TraceCheckUtils]: 85: Hoare triple {54384#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {54385#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:44,389 INFO L273 TraceCheckUtils]: 86: Hoare triple {54385#(<= main_~i~0 20)} assume true; {54385#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:44,389 INFO L273 TraceCheckUtils]: 87: Hoare triple {54385#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54385#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:44,390 INFO L273 TraceCheckUtils]: 88: Hoare triple {54385#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54385#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:44,390 INFO L273 TraceCheckUtils]: 89: Hoare triple {54385#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {54386#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:44,391 INFO L273 TraceCheckUtils]: 90: Hoare triple {54386#(<= main_~i~0 21)} assume true; {54386#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:44,391 INFO L273 TraceCheckUtils]: 91: Hoare triple {54386#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54386#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:44,392 INFO L273 TraceCheckUtils]: 92: Hoare triple {54386#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54386#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:44,393 INFO L273 TraceCheckUtils]: 93: Hoare triple {54386#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {54387#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:44,393 INFO L273 TraceCheckUtils]: 94: Hoare triple {54387#(<= main_~i~0 22)} assume true; {54387#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:44,393 INFO L273 TraceCheckUtils]: 95: Hoare triple {54387#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54387#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:44,394 INFO L273 TraceCheckUtils]: 96: Hoare triple {54387#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54387#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:44,395 INFO L273 TraceCheckUtils]: 97: Hoare triple {54387#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {54388#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:44,395 INFO L273 TraceCheckUtils]: 98: Hoare triple {54388#(<= main_~i~0 23)} assume true; {54388#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:44,396 INFO L273 TraceCheckUtils]: 99: Hoare triple {54388#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54388#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:44,396 INFO L273 TraceCheckUtils]: 100: Hoare triple {54388#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54388#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:44,397 INFO L273 TraceCheckUtils]: 101: Hoare triple {54388#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {54389#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:44,397 INFO L273 TraceCheckUtils]: 102: Hoare triple {54389#(<= main_~i~0 24)} assume true; {54389#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:44,398 INFO L273 TraceCheckUtils]: 103: Hoare triple {54389#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54389#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:44,398 INFO L273 TraceCheckUtils]: 104: Hoare triple {54389#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54389#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:44,399 INFO L273 TraceCheckUtils]: 105: Hoare triple {54389#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {54390#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:44,400 INFO L273 TraceCheckUtils]: 106: Hoare triple {54390#(<= main_~i~0 25)} assume true; {54390#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:44,400 INFO L273 TraceCheckUtils]: 107: Hoare triple {54390#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54390#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:44,401 INFO L273 TraceCheckUtils]: 108: Hoare triple {54390#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54390#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:44,401 INFO L273 TraceCheckUtils]: 109: Hoare triple {54390#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {54391#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:44,402 INFO L273 TraceCheckUtils]: 110: Hoare triple {54391#(<= main_~i~0 26)} assume true; {54391#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:44,402 INFO L273 TraceCheckUtils]: 111: Hoare triple {54391#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54391#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:44,403 INFO L273 TraceCheckUtils]: 112: Hoare triple {54391#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54391#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:44,403 INFO L273 TraceCheckUtils]: 113: Hoare triple {54391#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {54392#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:44,404 INFO L273 TraceCheckUtils]: 114: Hoare triple {54392#(<= main_~i~0 27)} assume true; {54392#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:44,404 INFO L273 TraceCheckUtils]: 115: Hoare triple {54392#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54392#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:44,405 INFO L273 TraceCheckUtils]: 116: Hoare triple {54392#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54392#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:44,406 INFO L273 TraceCheckUtils]: 117: Hoare triple {54392#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {54393#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:44,406 INFO L273 TraceCheckUtils]: 118: Hoare triple {54393#(<= main_~i~0 28)} assume true; {54393#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:44,407 INFO L273 TraceCheckUtils]: 119: Hoare triple {54393#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54393#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:44,407 INFO L273 TraceCheckUtils]: 120: Hoare triple {54393#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54393#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:44,408 INFO L273 TraceCheckUtils]: 121: Hoare triple {54393#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {54394#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:44,408 INFO L273 TraceCheckUtils]: 122: Hoare triple {54394#(<= main_~i~0 29)} assume true; {54394#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:44,409 INFO L273 TraceCheckUtils]: 123: Hoare triple {54394#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54394#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:44,409 INFO L273 TraceCheckUtils]: 124: Hoare triple {54394#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54394#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:44,410 INFO L273 TraceCheckUtils]: 125: Hoare triple {54394#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {54395#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:44,411 INFO L273 TraceCheckUtils]: 126: Hoare triple {54395#(<= main_~i~0 30)} assume true; {54395#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:44,411 INFO L273 TraceCheckUtils]: 127: Hoare triple {54395#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54395#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:44,412 INFO L273 TraceCheckUtils]: 128: Hoare triple {54395#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54395#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:44,412 INFO L273 TraceCheckUtils]: 129: Hoare triple {54395#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {54396#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:44,413 INFO L273 TraceCheckUtils]: 130: Hoare triple {54396#(<= main_~i~0 31)} assume true; {54396#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:44,413 INFO L273 TraceCheckUtils]: 131: Hoare triple {54396#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54396#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:44,414 INFO L273 TraceCheckUtils]: 132: Hoare triple {54396#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54396#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:44,415 INFO L273 TraceCheckUtils]: 133: Hoare triple {54396#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {54397#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:44,415 INFO L273 TraceCheckUtils]: 134: Hoare triple {54397#(<= main_~i~0 32)} assume true; {54397#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:44,416 INFO L273 TraceCheckUtils]: 135: Hoare triple {54397#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54397#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:44,416 INFO L273 TraceCheckUtils]: 136: Hoare triple {54397#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54397#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:44,417 INFO L273 TraceCheckUtils]: 137: Hoare triple {54397#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {54398#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:44,417 INFO L273 TraceCheckUtils]: 138: Hoare triple {54398#(<= main_~i~0 33)} assume true; {54398#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:44,418 INFO L273 TraceCheckUtils]: 139: Hoare triple {54398#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54398#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:44,418 INFO L273 TraceCheckUtils]: 140: Hoare triple {54398#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54398#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:44,419 INFO L273 TraceCheckUtils]: 141: Hoare triple {54398#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {54399#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:44,420 INFO L273 TraceCheckUtils]: 142: Hoare triple {54399#(<= main_~i~0 34)} assume true; {54399#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:44,420 INFO L273 TraceCheckUtils]: 143: Hoare triple {54399#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54399#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:44,421 INFO L273 TraceCheckUtils]: 144: Hoare triple {54399#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54399#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:44,421 INFO L273 TraceCheckUtils]: 145: Hoare triple {54399#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {54400#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:44,422 INFO L273 TraceCheckUtils]: 146: Hoare triple {54400#(<= main_~i~0 35)} assume true; {54400#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:44,422 INFO L273 TraceCheckUtils]: 147: Hoare triple {54400#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54400#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:44,423 INFO L273 TraceCheckUtils]: 148: Hoare triple {54400#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54400#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:44,424 INFO L273 TraceCheckUtils]: 149: Hoare triple {54400#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {54401#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:44,424 INFO L273 TraceCheckUtils]: 150: Hoare triple {54401#(<= main_~i~0 36)} assume true; {54401#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:44,425 INFO L273 TraceCheckUtils]: 151: Hoare triple {54401#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54401#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:44,425 INFO L273 TraceCheckUtils]: 152: Hoare triple {54401#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54401#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:44,426 INFO L273 TraceCheckUtils]: 153: Hoare triple {54401#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {54402#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:44,426 INFO L273 TraceCheckUtils]: 154: Hoare triple {54402#(<= main_~i~0 37)} assume true; {54402#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:44,427 INFO L273 TraceCheckUtils]: 155: Hoare triple {54402#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54402#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:44,427 INFO L273 TraceCheckUtils]: 156: Hoare triple {54402#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54402#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:44,428 INFO L273 TraceCheckUtils]: 157: Hoare triple {54402#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {54403#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:44,428 INFO L273 TraceCheckUtils]: 158: Hoare triple {54403#(<= main_~i~0 38)} assume true; {54403#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:44,429 INFO L273 TraceCheckUtils]: 159: Hoare triple {54403#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54403#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:44,429 INFO L273 TraceCheckUtils]: 160: Hoare triple {54403#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54403#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:44,430 INFO L273 TraceCheckUtils]: 161: Hoare triple {54403#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {54404#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:44,431 INFO L273 TraceCheckUtils]: 162: Hoare triple {54404#(<= main_~i~0 39)} assume true; {54404#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:44,431 INFO L273 TraceCheckUtils]: 163: Hoare triple {54404#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54404#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:44,432 INFO L273 TraceCheckUtils]: 164: Hoare triple {54404#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54404#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:44,432 INFO L273 TraceCheckUtils]: 165: Hoare triple {54404#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {54405#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:44,433 INFO L273 TraceCheckUtils]: 166: Hoare triple {54405#(<= main_~i~0 40)} assume true; {54405#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:44,433 INFO L273 TraceCheckUtils]: 167: Hoare triple {54405#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54405#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:44,434 INFO L273 TraceCheckUtils]: 168: Hoare triple {54405#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54405#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:44,435 INFO L273 TraceCheckUtils]: 169: Hoare triple {54405#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {54406#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:44,435 INFO L273 TraceCheckUtils]: 170: Hoare triple {54406#(<= main_~i~0 41)} assume true; {54406#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:44,436 INFO L273 TraceCheckUtils]: 171: Hoare triple {54406#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54406#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:44,436 INFO L273 TraceCheckUtils]: 172: Hoare triple {54406#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54406#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:44,437 INFO L273 TraceCheckUtils]: 173: Hoare triple {54406#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {54407#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:44,437 INFO L273 TraceCheckUtils]: 174: Hoare triple {54407#(<= main_~i~0 42)} assume true; {54407#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:44,438 INFO L273 TraceCheckUtils]: 175: Hoare triple {54407#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54407#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:44,438 INFO L273 TraceCheckUtils]: 176: Hoare triple {54407#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54407#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:44,439 INFO L273 TraceCheckUtils]: 177: Hoare triple {54407#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {54408#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:44,440 INFO L273 TraceCheckUtils]: 178: Hoare triple {54408#(<= main_~i~0 43)} assume true; {54408#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:44,440 INFO L273 TraceCheckUtils]: 179: Hoare triple {54408#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54408#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:44,441 INFO L273 TraceCheckUtils]: 180: Hoare triple {54408#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54408#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:44,441 INFO L273 TraceCheckUtils]: 181: Hoare triple {54408#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {54409#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:44,442 INFO L273 TraceCheckUtils]: 182: Hoare triple {54409#(<= main_~i~0 44)} assume true; {54409#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:44,442 INFO L273 TraceCheckUtils]: 183: Hoare triple {54409#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54409#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:44,443 INFO L273 TraceCheckUtils]: 184: Hoare triple {54409#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54409#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:44,444 INFO L273 TraceCheckUtils]: 185: Hoare triple {54409#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {54410#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:44,444 INFO L273 TraceCheckUtils]: 186: Hoare triple {54410#(<= main_~i~0 45)} assume true; {54410#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:44,445 INFO L273 TraceCheckUtils]: 187: Hoare triple {54410#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54410#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:44,445 INFO L273 TraceCheckUtils]: 188: Hoare triple {54410#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54410#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:44,446 INFO L273 TraceCheckUtils]: 189: Hoare triple {54410#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {54411#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:44,446 INFO L273 TraceCheckUtils]: 190: Hoare triple {54411#(<= main_~i~0 46)} assume true; {54411#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:44,447 INFO L273 TraceCheckUtils]: 191: Hoare triple {54411#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54411#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:44,447 INFO L273 TraceCheckUtils]: 192: Hoare triple {54411#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54411#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:44,448 INFO L273 TraceCheckUtils]: 193: Hoare triple {54411#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {54412#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:44,448 INFO L273 TraceCheckUtils]: 194: Hoare triple {54412#(<= main_~i~0 47)} assume true; {54412#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:44,449 INFO L273 TraceCheckUtils]: 195: Hoare triple {54412#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54412#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:44,449 INFO L273 TraceCheckUtils]: 196: Hoare triple {54412#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54412#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:44,450 INFO L273 TraceCheckUtils]: 197: Hoare triple {54412#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {54413#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:44,451 INFO L273 TraceCheckUtils]: 198: Hoare triple {54413#(<= main_~i~0 48)} assume true; {54413#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:44,451 INFO L273 TraceCheckUtils]: 199: Hoare triple {54413#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54413#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:44,452 INFO L273 TraceCheckUtils]: 200: Hoare triple {54413#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54413#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:44,452 INFO L273 TraceCheckUtils]: 201: Hoare triple {54413#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {54414#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:44,453 INFO L273 TraceCheckUtils]: 202: Hoare triple {54414#(<= main_~i~0 49)} assume true; {54414#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:44,453 INFO L273 TraceCheckUtils]: 203: Hoare triple {54414#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54414#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:44,454 INFO L273 TraceCheckUtils]: 204: Hoare triple {54414#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54414#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:44,455 INFO L273 TraceCheckUtils]: 205: Hoare triple {54414#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {54415#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:44,455 INFO L273 TraceCheckUtils]: 206: Hoare triple {54415#(<= main_~i~0 50)} assume true; {54415#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:44,456 INFO L273 TraceCheckUtils]: 207: Hoare triple {54415#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54415#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:44,456 INFO L273 TraceCheckUtils]: 208: Hoare triple {54415#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54415#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:44,457 INFO L273 TraceCheckUtils]: 209: Hoare triple {54415#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {54416#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:44,457 INFO L273 TraceCheckUtils]: 210: Hoare triple {54416#(<= main_~i~0 51)} assume true; {54416#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:44,458 INFO L273 TraceCheckUtils]: 211: Hoare triple {54416#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54416#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:44,458 INFO L273 TraceCheckUtils]: 212: Hoare triple {54416#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54416#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:44,459 INFO L273 TraceCheckUtils]: 213: Hoare triple {54416#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {54417#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:44,459 INFO L273 TraceCheckUtils]: 214: Hoare triple {54417#(<= main_~i~0 52)} assume true; {54417#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:44,460 INFO L273 TraceCheckUtils]: 215: Hoare triple {54417#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54417#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:44,460 INFO L273 TraceCheckUtils]: 216: Hoare triple {54417#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54417#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:44,461 INFO L273 TraceCheckUtils]: 217: Hoare triple {54417#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {54418#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:44,462 INFO L273 TraceCheckUtils]: 218: Hoare triple {54418#(<= main_~i~0 53)} assume true; {54418#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:44,462 INFO L273 TraceCheckUtils]: 219: Hoare triple {54418#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54418#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:44,463 INFO L273 TraceCheckUtils]: 220: Hoare triple {54418#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54418#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:44,463 INFO L273 TraceCheckUtils]: 221: Hoare triple {54418#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {54419#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:44,464 INFO L273 TraceCheckUtils]: 222: Hoare triple {54419#(<= main_~i~0 54)} assume true; {54419#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:44,465 INFO L273 TraceCheckUtils]: 223: Hoare triple {54419#(<= main_~i~0 54)} assume !(~i~0 < 100000); {54364#false} is VALID [2018-11-18 22:58:44,465 INFO L273 TraceCheckUtils]: 224: Hoare triple {54364#false} havoc ~x~0;~x~0 := 0; {54364#false} is VALID [2018-11-18 22:58:44,465 INFO L273 TraceCheckUtils]: 225: Hoare triple {54364#false} assume true; {54364#false} is VALID [2018-11-18 22:58:44,465 INFO L273 TraceCheckUtils]: 226: Hoare triple {54364#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {54364#false} is VALID [2018-11-18 22:58:44,465 INFO L256 TraceCheckUtils]: 227: Hoare triple {54364#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {54364#false} is VALID [2018-11-18 22:58:44,466 INFO L273 TraceCheckUtils]: 228: Hoare triple {54364#false} ~cond := #in~cond; {54364#false} is VALID [2018-11-18 22:58:44,466 INFO L273 TraceCheckUtils]: 229: Hoare triple {54364#false} assume 0 == ~cond; {54364#false} is VALID [2018-11-18 22:58:44,466 INFO L273 TraceCheckUtils]: 230: Hoare triple {54364#false} assume !false; {54364#false} is VALID [2018-11-18 22:58:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:44,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:44,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:44,515 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:58:44,682 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-11-18 22:58:44,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:44,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:45,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {54363#true} call ULTIMATE.init(); {54363#true} is VALID [2018-11-18 22:58:45,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {54363#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54363#true} is VALID [2018-11-18 22:58:45,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {54363#true} assume true; {54363#true} is VALID [2018-11-18 22:58:45,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54363#true} {54363#true} #57#return; {54363#true} is VALID [2018-11-18 22:58:45,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {54363#true} call #t~ret4 := main(); {54363#true} is VALID [2018-11-18 22:58:45,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {54363#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {54438#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:45,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {54438#(<= main_~i~0 0)} assume true; {54438#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:45,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {54438#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54438#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:45,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {54438#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54438#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:45,228 INFO L273 TraceCheckUtils]: 9: Hoare triple {54438#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {54366#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:45,228 INFO L273 TraceCheckUtils]: 10: Hoare triple {54366#(<= main_~i~0 1)} assume true; {54366#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:45,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {54366#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54366#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:45,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {54366#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54366#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:45,229 INFO L273 TraceCheckUtils]: 13: Hoare triple {54366#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {54367#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:45,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {54367#(<= main_~i~0 2)} assume true; {54367#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:45,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {54367#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54367#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:45,230 INFO L273 TraceCheckUtils]: 16: Hoare triple {54367#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54367#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:45,231 INFO L273 TraceCheckUtils]: 17: Hoare triple {54367#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {54368#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:45,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {54368#(<= main_~i~0 3)} assume true; {54368#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:45,232 INFO L273 TraceCheckUtils]: 19: Hoare triple {54368#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54368#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:45,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {54368#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54368#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:45,233 INFO L273 TraceCheckUtils]: 21: Hoare triple {54368#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {54369#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:45,233 INFO L273 TraceCheckUtils]: 22: Hoare triple {54369#(<= main_~i~0 4)} assume true; {54369#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:45,234 INFO L273 TraceCheckUtils]: 23: Hoare triple {54369#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54369#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:45,234 INFO L273 TraceCheckUtils]: 24: Hoare triple {54369#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54369#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:45,235 INFO L273 TraceCheckUtils]: 25: Hoare triple {54369#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {54370#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:45,235 INFO L273 TraceCheckUtils]: 26: Hoare triple {54370#(<= main_~i~0 5)} assume true; {54370#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:45,236 INFO L273 TraceCheckUtils]: 27: Hoare triple {54370#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54370#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:45,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {54370#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54370#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:45,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {54370#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {54371#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:45,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {54371#(<= main_~i~0 6)} assume true; {54371#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:45,238 INFO L273 TraceCheckUtils]: 31: Hoare triple {54371#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54371#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:45,239 INFO L273 TraceCheckUtils]: 32: Hoare triple {54371#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54371#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:45,239 INFO L273 TraceCheckUtils]: 33: Hoare triple {54371#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {54372#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:45,240 INFO L273 TraceCheckUtils]: 34: Hoare triple {54372#(<= main_~i~0 7)} assume true; {54372#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:45,240 INFO L273 TraceCheckUtils]: 35: Hoare triple {54372#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54372#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:45,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {54372#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54372#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:45,242 INFO L273 TraceCheckUtils]: 37: Hoare triple {54372#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {54373#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:45,242 INFO L273 TraceCheckUtils]: 38: Hoare triple {54373#(<= main_~i~0 8)} assume true; {54373#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:45,243 INFO L273 TraceCheckUtils]: 39: Hoare triple {54373#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54373#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:45,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {54373#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54373#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:45,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {54373#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {54374#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:45,244 INFO L273 TraceCheckUtils]: 42: Hoare triple {54374#(<= main_~i~0 9)} assume true; {54374#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:45,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {54374#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54374#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:45,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {54374#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54374#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:45,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {54374#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {54375#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:45,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {54375#(<= main_~i~0 10)} assume true; {54375#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:45,247 INFO L273 TraceCheckUtils]: 47: Hoare triple {54375#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54375#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:45,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {54375#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54375#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:45,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {54375#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {54376#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:45,249 INFO L273 TraceCheckUtils]: 50: Hoare triple {54376#(<= main_~i~0 11)} assume true; {54376#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:45,249 INFO L273 TraceCheckUtils]: 51: Hoare triple {54376#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54376#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:45,250 INFO L273 TraceCheckUtils]: 52: Hoare triple {54376#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54376#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:45,250 INFO L273 TraceCheckUtils]: 53: Hoare triple {54376#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {54377#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:45,251 INFO L273 TraceCheckUtils]: 54: Hoare triple {54377#(<= main_~i~0 12)} assume true; {54377#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:45,251 INFO L273 TraceCheckUtils]: 55: Hoare triple {54377#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54377#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:45,252 INFO L273 TraceCheckUtils]: 56: Hoare triple {54377#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54377#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:45,253 INFO L273 TraceCheckUtils]: 57: Hoare triple {54377#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {54378#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:45,253 INFO L273 TraceCheckUtils]: 58: Hoare triple {54378#(<= main_~i~0 13)} assume true; {54378#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:45,254 INFO L273 TraceCheckUtils]: 59: Hoare triple {54378#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54378#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:45,254 INFO L273 TraceCheckUtils]: 60: Hoare triple {54378#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54378#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:45,255 INFO L273 TraceCheckUtils]: 61: Hoare triple {54378#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {54379#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:45,255 INFO L273 TraceCheckUtils]: 62: Hoare triple {54379#(<= main_~i~0 14)} assume true; {54379#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:45,256 INFO L273 TraceCheckUtils]: 63: Hoare triple {54379#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54379#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:45,256 INFO L273 TraceCheckUtils]: 64: Hoare triple {54379#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54379#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:45,257 INFO L273 TraceCheckUtils]: 65: Hoare triple {54379#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {54380#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:45,258 INFO L273 TraceCheckUtils]: 66: Hoare triple {54380#(<= main_~i~0 15)} assume true; {54380#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:45,258 INFO L273 TraceCheckUtils]: 67: Hoare triple {54380#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54380#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:45,259 INFO L273 TraceCheckUtils]: 68: Hoare triple {54380#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54380#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:45,259 INFO L273 TraceCheckUtils]: 69: Hoare triple {54380#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {54381#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:45,260 INFO L273 TraceCheckUtils]: 70: Hoare triple {54381#(<= main_~i~0 16)} assume true; {54381#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:45,260 INFO L273 TraceCheckUtils]: 71: Hoare triple {54381#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54381#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:45,261 INFO L273 TraceCheckUtils]: 72: Hoare triple {54381#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54381#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:45,262 INFO L273 TraceCheckUtils]: 73: Hoare triple {54381#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {54382#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:45,262 INFO L273 TraceCheckUtils]: 74: Hoare triple {54382#(<= main_~i~0 17)} assume true; {54382#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:45,262 INFO L273 TraceCheckUtils]: 75: Hoare triple {54382#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54382#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:45,263 INFO L273 TraceCheckUtils]: 76: Hoare triple {54382#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54382#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:45,264 INFO L273 TraceCheckUtils]: 77: Hoare triple {54382#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {54383#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:45,264 INFO L273 TraceCheckUtils]: 78: Hoare triple {54383#(<= main_~i~0 18)} assume true; {54383#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:45,265 INFO L273 TraceCheckUtils]: 79: Hoare triple {54383#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54383#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:45,265 INFO L273 TraceCheckUtils]: 80: Hoare triple {54383#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54383#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:45,266 INFO L273 TraceCheckUtils]: 81: Hoare triple {54383#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {54384#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:45,266 INFO L273 TraceCheckUtils]: 82: Hoare triple {54384#(<= main_~i~0 19)} assume true; {54384#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:45,267 INFO L273 TraceCheckUtils]: 83: Hoare triple {54384#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54384#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:45,267 INFO L273 TraceCheckUtils]: 84: Hoare triple {54384#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54384#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:45,268 INFO L273 TraceCheckUtils]: 85: Hoare triple {54384#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {54385#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:45,269 INFO L273 TraceCheckUtils]: 86: Hoare triple {54385#(<= main_~i~0 20)} assume true; {54385#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:45,269 INFO L273 TraceCheckUtils]: 87: Hoare triple {54385#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54385#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:45,270 INFO L273 TraceCheckUtils]: 88: Hoare triple {54385#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54385#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:45,270 INFO L273 TraceCheckUtils]: 89: Hoare triple {54385#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {54386#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:45,271 INFO L273 TraceCheckUtils]: 90: Hoare triple {54386#(<= main_~i~0 21)} assume true; {54386#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:45,271 INFO L273 TraceCheckUtils]: 91: Hoare triple {54386#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54386#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:45,272 INFO L273 TraceCheckUtils]: 92: Hoare triple {54386#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54386#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:45,272 INFO L273 TraceCheckUtils]: 93: Hoare triple {54386#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {54387#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:45,273 INFO L273 TraceCheckUtils]: 94: Hoare triple {54387#(<= main_~i~0 22)} assume true; {54387#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:45,273 INFO L273 TraceCheckUtils]: 95: Hoare triple {54387#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54387#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:45,274 INFO L273 TraceCheckUtils]: 96: Hoare triple {54387#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54387#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:45,275 INFO L273 TraceCheckUtils]: 97: Hoare triple {54387#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {54388#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:45,275 INFO L273 TraceCheckUtils]: 98: Hoare triple {54388#(<= main_~i~0 23)} assume true; {54388#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:45,276 INFO L273 TraceCheckUtils]: 99: Hoare triple {54388#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54388#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:45,276 INFO L273 TraceCheckUtils]: 100: Hoare triple {54388#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54388#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:45,277 INFO L273 TraceCheckUtils]: 101: Hoare triple {54388#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {54389#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:45,277 INFO L273 TraceCheckUtils]: 102: Hoare triple {54389#(<= main_~i~0 24)} assume true; {54389#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:45,278 INFO L273 TraceCheckUtils]: 103: Hoare triple {54389#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54389#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:45,278 INFO L273 TraceCheckUtils]: 104: Hoare triple {54389#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54389#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:45,279 INFO L273 TraceCheckUtils]: 105: Hoare triple {54389#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {54390#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:45,280 INFO L273 TraceCheckUtils]: 106: Hoare triple {54390#(<= main_~i~0 25)} assume true; {54390#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:45,280 INFO L273 TraceCheckUtils]: 107: Hoare triple {54390#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54390#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:45,281 INFO L273 TraceCheckUtils]: 108: Hoare triple {54390#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54390#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:45,281 INFO L273 TraceCheckUtils]: 109: Hoare triple {54390#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {54391#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:45,282 INFO L273 TraceCheckUtils]: 110: Hoare triple {54391#(<= main_~i~0 26)} assume true; {54391#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:45,282 INFO L273 TraceCheckUtils]: 111: Hoare triple {54391#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54391#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:45,283 INFO L273 TraceCheckUtils]: 112: Hoare triple {54391#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54391#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:45,284 INFO L273 TraceCheckUtils]: 113: Hoare triple {54391#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {54392#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:45,284 INFO L273 TraceCheckUtils]: 114: Hoare triple {54392#(<= main_~i~0 27)} assume true; {54392#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:45,285 INFO L273 TraceCheckUtils]: 115: Hoare triple {54392#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54392#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:45,285 INFO L273 TraceCheckUtils]: 116: Hoare triple {54392#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54392#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:45,286 INFO L273 TraceCheckUtils]: 117: Hoare triple {54392#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {54393#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:45,286 INFO L273 TraceCheckUtils]: 118: Hoare triple {54393#(<= main_~i~0 28)} assume true; {54393#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:45,287 INFO L273 TraceCheckUtils]: 119: Hoare triple {54393#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54393#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:45,287 INFO L273 TraceCheckUtils]: 120: Hoare triple {54393#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54393#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:45,288 INFO L273 TraceCheckUtils]: 121: Hoare triple {54393#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {54394#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:45,288 INFO L273 TraceCheckUtils]: 122: Hoare triple {54394#(<= main_~i~0 29)} assume true; {54394#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:45,289 INFO L273 TraceCheckUtils]: 123: Hoare triple {54394#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54394#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:45,289 INFO L273 TraceCheckUtils]: 124: Hoare triple {54394#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54394#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:45,290 INFO L273 TraceCheckUtils]: 125: Hoare triple {54394#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {54395#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:45,291 INFO L273 TraceCheckUtils]: 126: Hoare triple {54395#(<= main_~i~0 30)} assume true; {54395#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:45,291 INFO L273 TraceCheckUtils]: 127: Hoare triple {54395#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54395#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:45,292 INFO L273 TraceCheckUtils]: 128: Hoare triple {54395#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54395#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:45,292 INFO L273 TraceCheckUtils]: 129: Hoare triple {54395#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {54396#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:45,293 INFO L273 TraceCheckUtils]: 130: Hoare triple {54396#(<= main_~i~0 31)} assume true; {54396#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:45,293 INFO L273 TraceCheckUtils]: 131: Hoare triple {54396#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54396#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:45,294 INFO L273 TraceCheckUtils]: 132: Hoare triple {54396#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54396#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:45,295 INFO L273 TraceCheckUtils]: 133: Hoare triple {54396#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {54397#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:45,295 INFO L273 TraceCheckUtils]: 134: Hoare triple {54397#(<= main_~i~0 32)} assume true; {54397#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:45,296 INFO L273 TraceCheckUtils]: 135: Hoare triple {54397#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54397#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:45,296 INFO L273 TraceCheckUtils]: 136: Hoare triple {54397#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54397#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:45,297 INFO L273 TraceCheckUtils]: 137: Hoare triple {54397#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {54398#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:45,297 INFO L273 TraceCheckUtils]: 138: Hoare triple {54398#(<= main_~i~0 33)} assume true; {54398#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:45,298 INFO L273 TraceCheckUtils]: 139: Hoare triple {54398#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54398#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:45,298 INFO L273 TraceCheckUtils]: 140: Hoare triple {54398#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54398#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:45,299 INFO L273 TraceCheckUtils]: 141: Hoare triple {54398#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {54399#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:45,300 INFO L273 TraceCheckUtils]: 142: Hoare triple {54399#(<= main_~i~0 34)} assume true; {54399#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:45,300 INFO L273 TraceCheckUtils]: 143: Hoare triple {54399#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54399#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:45,300 INFO L273 TraceCheckUtils]: 144: Hoare triple {54399#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54399#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:45,301 INFO L273 TraceCheckUtils]: 145: Hoare triple {54399#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {54400#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:45,302 INFO L273 TraceCheckUtils]: 146: Hoare triple {54400#(<= main_~i~0 35)} assume true; {54400#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:45,302 INFO L273 TraceCheckUtils]: 147: Hoare triple {54400#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54400#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:45,303 INFO L273 TraceCheckUtils]: 148: Hoare triple {54400#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54400#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:45,303 INFO L273 TraceCheckUtils]: 149: Hoare triple {54400#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {54401#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:45,304 INFO L273 TraceCheckUtils]: 150: Hoare triple {54401#(<= main_~i~0 36)} assume true; {54401#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:45,304 INFO L273 TraceCheckUtils]: 151: Hoare triple {54401#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54401#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:45,305 INFO L273 TraceCheckUtils]: 152: Hoare triple {54401#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54401#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:45,306 INFO L273 TraceCheckUtils]: 153: Hoare triple {54401#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {54402#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:45,306 INFO L273 TraceCheckUtils]: 154: Hoare triple {54402#(<= main_~i~0 37)} assume true; {54402#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:45,307 INFO L273 TraceCheckUtils]: 155: Hoare triple {54402#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54402#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:45,307 INFO L273 TraceCheckUtils]: 156: Hoare triple {54402#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54402#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:45,308 INFO L273 TraceCheckUtils]: 157: Hoare triple {54402#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {54403#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:45,308 INFO L273 TraceCheckUtils]: 158: Hoare triple {54403#(<= main_~i~0 38)} assume true; {54403#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:45,309 INFO L273 TraceCheckUtils]: 159: Hoare triple {54403#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54403#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:45,309 INFO L273 TraceCheckUtils]: 160: Hoare triple {54403#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54403#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:45,310 INFO L273 TraceCheckUtils]: 161: Hoare triple {54403#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {54404#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:45,310 INFO L273 TraceCheckUtils]: 162: Hoare triple {54404#(<= main_~i~0 39)} assume true; {54404#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:45,311 INFO L273 TraceCheckUtils]: 163: Hoare triple {54404#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54404#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:45,311 INFO L273 TraceCheckUtils]: 164: Hoare triple {54404#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54404#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:45,312 INFO L273 TraceCheckUtils]: 165: Hoare triple {54404#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {54405#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:45,313 INFO L273 TraceCheckUtils]: 166: Hoare triple {54405#(<= main_~i~0 40)} assume true; {54405#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:45,313 INFO L273 TraceCheckUtils]: 167: Hoare triple {54405#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54405#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:45,314 INFO L273 TraceCheckUtils]: 168: Hoare triple {54405#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54405#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:45,314 INFO L273 TraceCheckUtils]: 169: Hoare triple {54405#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {54406#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:45,315 INFO L273 TraceCheckUtils]: 170: Hoare triple {54406#(<= main_~i~0 41)} assume true; {54406#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:45,315 INFO L273 TraceCheckUtils]: 171: Hoare triple {54406#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54406#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:45,316 INFO L273 TraceCheckUtils]: 172: Hoare triple {54406#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54406#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:45,317 INFO L273 TraceCheckUtils]: 173: Hoare triple {54406#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {54407#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:45,317 INFO L273 TraceCheckUtils]: 174: Hoare triple {54407#(<= main_~i~0 42)} assume true; {54407#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:45,318 INFO L273 TraceCheckUtils]: 175: Hoare triple {54407#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54407#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:45,318 INFO L273 TraceCheckUtils]: 176: Hoare triple {54407#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54407#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:45,319 INFO L273 TraceCheckUtils]: 177: Hoare triple {54407#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {54408#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:45,319 INFO L273 TraceCheckUtils]: 178: Hoare triple {54408#(<= main_~i~0 43)} assume true; {54408#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:45,320 INFO L273 TraceCheckUtils]: 179: Hoare triple {54408#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54408#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:45,320 INFO L273 TraceCheckUtils]: 180: Hoare triple {54408#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54408#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:45,321 INFO L273 TraceCheckUtils]: 181: Hoare triple {54408#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {54409#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:45,322 INFO L273 TraceCheckUtils]: 182: Hoare triple {54409#(<= main_~i~0 44)} assume true; {54409#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:45,322 INFO L273 TraceCheckUtils]: 183: Hoare triple {54409#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54409#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:45,323 INFO L273 TraceCheckUtils]: 184: Hoare triple {54409#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54409#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:45,323 INFO L273 TraceCheckUtils]: 185: Hoare triple {54409#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {54410#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:45,324 INFO L273 TraceCheckUtils]: 186: Hoare triple {54410#(<= main_~i~0 45)} assume true; {54410#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:45,324 INFO L273 TraceCheckUtils]: 187: Hoare triple {54410#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54410#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:45,325 INFO L273 TraceCheckUtils]: 188: Hoare triple {54410#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54410#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:45,325 INFO L273 TraceCheckUtils]: 189: Hoare triple {54410#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {54411#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:45,326 INFO L273 TraceCheckUtils]: 190: Hoare triple {54411#(<= main_~i~0 46)} assume true; {54411#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:45,326 INFO L273 TraceCheckUtils]: 191: Hoare triple {54411#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54411#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:45,327 INFO L273 TraceCheckUtils]: 192: Hoare triple {54411#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54411#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:45,328 INFO L273 TraceCheckUtils]: 193: Hoare triple {54411#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {54412#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:45,328 INFO L273 TraceCheckUtils]: 194: Hoare triple {54412#(<= main_~i~0 47)} assume true; {54412#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:45,329 INFO L273 TraceCheckUtils]: 195: Hoare triple {54412#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54412#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:45,329 INFO L273 TraceCheckUtils]: 196: Hoare triple {54412#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54412#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:45,330 INFO L273 TraceCheckUtils]: 197: Hoare triple {54412#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {54413#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:45,330 INFO L273 TraceCheckUtils]: 198: Hoare triple {54413#(<= main_~i~0 48)} assume true; {54413#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:45,331 INFO L273 TraceCheckUtils]: 199: Hoare triple {54413#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54413#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:45,331 INFO L273 TraceCheckUtils]: 200: Hoare triple {54413#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54413#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:45,332 INFO L273 TraceCheckUtils]: 201: Hoare triple {54413#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {54414#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:45,333 INFO L273 TraceCheckUtils]: 202: Hoare triple {54414#(<= main_~i~0 49)} assume true; {54414#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:45,333 INFO L273 TraceCheckUtils]: 203: Hoare triple {54414#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54414#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:45,334 INFO L273 TraceCheckUtils]: 204: Hoare triple {54414#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54414#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:45,334 INFO L273 TraceCheckUtils]: 205: Hoare triple {54414#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {54415#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:45,335 INFO L273 TraceCheckUtils]: 206: Hoare triple {54415#(<= main_~i~0 50)} assume true; {54415#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:45,335 INFO L273 TraceCheckUtils]: 207: Hoare triple {54415#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54415#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:45,336 INFO L273 TraceCheckUtils]: 208: Hoare triple {54415#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54415#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:45,336 INFO L273 TraceCheckUtils]: 209: Hoare triple {54415#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {54416#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:45,337 INFO L273 TraceCheckUtils]: 210: Hoare triple {54416#(<= main_~i~0 51)} assume true; {54416#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:45,337 INFO L273 TraceCheckUtils]: 211: Hoare triple {54416#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54416#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:45,338 INFO L273 TraceCheckUtils]: 212: Hoare triple {54416#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54416#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:45,339 INFO L273 TraceCheckUtils]: 213: Hoare triple {54416#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {54417#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:45,339 INFO L273 TraceCheckUtils]: 214: Hoare triple {54417#(<= main_~i~0 52)} assume true; {54417#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:45,340 INFO L273 TraceCheckUtils]: 215: Hoare triple {54417#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54417#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:45,340 INFO L273 TraceCheckUtils]: 216: Hoare triple {54417#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54417#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:45,341 INFO L273 TraceCheckUtils]: 217: Hoare triple {54417#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {54418#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:45,341 INFO L273 TraceCheckUtils]: 218: Hoare triple {54418#(<= main_~i~0 53)} assume true; {54418#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:45,342 INFO L273 TraceCheckUtils]: 219: Hoare triple {54418#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54418#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:45,342 INFO L273 TraceCheckUtils]: 220: Hoare triple {54418#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54418#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:45,343 INFO L273 TraceCheckUtils]: 221: Hoare triple {54418#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {54419#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:45,344 INFO L273 TraceCheckUtils]: 222: Hoare triple {54419#(<= main_~i~0 54)} assume true; {54419#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:45,344 INFO L273 TraceCheckUtils]: 223: Hoare triple {54419#(<= main_~i~0 54)} assume !(~i~0 < 100000); {54364#false} is VALID [2018-11-18 22:58:45,345 INFO L273 TraceCheckUtils]: 224: Hoare triple {54364#false} havoc ~x~0;~x~0 := 0; {54364#false} is VALID [2018-11-18 22:58:45,345 INFO L273 TraceCheckUtils]: 225: Hoare triple {54364#false} assume true; {54364#false} is VALID [2018-11-18 22:58:45,345 INFO L273 TraceCheckUtils]: 226: Hoare triple {54364#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {54364#false} is VALID [2018-11-18 22:58:45,345 INFO L256 TraceCheckUtils]: 227: Hoare triple {54364#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {54364#false} is VALID [2018-11-18 22:58:45,345 INFO L273 TraceCheckUtils]: 228: Hoare triple {54364#false} ~cond := #in~cond; {54364#false} is VALID [2018-11-18 22:58:45,345 INFO L273 TraceCheckUtils]: 229: Hoare triple {54364#false} assume 0 == ~cond; {54364#false} is VALID [2018-11-18 22:58:45,346 INFO L273 TraceCheckUtils]: 230: Hoare triple {54364#false} assume !false; {54364#false} is VALID [2018-11-18 22:58:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:45,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:45,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2018-11-18 22:58:45,403 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 231 [2018-11-18 22:58:45,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:45,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2018-11-18 22:58:45,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:45,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-18 22:58:45,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-18 22:58:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-18 22:58:45,634 INFO L87 Difference]: Start difference. First operand 236 states and 291 transitions. Second operand 58 states. [2018-11-18 22:58:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:46,520 INFO L93 Difference]: Finished difference Result 254 states and 312 transitions. [2018-11-18 22:58:46,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-18 22:58:46,520 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 231 [2018-11-18 22:58:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 22:58:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 312 transitions. [2018-11-18 22:58:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 22:58:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 312 transitions. [2018-11-18 22:58:46,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 312 transitions. [2018-11-18 22:58:46,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:46,811 INFO L225 Difference]: With dead ends: 254 [2018-11-18 22:58:46,811 INFO L226 Difference]: Without dead ends: 242 [2018-11-18 22:58:46,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-18 22:58:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-18 22:58:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-11-18 22:58:46,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:46,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand 240 states. [2018-11-18 22:58:46,860 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 240 states. [2018-11-18 22:58:46,860 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 240 states. [2018-11-18 22:58:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:46,864 INFO L93 Difference]: Finished difference Result 242 states and 299 transitions. [2018-11-18 22:58:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 299 transitions. [2018-11-18 22:58:46,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:46,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:46,864 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand 242 states. [2018-11-18 22:58:46,864 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 242 states. [2018-11-18 22:58:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:46,868 INFO L93 Difference]: Finished difference Result 242 states and 299 transitions. [2018-11-18 22:58:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 299 transitions. [2018-11-18 22:58:46,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:46,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:46,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:46,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-18 22:58:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 296 transitions. [2018-11-18 22:58:46,873 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 296 transitions. Word has length 231 [2018-11-18 22:58:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:46,873 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 296 transitions. [2018-11-18 22:58:46,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-18 22:58:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 296 transitions. [2018-11-18 22:58:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-18 22:58:46,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:46,874 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:46,874 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:46,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:46,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1826145284, now seen corresponding path program 55 times [2018-11-18 22:58:46,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:46,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:46,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:46,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:46,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:48,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {56220#true} call ULTIMATE.init(); {56220#true} is VALID [2018-11-18 22:58:48,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {56220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {56220#true} is VALID [2018-11-18 22:58:48,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {56220#true} assume true; {56220#true} is VALID [2018-11-18 22:58:48,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56220#true} {56220#true} #57#return; {56220#true} is VALID [2018-11-18 22:58:48,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {56220#true} call #t~ret4 := main(); {56220#true} is VALID [2018-11-18 22:58:48,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {56220#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {56222#(= main_~i~0 0)} is VALID [2018-11-18 22:58:48,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {56222#(= main_~i~0 0)} assume true; {56222#(= main_~i~0 0)} is VALID [2018-11-18 22:58:48,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {56222#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56222#(= main_~i~0 0)} is VALID [2018-11-18 22:58:48,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {56222#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56222#(= main_~i~0 0)} is VALID [2018-11-18 22:58:48,784 INFO L273 TraceCheckUtils]: 9: Hoare triple {56222#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {56223#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:48,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {56223#(<= main_~i~0 1)} assume true; {56223#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:48,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {56223#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56223#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:48,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {56223#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56223#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:48,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {56223#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {56224#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:48,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {56224#(<= main_~i~0 2)} assume true; {56224#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:48,787 INFO L273 TraceCheckUtils]: 15: Hoare triple {56224#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56224#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:48,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {56224#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56224#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:48,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {56224#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {56225#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:48,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {56225#(<= main_~i~0 3)} assume true; {56225#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:48,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {56225#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56225#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:48,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {56225#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56225#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:48,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {56225#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {56226#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:48,791 INFO L273 TraceCheckUtils]: 22: Hoare triple {56226#(<= main_~i~0 4)} assume true; {56226#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:48,791 INFO L273 TraceCheckUtils]: 23: Hoare triple {56226#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56226#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:48,792 INFO L273 TraceCheckUtils]: 24: Hoare triple {56226#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56226#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:48,793 INFO L273 TraceCheckUtils]: 25: Hoare triple {56226#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {56227#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:48,793 INFO L273 TraceCheckUtils]: 26: Hoare triple {56227#(<= main_~i~0 5)} assume true; {56227#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:48,794 INFO L273 TraceCheckUtils]: 27: Hoare triple {56227#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56227#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:48,794 INFO L273 TraceCheckUtils]: 28: Hoare triple {56227#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56227#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:48,795 INFO L273 TraceCheckUtils]: 29: Hoare triple {56227#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {56228#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:48,795 INFO L273 TraceCheckUtils]: 30: Hoare triple {56228#(<= main_~i~0 6)} assume true; {56228#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:48,796 INFO L273 TraceCheckUtils]: 31: Hoare triple {56228#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56228#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:48,796 INFO L273 TraceCheckUtils]: 32: Hoare triple {56228#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56228#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:48,797 INFO L273 TraceCheckUtils]: 33: Hoare triple {56228#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {56229#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:48,798 INFO L273 TraceCheckUtils]: 34: Hoare triple {56229#(<= main_~i~0 7)} assume true; {56229#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:48,798 INFO L273 TraceCheckUtils]: 35: Hoare triple {56229#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56229#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:48,799 INFO L273 TraceCheckUtils]: 36: Hoare triple {56229#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56229#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:48,799 INFO L273 TraceCheckUtils]: 37: Hoare triple {56229#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {56230#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:48,800 INFO L273 TraceCheckUtils]: 38: Hoare triple {56230#(<= main_~i~0 8)} assume true; {56230#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:48,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {56230#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56230#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:48,801 INFO L273 TraceCheckUtils]: 40: Hoare triple {56230#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56230#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:48,801 INFO L273 TraceCheckUtils]: 41: Hoare triple {56230#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {56231#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:48,802 INFO L273 TraceCheckUtils]: 42: Hoare triple {56231#(<= main_~i~0 9)} assume true; {56231#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:48,802 INFO L273 TraceCheckUtils]: 43: Hoare triple {56231#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56231#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:48,803 INFO L273 TraceCheckUtils]: 44: Hoare triple {56231#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56231#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:48,804 INFO L273 TraceCheckUtils]: 45: Hoare triple {56231#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {56232#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:48,804 INFO L273 TraceCheckUtils]: 46: Hoare triple {56232#(<= main_~i~0 10)} assume true; {56232#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:48,805 INFO L273 TraceCheckUtils]: 47: Hoare triple {56232#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56232#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:48,805 INFO L273 TraceCheckUtils]: 48: Hoare triple {56232#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56232#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:48,806 INFO L273 TraceCheckUtils]: 49: Hoare triple {56232#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {56233#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:48,806 INFO L273 TraceCheckUtils]: 50: Hoare triple {56233#(<= main_~i~0 11)} assume true; {56233#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:48,807 INFO L273 TraceCheckUtils]: 51: Hoare triple {56233#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56233#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:48,807 INFO L273 TraceCheckUtils]: 52: Hoare triple {56233#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56233#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:48,808 INFO L273 TraceCheckUtils]: 53: Hoare triple {56233#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {56234#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:48,809 INFO L273 TraceCheckUtils]: 54: Hoare triple {56234#(<= main_~i~0 12)} assume true; {56234#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:48,809 INFO L273 TraceCheckUtils]: 55: Hoare triple {56234#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56234#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:48,810 INFO L273 TraceCheckUtils]: 56: Hoare triple {56234#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56234#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:48,810 INFO L273 TraceCheckUtils]: 57: Hoare triple {56234#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {56235#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:48,811 INFO L273 TraceCheckUtils]: 58: Hoare triple {56235#(<= main_~i~0 13)} assume true; {56235#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:48,811 INFO L273 TraceCheckUtils]: 59: Hoare triple {56235#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56235#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:48,812 INFO L273 TraceCheckUtils]: 60: Hoare triple {56235#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56235#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:48,812 INFO L273 TraceCheckUtils]: 61: Hoare triple {56235#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {56236#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:48,813 INFO L273 TraceCheckUtils]: 62: Hoare triple {56236#(<= main_~i~0 14)} assume true; {56236#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:48,813 INFO L273 TraceCheckUtils]: 63: Hoare triple {56236#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56236#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:48,814 INFO L273 TraceCheckUtils]: 64: Hoare triple {56236#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56236#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:48,815 INFO L273 TraceCheckUtils]: 65: Hoare triple {56236#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {56237#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:48,815 INFO L273 TraceCheckUtils]: 66: Hoare triple {56237#(<= main_~i~0 15)} assume true; {56237#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:48,816 INFO L273 TraceCheckUtils]: 67: Hoare triple {56237#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56237#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:48,816 INFO L273 TraceCheckUtils]: 68: Hoare triple {56237#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56237#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:48,817 INFO L273 TraceCheckUtils]: 69: Hoare triple {56237#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {56238#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:48,817 INFO L273 TraceCheckUtils]: 70: Hoare triple {56238#(<= main_~i~0 16)} assume true; {56238#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:48,818 INFO L273 TraceCheckUtils]: 71: Hoare triple {56238#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56238#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:48,818 INFO L273 TraceCheckUtils]: 72: Hoare triple {56238#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56238#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:48,819 INFO L273 TraceCheckUtils]: 73: Hoare triple {56238#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {56239#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:48,820 INFO L273 TraceCheckUtils]: 74: Hoare triple {56239#(<= main_~i~0 17)} assume true; {56239#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:48,820 INFO L273 TraceCheckUtils]: 75: Hoare triple {56239#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56239#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:48,821 INFO L273 TraceCheckUtils]: 76: Hoare triple {56239#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56239#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:48,821 INFO L273 TraceCheckUtils]: 77: Hoare triple {56239#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {56240#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:48,822 INFO L273 TraceCheckUtils]: 78: Hoare triple {56240#(<= main_~i~0 18)} assume true; {56240#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:48,822 INFO L273 TraceCheckUtils]: 79: Hoare triple {56240#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56240#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:48,823 INFO L273 TraceCheckUtils]: 80: Hoare triple {56240#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56240#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:48,824 INFO L273 TraceCheckUtils]: 81: Hoare triple {56240#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {56241#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:48,824 INFO L273 TraceCheckUtils]: 82: Hoare triple {56241#(<= main_~i~0 19)} assume true; {56241#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:48,825 INFO L273 TraceCheckUtils]: 83: Hoare triple {56241#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56241#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:48,825 INFO L273 TraceCheckUtils]: 84: Hoare triple {56241#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56241#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:48,826 INFO L273 TraceCheckUtils]: 85: Hoare triple {56241#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {56242#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:48,826 INFO L273 TraceCheckUtils]: 86: Hoare triple {56242#(<= main_~i~0 20)} assume true; {56242#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:48,827 INFO L273 TraceCheckUtils]: 87: Hoare triple {56242#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56242#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:48,827 INFO L273 TraceCheckUtils]: 88: Hoare triple {56242#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56242#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:48,828 INFO L273 TraceCheckUtils]: 89: Hoare triple {56242#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {56243#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:48,829 INFO L273 TraceCheckUtils]: 90: Hoare triple {56243#(<= main_~i~0 21)} assume true; {56243#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:48,829 INFO L273 TraceCheckUtils]: 91: Hoare triple {56243#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56243#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:48,830 INFO L273 TraceCheckUtils]: 92: Hoare triple {56243#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56243#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:48,830 INFO L273 TraceCheckUtils]: 93: Hoare triple {56243#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {56244#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:48,831 INFO L273 TraceCheckUtils]: 94: Hoare triple {56244#(<= main_~i~0 22)} assume true; {56244#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:48,831 INFO L273 TraceCheckUtils]: 95: Hoare triple {56244#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56244#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:48,832 INFO L273 TraceCheckUtils]: 96: Hoare triple {56244#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56244#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:48,832 INFO L273 TraceCheckUtils]: 97: Hoare triple {56244#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {56245#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:48,833 INFO L273 TraceCheckUtils]: 98: Hoare triple {56245#(<= main_~i~0 23)} assume true; {56245#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:48,833 INFO L273 TraceCheckUtils]: 99: Hoare triple {56245#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56245#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:48,834 INFO L273 TraceCheckUtils]: 100: Hoare triple {56245#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56245#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:48,835 INFO L273 TraceCheckUtils]: 101: Hoare triple {56245#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {56246#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:48,835 INFO L273 TraceCheckUtils]: 102: Hoare triple {56246#(<= main_~i~0 24)} assume true; {56246#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:48,836 INFO L273 TraceCheckUtils]: 103: Hoare triple {56246#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56246#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:48,836 INFO L273 TraceCheckUtils]: 104: Hoare triple {56246#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56246#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:48,837 INFO L273 TraceCheckUtils]: 105: Hoare triple {56246#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {56247#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:48,837 INFO L273 TraceCheckUtils]: 106: Hoare triple {56247#(<= main_~i~0 25)} assume true; {56247#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:48,838 INFO L273 TraceCheckUtils]: 107: Hoare triple {56247#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56247#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:48,838 INFO L273 TraceCheckUtils]: 108: Hoare triple {56247#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56247#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:48,839 INFO L273 TraceCheckUtils]: 109: Hoare triple {56247#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {56248#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:48,840 INFO L273 TraceCheckUtils]: 110: Hoare triple {56248#(<= main_~i~0 26)} assume true; {56248#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:48,840 INFO L273 TraceCheckUtils]: 111: Hoare triple {56248#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56248#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:48,841 INFO L273 TraceCheckUtils]: 112: Hoare triple {56248#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56248#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:48,841 INFO L273 TraceCheckUtils]: 113: Hoare triple {56248#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {56249#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:48,842 INFO L273 TraceCheckUtils]: 114: Hoare triple {56249#(<= main_~i~0 27)} assume true; {56249#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:48,842 INFO L273 TraceCheckUtils]: 115: Hoare triple {56249#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56249#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:48,843 INFO L273 TraceCheckUtils]: 116: Hoare triple {56249#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56249#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:48,844 INFO L273 TraceCheckUtils]: 117: Hoare triple {56249#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {56250#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:48,844 INFO L273 TraceCheckUtils]: 118: Hoare triple {56250#(<= main_~i~0 28)} assume true; {56250#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:48,845 INFO L273 TraceCheckUtils]: 119: Hoare triple {56250#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56250#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:48,845 INFO L273 TraceCheckUtils]: 120: Hoare triple {56250#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56250#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:48,846 INFO L273 TraceCheckUtils]: 121: Hoare triple {56250#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {56251#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:48,846 INFO L273 TraceCheckUtils]: 122: Hoare triple {56251#(<= main_~i~0 29)} assume true; {56251#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:48,847 INFO L273 TraceCheckUtils]: 123: Hoare triple {56251#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56251#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:48,847 INFO L273 TraceCheckUtils]: 124: Hoare triple {56251#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56251#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:48,848 INFO L273 TraceCheckUtils]: 125: Hoare triple {56251#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {56252#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:48,848 INFO L273 TraceCheckUtils]: 126: Hoare triple {56252#(<= main_~i~0 30)} assume true; {56252#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:48,849 INFO L273 TraceCheckUtils]: 127: Hoare triple {56252#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56252#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:48,849 INFO L273 TraceCheckUtils]: 128: Hoare triple {56252#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56252#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:48,850 INFO L273 TraceCheckUtils]: 129: Hoare triple {56252#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {56253#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:48,851 INFO L273 TraceCheckUtils]: 130: Hoare triple {56253#(<= main_~i~0 31)} assume true; {56253#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:48,851 INFO L273 TraceCheckUtils]: 131: Hoare triple {56253#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56253#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:48,852 INFO L273 TraceCheckUtils]: 132: Hoare triple {56253#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56253#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:48,852 INFO L273 TraceCheckUtils]: 133: Hoare triple {56253#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {56254#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:48,853 INFO L273 TraceCheckUtils]: 134: Hoare triple {56254#(<= main_~i~0 32)} assume true; {56254#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:48,853 INFO L273 TraceCheckUtils]: 135: Hoare triple {56254#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56254#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:48,854 INFO L273 TraceCheckUtils]: 136: Hoare triple {56254#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56254#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:48,855 INFO L273 TraceCheckUtils]: 137: Hoare triple {56254#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {56255#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:48,855 INFO L273 TraceCheckUtils]: 138: Hoare triple {56255#(<= main_~i~0 33)} assume true; {56255#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:48,856 INFO L273 TraceCheckUtils]: 139: Hoare triple {56255#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56255#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:48,856 INFO L273 TraceCheckUtils]: 140: Hoare triple {56255#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56255#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:48,857 INFO L273 TraceCheckUtils]: 141: Hoare triple {56255#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {56256#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:48,857 INFO L273 TraceCheckUtils]: 142: Hoare triple {56256#(<= main_~i~0 34)} assume true; {56256#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:48,858 INFO L273 TraceCheckUtils]: 143: Hoare triple {56256#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56256#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:48,858 INFO L273 TraceCheckUtils]: 144: Hoare triple {56256#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56256#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:48,859 INFO L273 TraceCheckUtils]: 145: Hoare triple {56256#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {56257#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:48,860 INFO L273 TraceCheckUtils]: 146: Hoare triple {56257#(<= main_~i~0 35)} assume true; {56257#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:48,860 INFO L273 TraceCheckUtils]: 147: Hoare triple {56257#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56257#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:48,860 INFO L273 TraceCheckUtils]: 148: Hoare triple {56257#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56257#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:48,861 INFO L273 TraceCheckUtils]: 149: Hoare triple {56257#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {56258#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:48,862 INFO L273 TraceCheckUtils]: 150: Hoare triple {56258#(<= main_~i~0 36)} assume true; {56258#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:48,862 INFO L273 TraceCheckUtils]: 151: Hoare triple {56258#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56258#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:48,863 INFO L273 TraceCheckUtils]: 152: Hoare triple {56258#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56258#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:48,863 INFO L273 TraceCheckUtils]: 153: Hoare triple {56258#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {56259#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:48,864 INFO L273 TraceCheckUtils]: 154: Hoare triple {56259#(<= main_~i~0 37)} assume true; {56259#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:48,864 INFO L273 TraceCheckUtils]: 155: Hoare triple {56259#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56259#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:48,865 INFO L273 TraceCheckUtils]: 156: Hoare triple {56259#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56259#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:48,866 INFO L273 TraceCheckUtils]: 157: Hoare triple {56259#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {56260#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:48,866 INFO L273 TraceCheckUtils]: 158: Hoare triple {56260#(<= main_~i~0 38)} assume true; {56260#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:48,867 INFO L273 TraceCheckUtils]: 159: Hoare triple {56260#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56260#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:48,867 INFO L273 TraceCheckUtils]: 160: Hoare triple {56260#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56260#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:48,868 INFO L273 TraceCheckUtils]: 161: Hoare triple {56260#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {56261#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:48,868 INFO L273 TraceCheckUtils]: 162: Hoare triple {56261#(<= main_~i~0 39)} assume true; {56261#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:48,869 INFO L273 TraceCheckUtils]: 163: Hoare triple {56261#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56261#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:48,869 INFO L273 TraceCheckUtils]: 164: Hoare triple {56261#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56261#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:48,870 INFO L273 TraceCheckUtils]: 165: Hoare triple {56261#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {56262#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:48,871 INFO L273 TraceCheckUtils]: 166: Hoare triple {56262#(<= main_~i~0 40)} assume true; {56262#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:48,871 INFO L273 TraceCheckUtils]: 167: Hoare triple {56262#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56262#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:48,872 INFO L273 TraceCheckUtils]: 168: Hoare triple {56262#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56262#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:48,872 INFO L273 TraceCheckUtils]: 169: Hoare triple {56262#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {56263#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:48,873 INFO L273 TraceCheckUtils]: 170: Hoare triple {56263#(<= main_~i~0 41)} assume true; {56263#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:48,873 INFO L273 TraceCheckUtils]: 171: Hoare triple {56263#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56263#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:48,874 INFO L273 TraceCheckUtils]: 172: Hoare triple {56263#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56263#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:48,874 INFO L273 TraceCheckUtils]: 173: Hoare triple {56263#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {56264#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:48,875 INFO L273 TraceCheckUtils]: 174: Hoare triple {56264#(<= main_~i~0 42)} assume true; {56264#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:48,875 INFO L273 TraceCheckUtils]: 175: Hoare triple {56264#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56264#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:48,876 INFO L273 TraceCheckUtils]: 176: Hoare triple {56264#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56264#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:48,877 INFO L273 TraceCheckUtils]: 177: Hoare triple {56264#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {56265#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:48,877 INFO L273 TraceCheckUtils]: 178: Hoare triple {56265#(<= main_~i~0 43)} assume true; {56265#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:48,878 INFO L273 TraceCheckUtils]: 179: Hoare triple {56265#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56265#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:48,878 INFO L273 TraceCheckUtils]: 180: Hoare triple {56265#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56265#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:48,879 INFO L273 TraceCheckUtils]: 181: Hoare triple {56265#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {56266#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:48,879 INFO L273 TraceCheckUtils]: 182: Hoare triple {56266#(<= main_~i~0 44)} assume true; {56266#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:48,880 INFO L273 TraceCheckUtils]: 183: Hoare triple {56266#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56266#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:48,880 INFO L273 TraceCheckUtils]: 184: Hoare triple {56266#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56266#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:48,881 INFO L273 TraceCheckUtils]: 185: Hoare triple {56266#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {56267#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:48,882 INFO L273 TraceCheckUtils]: 186: Hoare triple {56267#(<= main_~i~0 45)} assume true; {56267#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:48,882 INFO L273 TraceCheckUtils]: 187: Hoare triple {56267#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56267#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:48,883 INFO L273 TraceCheckUtils]: 188: Hoare triple {56267#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56267#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:48,883 INFO L273 TraceCheckUtils]: 189: Hoare triple {56267#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {56268#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:48,884 INFO L273 TraceCheckUtils]: 190: Hoare triple {56268#(<= main_~i~0 46)} assume true; {56268#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:48,884 INFO L273 TraceCheckUtils]: 191: Hoare triple {56268#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56268#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:48,885 INFO L273 TraceCheckUtils]: 192: Hoare triple {56268#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56268#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:48,886 INFO L273 TraceCheckUtils]: 193: Hoare triple {56268#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {56269#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:48,886 INFO L273 TraceCheckUtils]: 194: Hoare triple {56269#(<= main_~i~0 47)} assume true; {56269#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:48,887 INFO L273 TraceCheckUtils]: 195: Hoare triple {56269#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56269#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:48,887 INFO L273 TraceCheckUtils]: 196: Hoare triple {56269#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56269#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:48,888 INFO L273 TraceCheckUtils]: 197: Hoare triple {56269#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {56270#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:48,888 INFO L273 TraceCheckUtils]: 198: Hoare triple {56270#(<= main_~i~0 48)} assume true; {56270#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:48,889 INFO L273 TraceCheckUtils]: 199: Hoare triple {56270#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56270#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:48,889 INFO L273 TraceCheckUtils]: 200: Hoare triple {56270#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56270#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:48,890 INFO L273 TraceCheckUtils]: 201: Hoare triple {56270#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {56271#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:48,890 INFO L273 TraceCheckUtils]: 202: Hoare triple {56271#(<= main_~i~0 49)} assume true; {56271#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:48,891 INFO L273 TraceCheckUtils]: 203: Hoare triple {56271#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56271#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:48,891 INFO L273 TraceCheckUtils]: 204: Hoare triple {56271#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56271#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:48,892 INFO L273 TraceCheckUtils]: 205: Hoare triple {56271#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {56272#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:48,893 INFO L273 TraceCheckUtils]: 206: Hoare triple {56272#(<= main_~i~0 50)} assume true; {56272#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:48,893 INFO L273 TraceCheckUtils]: 207: Hoare triple {56272#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56272#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:48,894 INFO L273 TraceCheckUtils]: 208: Hoare triple {56272#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56272#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:48,894 INFO L273 TraceCheckUtils]: 209: Hoare triple {56272#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {56273#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:48,895 INFO L273 TraceCheckUtils]: 210: Hoare triple {56273#(<= main_~i~0 51)} assume true; {56273#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:48,895 INFO L273 TraceCheckUtils]: 211: Hoare triple {56273#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56273#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:48,896 INFO L273 TraceCheckUtils]: 212: Hoare triple {56273#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56273#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:48,897 INFO L273 TraceCheckUtils]: 213: Hoare triple {56273#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {56274#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:48,897 INFO L273 TraceCheckUtils]: 214: Hoare triple {56274#(<= main_~i~0 52)} assume true; {56274#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:48,898 INFO L273 TraceCheckUtils]: 215: Hoare triple {56274#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56274#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:48,898 INFO L273 TraceCheckUtils]: 216: Hoare triple {56274#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56274#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:48,899 INFO L273 TraceCheckUtils]: 217: Hoare triple {56274#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {56275#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:48,899 INFO L273 TraceCheckUtils]: 218: Hoare triple {56275#(<= main_~i~0 53)} assume true; {56275#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:48,900 INFO L273 TraceCheckUtils]: 219: Hoare triple {56275#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56275#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:48,900 INFO L273 TraceCheckUtils]: 220: Hoare triple {56275#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56275#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:48,901 INFO L273 TraceCheckUtils]: 221: Hoare triple {56275#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {56276#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:48,902 INFO L273 TraceCheckUtils]: 222: Hoare triple {56276#(<= main_~i~0 54)} assume true; {56276#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:48,902 INFO L273 TraceCheckUtils]: 223: Hoare triple {56276#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56276#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:48,903 INFO L273 TraceCheckUtils]: 224: Hoare triple {56276#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56276#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:48,903 INFO L273 TraceCheckUtils]: 225: Hoare triple {56276#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {56277#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:48,904 INFO L273 TraceCheckUtils]: 226: Hoare triple {56277#(<= main_~i~0 55)} assume true; {56277#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:48,904 INFO L273 TraceCheckUtils]: 227: Hoare triple {56277#(<= main_~i~0 55)} assume !(~i~0 < 100000); {56221#false} is VALID [2018-11-18 22:58:48,905 INFO L273 TraceCheckUtils]: 228: Hoare triple {56221#false} havoc ~x~0;~x~0 := 0; {56221#false} is VALID [2018-11-18 22:58:48,905 INFO L273 TraceCheckUtils]: 229: Hoare triple {56221#false} assume true; {56221#false} is VALID [2018-11-18 22:58:48,905 INFO L273 TraceCheckUtils]: 230: Hoare triple {56221#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {56221#false} is VALID [2018-11-18 22:58:48,905 INFO L256 TraceCheckUtils]: 231: Hoare triple {56221#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {56221#false} is VALID [2018-11-18 22:58:48,905 INFO L273 TraceCheckUtils]: 232: Hoare triple {56221#false} ~cond := #in~cond; {56221#false} is VALID [2018-11-18 22:58:48,905 INFO L273 TraceCheckUtils]: 233: Hoare triple {56221#false} assume 0 == ~cond; {56221#false} is VALID [2018-11-18 22:58:48,906 INFO L273 TraceCheckUtils]: 234: Hoare triple {56221#false} assume !false; {56221#false} is VALID [2018-11-18 22:58:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:48,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:48,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:48,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:58:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:49,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:49,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {56220#true} call ULTIMATE.init(); {56220#true} is VALID [2018-11-18 22:58:49,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {56220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {56220#true} is VALID [2018-11-18 22:58:49,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {56220#true} assume true; {56220#true} is VALID [2018-11-18 22:58:49,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56220#true} {56220#true} #57#return; {56220#true} is VALID [2018-11-18 22:58:49,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {56220#true} call #t~ret4 := main(); {56220#true} is VALID [2018-11-18 22:58:49,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {56220#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {56296#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:49,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {56296#(<= main_~i~0 0)} assume true; {56296#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:49,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {56296#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56296#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:49,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {56296#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56296#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:49,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {56296#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {56223#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:49,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {56223#(<= main_~i~0 1)} assume true; {56223#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:49,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {56223#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56223#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:49,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {56223#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56223#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:49,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {56223#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {56224#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:49,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {56224#(<= main_~i~0 2)} assume true; {56224#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:49,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {56224#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56224#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:49,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {56224#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56224#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:49,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {56224#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {56225#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:49,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {56225#(<= main_~i~0 3)} assume true; {56225#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:49,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {56225#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56225#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:49,504 INFO L273 TraceCheckUtils]: 20: Hoare triple {56225#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56225#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:49,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {56225#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {56226#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:49,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {56226#(<= main_~i~0 4)} assume true; {56226#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:49,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {56226#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56226#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:49,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {56226#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56226#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:49,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {56226#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {56227#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:49,508 INFO L273 TraceCheckUtils]: 26: Hoare triple {56227#(<= main_~i~0 5)} assume true; {56227#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:49,508 INFO L273 TraceCheckUtils]: 27: Hoare triple {56227#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56227#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:49,509 INFO L273 TraceCheckUtils]: 28: Hoare triple {56227#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56227#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:49,510 INFO L273 TraceCheckUtils]: 29: Hoare triple {56227#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {56228#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:49,510 INFO L273 TraceCheckUtils]: 30: Hoare triple {56228#(<= main_~i~0 6)} assume true; {56228#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:49,511 INFO L273 TraceCheckUtils]: 31: Hoare triple {56228#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56228#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:49,511 INFO L273 TraceCheckUtils]: 32: Hoare triple {56228#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56228#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:49,512 INFO L273 TraceCheckUtils]: 33: Hoare triple {56228#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {56229#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:49,512 INFO L273 TraceCheckUtils]: 34: Hoare triple {56229#(<= main_~i~0 7)} assume true; {56229#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:49,513 INFO L273 TraceCheckUtils]: 35: Hoare triple {56229#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56229#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:49,513 INFO L273 TraceCheckUtils]: 36: Hoare triple {56229#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56229#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:49,514 INFO L273 TraceCheckUtils]: 37: Hoare triple {56229#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {56230#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:49,514 INFO L273 TraceCheckUtils]: 38: Hoare triple {56230#(<= main_~i~0 8)} assume true; {56230#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:49,515 INFO L273 TraceCheckUtils]: 39: Hoare triple {56230#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56230#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:49,515 INFO L273 TraceCheckUtils]: 40: Hoare triple {56230#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56230#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:49,516 INFO L273 TraceCheckUtils]: 41: Hoare triple {56230#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {56231#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:49,517 INFO L273 TraceCheckUtils]: 42: Hoare triple {56231#(<= main_~i~0 9)} assume true; {56231#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:49,517 INFO L273 TraceCheckUtils]: 43: Hoare triple {56231#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56231#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:49,518 INFO L273 TraceCheckUtils]: 44: Hoare triple {56231#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56231#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:49,518 INFO L273 TraceCheckUtils]: 45: Hoare triple {56231#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {56232#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:49,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {56232#(<= main_~i~0 10)} assume true; {56232#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:49,519 INFO L273 TraceCheckUtils]: 47: Hoare triple {56232#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56232#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:49,520 INFO L273 TraceCheckUtils]: 48: Hoare triple {56232#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56232#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:49,520 INFO L273 TraceCheckUtils]: 49: Hoare triple {56232#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {56233#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:49,521 INFO L273 TraceCheckUtils]: 50: Hoare triple {56233#(<= main_~i~0 11)} assume true; {56233#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:49,521 INFO L273 TraceCheckUtils]: 51: Hoare triple {56233#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56233#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:49,522 INFO L273 TraceCheckUtils]: 52: Hoare triple {56233#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56233#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:49,523 INFO L273 TraceCheckUtils]: 53: Hoare triple {56233#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {56234#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:49,523 INFO L273 TraceCheckUtils]: 54: Hoare triple {56234#(<= main_~i~0 12)} assume true; {56234#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:49,524 INFO L273 TraceCheckUtils]: 55: Hoare triple {56234#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56234#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:49,524 INFO L273 TraceCheckUtils]: 56: Hoare triple {56234#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56234#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:49,525 INFO L273 TraceCheckUtils]: 57: Hoare triple {56234#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {56235#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:49,525 INFO L273 TraceCheckUtils]: 58: Hoare triple {56235#(<= main_~i~0 13)} assume true; {56235#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:49,526 INFO L273 TraceCheckUtils]: 59: Hoare triple {56235#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56235#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:49,526 INFO L273 TraceCheckUtils]: 60: Hoare triple {56235#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56235#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:49,527 INFO L273 TraceCheckUtils]: 61: Hoare triple {56235#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {56236#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:49,528 INFO L273 TraceCheckUtils]: 62: Hoare triple {56236#(<= main_~i~0 14)} assume true; {56236#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:49,528 INFO L273 TraceCheckUtils]: 63: Hoare triple {56236#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56236#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:49,529 INFO L273 TraceCheckUtils]: 64: Hoare triple {56236#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56236#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:49,529 INFO L273 TraceCheckUtils]: 65: Hoare triple {56236#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {56237#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:49,530 INFO L273 TraceCheckUtils]: 66: Hoare triple {56237#(<= main_~i~0 15)} assume true; {56237#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:49,530 INFO L273 TraceCheckUtils]: 67: Hoare triple {56237#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56237#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:49,531 INFO L273 TraceCheckUtils]: 68: Hoare triple {56237#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56237#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:49,531 INFO L273 TraceCheckUtils]: 69: Hoare triple {56237#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {56238#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:49,532 INFO L273 TraceCheckUtils]: 70: Hoare triple {56238#(<= main_~i~0 16)} assume true; {56238#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:49,532 INFO L273 TraceCheckUtils]: 71: Hoare triple {56238#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56238#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:49,533 INFO L273 TraceCheckUtils]: 72: Hoare triple {56238#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56238#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:49,534 INFO L273 TraceCheckUtils]: 73: Hoare triple {56238#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {56239#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:49,534 INFO L273 TraceCheckUtils]: 74: Hoare triple {56239#(<= main_~i~0 17)} assume true; {56239#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:49,535 INFO L273 TraceCheckUtils]: 75: Hoare triple {56239#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56239#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:49,535 INFO L273 TraceCheckUtils]: 76: Hoare triple {56239#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56239#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:49,536 INFO L273 TraceCheckUtils]: 77: Hoare triple {56239#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {56240#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:49,536 INFO L273 TraceCheckUtils]: 78: Hoare triple {56240#(<= main_~i~0 18)} assume true; {56240#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:49,537 INFO L273 TraceCheckUtils]: 79: Hoare triple {56240#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56240#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:49,537 INFO L273 TraceCheckUtils]: 80: Hoare triple {56240#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56240#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:49,538 INFO L273 TraceCheckUtils]: 81: Hoare triple {56240#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {56241#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:49,539 INFO L273 TraceCheckUtils]: 82: Hoare triple {56241#(<= main_~i~0 19)} assume true; {56241#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:49,539 INFO L273 TraceCheckUtils]: 83: Hoare triple {56241#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56241#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:49,540 INFO L273 TraceCheckUtils]: 84: Hoare triple {56241#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56241#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:49,540 INFO L273 TraceCheckUtils]: 85: Hoare triple {56241#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {56242#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:49,541 INFO L273 TraceCheckUtils]: 86: Hoare triple {56242#(<= main_~i~0 20)} assume true; {56242#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:49,541 INFO L273 TraceCheckUtils]: 87: Hoare triple {56242#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56242#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:49,542 INFO L273 TraceCheckUtils]: 88: Hoare triple {56242#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56242#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:49,542 INFO L273 TraceCheckUtils]: 89: Hoare triple {56242#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {56243#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:49,543 INFO L273 TraceCheckUtils]: 90: Hoare triple {56243#(<= main_~i~0 21)} assume true; {56243#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:49,543 INFO L273 TraceCheckUtils]: 91: Hoare triple {56243#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56243#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:49,544 INFO L273 TraceCheckUtils]: 92: Hoare triple {56243#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56243#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:49,545 INFO L273 TraceCheckUtils]: 93: Hoare triple {56243#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {56244#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:49,545 INFO L273 TraceCheckUtils]: 94: Hoare triple {56244#(<= main_~i~0 22)} assume true; {56244#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:49,546 INFO L273 TraceCheckUtils]: 95: Hoare triple {56244#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56244#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:49,546 INFO L273 TraceCheckUtils]: 96: Hoare triple {56244#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56244#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:49,547 INFO L273 TraceCheckUtils]: 97: Hoare triple {56244#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {56245#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:49,547 INFO L273 TraceCheckUtils]: 98: Hoare triple {56245#(<= main_~i~0 23)} assume true; {56245#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:49,548 INFO L273 TraceCheckUtils]: 99: Hoare triple {56245#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56245#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:49,548 INFO L273 TraceCheckUtils]: 100: Hoare triple {56245#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56245#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:49,549 INFO L273 TraceCheckUtils]: 101: Hoare triple {56245#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {56246#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:49,549 INFO L273 TraceCheckUtils]: 102: Hoare triple {56246#(<= main_~i~0 24)} assume true; {56246#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:49,550 INFO L273 TraceCheckUtils]: 103: Hoare triple {56246#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56246#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:49,550 INFO L273 TraceCheckUtils]: 104: Hoare triple {56246#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56246#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:49,551 INFO L273 TraceCheckUtils]: 105: Hoare triple {56246#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {56247#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:49,552 INFO L273 TraceCheckUtils]: 106: Hoare triple {56247#(<= main_~i~0 25)} assume true; {56247#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:49,552 INFO L273 TraceCheckUtils]: 107: Hoare triple {56247#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56247#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:49,553 INFO L273 TraceCheckUtils]: 108: Hoare triple {56247#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56247#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:49,553 INFO L273 TraceCheckUtils]: 109: Hoare triple {56247#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {56248#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:49,554 INFO L273 TraceCheckUtils]: 110: Hoare triple {56248#(<= main_~i~0 26)} assume true; {56248#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:49,554 INFO L273 TraceCheckUtils]: 111: Hoare triple {56248#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56248#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:49,555 INFO L273 TraceCheckUtils]: 112: Hoare triple {56248#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56248#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:49,556 INFO L273 TraceCheckUtils]: 113: Hoare triple {56248#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {56249#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:49,556 INFO L273 TraceCheckUtils]: 114: Hoare triple {56249#(<= main_~i~0 27)} assume true; {56249#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:49,557 INFO L273 TraceCheckUtils]: 115: Hoare triple {56249#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56249#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:49,557 INFO L273 TraceCheckUtils]: 116: Hoare triple {56249#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56249#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:49,558 INFO L273 TraceCheckUtils]: 117: Hoare triple {56249#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {56250#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:49,558 INFO L273 TraceCheckUtils]: 118: Hoare triple {56250#(<= main_~i~0 28)} assume true; {56250#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:49,559 INFO L273 TraceCheckUtils]: 119: Hoare triple {56250#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56250#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:49,559 INFO L273 TraceCheckUtils]: 120: Hoare triple {56250#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56250#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:49,560 INFO L273 TraceCheckUtils]: 121: Hoare triple {56250#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {56251#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:49,561 INFO L273 TraceCheckUtils]: 122: Hoare triple {56251#(<= main_~i~0 29)} assume true; {56251#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:49,561 INFO L273 TraceCheckUtils]: 123: Hoare triple {56251#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56251#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:49,561 INFO L273 TraceCheckUtils]: 124: Hoare triple {56251#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56251#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:49,562 INFO L273 TraceCheckUtils]: 125: Hoare triple {56251#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {56252#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:49,563 INFO L273 TraceCheckUtils]: 126: Hoare triple {56252#(<= main_~i~0 30)} assume true; {56252#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:49,563 INFO L273 TraceCheckUtils]: 127: Hoare triple {56252#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56252#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:49,564 INFO L273 TraceCheckUtils]: 128: Hoare triple {56252#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56252#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:49,564 INFO L273 TraceCheckUtils]: 129: Hoare triple {56252#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {56253#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:49,565 INFO L273 TraceCheckUtils]: 130: Hoare triple {56253#(<= main_~i~0 31)} assume true; {56253#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:49,565 INFO L273 TraceCheckUtils]: 131: Hoare triple {56253#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56253#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:49,566 INFO L273 TraceCheckUtils]: 132: Hoare triple {56253#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56253#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:49,567 INFO L273 TraceCheckUtils]: 133: Hoare triple {56253#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {56254#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:49,567 INFO L273 TraceCheckUtils]: 134: Hoare triple {56254#(<= main_~i~0 32)} assume true; {56254#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:49,568 INFO L273 TraceCheckUtils]: 135: Hoare triple {56254#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56254#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:49,568 INFO L273 TraceCheckUtils]: 136: Hoare triple {56254#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56254#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:49,569 INFO L273 TraceCheckUtils]: 137: Hoare triple {56254#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {56255#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:49,569 INFO L273 TraceCheckUtils]: 138: Hoare triple {56255#(<= main_~i~0 33)} assume true; {56255#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:49,570 INFO L273 TraceCheckUtils]: 139: Hoare triple {56255#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56255#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:49,570 INFO L273 TraceCheckUtils]: 140: Hoare triple {56255#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56255#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:49,571 INFO L273 TraceCheckUtils]: 141: Hoare triple {56255#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {56256#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:49,571 INFO L273 TraceCheckUtils]: 142: Hoare triple {56256#(<= main_~i~0 34)} assume true; {56256#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:49,572 INFO L273 TraceCheckUtils]: 143: Hoare triple {56256#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56256#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:49,572 INFO L273 TraceCheckUtils]: 144: Hoare triple {56256#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56256#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:49,573 INFO L273 TraceCheckUtils]: 145: Hoare triple {56256#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {56257#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:49,574 INFO L273 TraceCheckUtils]: 146: Hoare triple {56257#(<= main_~i~0 35)} assume true; {56257#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:49,574 INFO L273 TraceCheckUtils]: 147: Hoare triple {56257#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56257#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:49,575 INFO L273 TraceCheckUtils]: 148: Hoare triple {56257#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56257#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:49,575 INFO L273 TraceCheckUtils]: 149: Hoare triple {56257#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {56258#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:49,576 INFO L273 TraceCheckUtils]: 150: Hoare triple {56258#(<= main_~i~0 36)} assume true; {56258#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:49,576 INFO L273 TraceCheckUtils]: 151: Hoare triple {56258#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56258#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:49,577 INFO L273 TraceCheckUtils]: 152: Hoare triple {56258#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56258#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:49,578 INFO L273 TraceCheckUtils]: 153: Hoare triple {56258#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {56259#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:49,578 INFO L273 TraceCheckUtils]: 154: Hoare triple {56259#(<= main_~i~0 37)} assume true; {56259#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:49,579 INFO L273 TraceCheckUtils]: 155: Hoare triple {56259#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56259#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:49,579 INFO L273 TraceCheckUtils]: 156: Hoare triple {56259#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56259#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:49,580 INFO L273 TraceCheckUtils]: 157: Hoare triple {56259#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {56260#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:49,580 INFO L273 TraceCheckUtils]: 158: Hoare triple {56260#(<= main_~i~0 38)} assume true; {56260#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:49,581 INFO L273 TraceCheckUtils]: 159: Hoare triple {56260#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56260#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:49,581 INFO L273 TraceCheckUtils]: 160: Hoare triple {56260#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56260#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:49,582 INFO L273 TraceCheckUtils]: 161: Hoare triple {56260#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {56261#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:49,582 INFO L273 TraceCheckUtils]: 162: Hoare triple {56261#(<= main_~i~0 39)} assume true; {56261#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:49,583 INFO L273 TraceCheckUtils]: 163: Hoare triple {56261#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56261#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:49,583 INFO L273 TraceCheckUtils]: 164: Hoare triple {56261#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56261#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:49,584 INFO L273 TraceCheckUtils]: 165: Hoare triple {56261#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {56262#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:49,585 INFO L273 TraceCheckUtils]: 166: Hoare triple {56262#(<= main_~i~0 40)} assume true; {56262#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:49,585 INFO L273 TraceCheckUtils]: 167: Hoare triple {56262#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56262#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:49,586 INFO L273 TraceCheckUtils]: 168: Hoare triple {56262#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56262#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:49,586 INFO L273 TraceCheckUtils]: 169: Hoare triple {56262#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {56263#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:49,587 INFO L273 TraceCheckUtils]: 170: Hoare triple {56263#(<= main_~i~0 41)} assume true; {56263#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:49,587 INFO L273 TraceCheckUtils]: 171: Hoare triple {56263#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56263#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:49,588 INFO L273 TraceCheckUtils]: 172: Hoare triple {56263#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56263#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:49,589 INFO L273 TraceCheckUtils]: 173: Hoare triple {56263#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {56264#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:49,589 INFO L273 TraceCheckUtils]: 174: Hoare triple {56264#(<= main_~i~0 42)} assume true; {56264#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:49,590 INFO L273 TraceCheckUtils]: 175: Hoare triple {56264#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56264#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:49,590 INFO L273 TraceCheckUtils]: 176: Hoare triple {56264#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56264#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:49,591 INFO L273 TraceCheckUtils]: 177: Hoare triple {56264#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {56265#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:49,591 INFO L273 TraceCheckUtils]: 178: Hoare triple {56265#(<= main_~i~0 43)} assume true; {56265#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:49,592 INFO L273 TraceCheckUtils]: 179: Hoare triple {56265#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56265#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:49,592 INFO L273 TraceCheckUtils]: 180: Hoare triple {56265#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56265#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:49,593 INFO L273 TraceCheckUtils]: 181: Hoare triple {56265#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {56266#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:49,593 INFO L273 TraceCheckUtils]: 182: Hoare triple {56266#(<= main_~i~0 44)} assume true; {56266#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:49,594 INFO L273 TraceCheckUtils]: 183: Hoare triple {56266#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56266#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:49,594 INFO L273 TraceCheckUtils]: 184: Hoare triple {56266#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56266#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:49,595 INFO L273 TraceCheckUtils]: 185: Hoare triple {56266#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {56267#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:49,596 INFO L273 TraceCheckUtils]: 186: Hoare triple {56267#(<= main_~i~0 45)} assume true; {56267#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:49,596 INFO L273 TraceCheckUtils]: 187: Hoare triple {56267#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56267#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:49,597 INFO L273 TraceCheckUtils]: 188: Hoare triple {56267#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56267#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:49,597 INFO L273 TraceCheckUtils]: 189: Hoare triple {56267#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {56268#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:49,598 INFO L273 TraceCheckUtils]: 190: Hoare triple {56268#(<= main_~i~0 46)} assume true; {56268#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:49,598 INFO L273 TraceCheckUtils]: 191: Hoare triple {56268#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56268#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:49,599 INFO L273 TraceCheckUtils]: 192: Hoare triple {56268#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56268#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:49,600 INFO L273 TraceCheckUtils]: 193: Hoare triple {56268#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {56269#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:49,600 INFO L273 TraceCheckUtils]: 194: Hoare triple {56269#(<= main_~i~0 47)} assume true; {56269#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:49,601 INFO L273 TraceCheckUtils]: 195: Hoare triple {56269#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56269#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:49,601 INFO L273 TraceCheckUtils]: 196: Hoare triple {56269#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56269#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:49,602 INFO L273 TraceCheckUtils]: 197: Hoare triple {56269#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {56270#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:49,602 INFO L273 TraceCheckUtils]: 198: Hoare triple {56270#(<= main_~i~0 48)} assume true; {56270#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:49,603 INFO L273 TraceCheckUtils]: 199: Hoare triple {56270#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56270#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:49,603 INFO L273 TraceCheckUtils]: 200: Hoare triple {56270#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56270#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:49,604 INFO L273 TraceCheckUtils]: 201: Hoare triple {56270#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {56271#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:49,604 INFO L273 TraceCheckUtils]: 202: Hoare triple {56271#(<= main_~i~0 49)} assume true; {56271#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:49,605 INFO L273 TraceCheckUtils]: 203: Hoare triple {56271#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56271#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:49,605 INFO L273 TraceCheckUtils]: 204: Hoare triple {56271#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56271#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:49,606 INFO L273 TraceCheckUtils]: 205: Hoare triple {56271#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {56272#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:49,607 INFO L273 TraceCheckUtils]: 206: Hoare triple {56272#(<= main_~i~0 50)} assume true; {56272#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:49,607 INFO L273 TraceCheckUtils]: 207: Hoare triple {56272#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56272#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:49,608 INFO L273 TraceCheckUtils]: 208: Hoare triple {56272#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56272#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:49,608 INFO L273 TraceCheckUtils]: 209: Hoare triple {56272#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {56273#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:49,609 INFO L273 TraceCheckUtils]: 210: Hoare triple {56273#(<= main_~i~0 51)} assume true; {56273#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:49,609 INFO L273 TraceCheckUtils]: 211: Hoare triple {56273#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56273#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:49,610 INFO L273 TraceCheckUtils]: 212: Hoare triple {56273#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56273#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:49,611 INFO L273 TraceCheckUtils]: 213: Hoare triple {56273#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {56274#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:49,611 INFO L273 TraceCheckUtils]: 214: Hoare triple {56274#(<= main_~i~0 52)} assume true; {56274#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:49,612 INFO L273 TraceCheckUtils]: 215: Hoare triple {56274#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56274#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:49,612 INFO L273 TraceCheckUtils]: 216: Hoare triple {56274#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56274#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:49,613 INFO L273 TraceCheckUtils]: 217: Hoare triple {56274#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {56275#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:49,613 INFO L273 TraceCheckUtils]: 218: Hoare triple {56275#(<= main_~i~0 53)} assume true; {56275#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:49,614 INFO L273 TraceCheckUtils]: 219: Hoare triple {56275#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56275#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:49,614 INFO L273 TraceCheckUtils]: 220: Hoare triple {56275#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56275#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:49,615 INFO L273 TraceCheckUtils]: 221: Hoare triple {56275#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {56276#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:49,615 INFO L273 TraceCheckUtils]: 222: Hoare triple {56276#(<= main_~i~0 54)} assume true; {56276#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:49,616 INFO L273 TraceCheckUtils]: 223: Hoare triple {56276#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56276#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:49,616 INFO L273 TraceCheckUtils]: 224: Hoare triple {56276#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {56276#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:49,617 INFO L273 TraceCheckUtils]: 225: Hoare triple {56276#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {56277#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:49,618 INFO L273 TraceCheckUtils]: 226: Hoare triple {56277#(<= main_~i~0 55)} assume true; {56277#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:49,618 INFO L273 TraceCheckUtils]: 227: Hoare triple {56277#(<= main_~i~0 55)} assume !(~i~0 < 100000); {56221#false} is VALID [2018-11-18 22:58:49,618 INFO L273 TraceCheckUtils]: 228: Hoare triple {56221#false} havoc ~x~0;~x~0 := 0; {56221#false} is VALID [2018-11-18 22:58:49,619 INFO L273 TraceCheckUtils]: 229: Hoare triple {56221#false} assume true; {56221#false} is VALID [2018-11-18 22:58:49,619 INFO L273 TraceCheckUtils]: 230: Hoare triple {56221#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {56221#false} is VALID [2018-11-18 22:58:49,619 INFO L256 TraceCheckUtils]: 231: Hoare triple {56221#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {56221#false} is VALID [2018-11-18 22:58:49,619 INFO L273 TraceCheckUtils]: 232: Hoare triple {56221#false} ~cond := #in~cond; {56221#false} is VALID [2018-11-18 22:58:49,619 INFO L273 TraceCheckUtils]: 233: Hoare triple {56221#false} assume 0 == ~cond; {56221#false} is VALID [2018-11-18 22:58:49,620 INFO L273 TraceCheckUtils]: 234: Hoare triple {56221#false} assume !false; {56221#false} is VALID [2018-11-18 22:58:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:49,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:49,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2018-11-18 22:58:49,679 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 235 [2018-11-18 22:58:49,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:49,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2018-11-18 22:58:49,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:49,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-18 22:58:49,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-18 22:58:49,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-18 22:58:49,914 INFO L87 Difference]: Start difference. First operand 240 states and 296 transitions. Second operand 59 states. [2018-11-18 22:58:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:51,249 INFO L93 Difference]: Finished difference Result 258 states and 317 transitions. [2018-11-18 22:58:51,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-18 22:58:51,249 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 235 [2018-11-18 22:58:51,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 22:58:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 317 transitions. [2018-11-18 22:58:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 22:58:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 317 transitions. [2018-11-18 22:58:51,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 317 transitions. [2018-11-18 22:58:51,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:51,546 INFO L225 Difference]: With dead ends: 258 [2018-11-18 22:58:51,546 INFO L226 Difference]: Without dead ends: 246 [2018-11-18 22:58:51,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-18 22:58:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-18 22:58:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2018-11-18 22:58:51,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:51,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand 244 states. [2018-11-18 22:58:51,642 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand 244 states. [2018-11-18 22:58:51,642 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 244 states. [2018-11-18 22:58:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:51,647 INFO L93 Difference]: Finished difference Result 246 states and 304 transitions. [2018-11-18 22:58:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 304 transitions. [2018-11-18 22:58:51,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:51,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:51,647 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 246 states. [2018-11-18 22:58:51,648 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 246 states. [2018-11-18 22:58:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:51,652 INFO L93 Difference]: Finished difference Result 246 states and 304 transitions. [2018-11-18 22:58:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 304 transitions. [2018-11-18 22:58:51,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:51,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:51,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:51,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-18 22:58:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 301 transitions. [2018-11-18 22:58:51,657 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 301 transitions. Word has length 235 [2018-11-18 22:58:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:51,657 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 301 transitions. [2018-11-18 22:58:51,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-18 22:58:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 301 transitions. [2018-11-18 22:58:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-18 22:58:51,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:51,658 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:51,659 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:51,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1928103342, now seen corresponding path program 56 times [2018-11-18 22:58:51,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:51,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:51,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:58:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:53,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {58108#true} call ULTIMATE.init(); {58108#true} is VALID [2018-11-18 22:58:53,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {58108#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {58108#true} is VALID [2018-11-18 22:58:53,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {58108#true} assume true; {58108#true} is VALID [2018-11-18 22:58:53,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58108#true} {58108#true} #57#return; {58108#true} is VALID [2018-11-18 22:58:53,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {58108#true} call #t~ret4 := main(); {58108#true} is VALID [2018-11-18 22:58:53,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {58108#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {58110#(= main_~i~0 0)} is VALID [2018-11-18 22:58:53,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {58110#(= main_~i~0 0)} assume true; {58110#(= main_~i~0 0)} is VALID [2018-11-18 22:58:53,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {58110#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58110#(= main_~i~0 0)} is VALID [2018-11-18 22:58:53,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {58110#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58110#(= main_~i~0 0)} is VALID [2018-11-18 22:58:53,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {58110#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {58111#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:53,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {58111#(<= main_~i~0 1)} assume true; {58111#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:53,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {58111#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58111#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:53,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {58111#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58111#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:53,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {58111#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {58112#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:53,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {58112#(<= main_~i~0 2)} assume true; {58112#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:53,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {58112#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58112#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:53,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {58112#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58112#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:53,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {58112#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {58113#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:53,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {58113#(<= main_~i~0 3)} assume true; {58113#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:53,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {58113#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58113#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:53,518 INFO L273 TraceCheckUtils]: 20: Hoare triple {58113#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58113#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:53,519 INFO L273 TraceCheckUtils]: 21: Hoare triple {58113#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {58114#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:53,519 INFO L273 TraceCheckUtils]: 22: Hoare triple {58114#(<= main_~i~0 4)} assume true; {58114#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:53,520 INFO L273 TraceCheckUtils]: 23: Hoare triple {58114#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58114#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:53,520 INFO L273 TraceCheckUtils]: 24: Hoare triple {58114#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58114#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:53,521 INFO L273 TraceCheckUtils]: 25: Hoare triple {58114#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {58115#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:53,522 INFO L273 TraceCheckUtils]: 26: Hoare triple {58115#(<= main_~i~0 5)} assume true; {58115#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:53,522 INFO L273 TraceCheckUtils]: 27: Hoare triple {58115#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58115#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:53,523 INFO L273 TraceCheckUtils]: 28: Hoare triple {58115#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58115#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:53,523 INFO L273 TraceCheckUtils]: 29: Hoare triple {58115#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {58116#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:53,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {58116#(<= main_~i~0 6)} assume true; {58116#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:53,524 INFO L273 TraceCheckUtils]: 31: Hoare triple {58116#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58116#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:53,525 INFO L273 TraceCheckUtils]: 32: Hoare triple {58116#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58116#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:53,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {58116#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {58117#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:53,526 INFO L273 TraceCheckUtils]: 34: Hoare triple {58117#(<= main_~i~0 7)} assume true; {58117#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:53,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {58117#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58117#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:53,527 INFO L273 TraceCheckUtils]: 36: Hoare triple {58117#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58117#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:53,528 INFO L273 TraceCheckUtils]: 37: Hoare triple {58117#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {58118#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:53,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {58118#(<= main_~i~0 8)} assume true; {58118#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:53,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {58118#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58118#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:53,529 INFO L273 TraceCheckUtils]: 40: Hoare triple {58118#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58118#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:53,530 INFO L273 TraceCheckUtils]: 41: Hoare triple {58118#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {58119#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:53,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {58119#(<= main_~i~0 9)} assume true; {58119#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:53,531 INFO L273 TraceCheckUtils]: 43: Hoare triple {58119#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58119#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:53,531 INFO L273 TraceCheckUtils]: 44: Hoare triple {58119#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58119#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:53,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {58119#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {58120#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:53,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {58120#(<= main_~i~0 10)} assume true; {58120#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:53,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {58120#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58120#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:53,534 INFO L273 TraceCheckUtils]: 48: Hoare triple {58120#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58120#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:53,534 INFO L273 TraceCheckUtils]: 49: Hoare triple {58120#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {58121#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:53,535 INFO L273 TraceCheckUtils]: 50: Hoare triple {58121#(<= main_~i~0 11)} assume true; {58121#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:53,535 INFO L273 TraceCheckUtils]: 51: Hoare triple {58121#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58121#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:53,536 INFO L273 TraceCheckUtils]: 52: Hoare triple {58121#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58121#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:53,537 INFO L273 TraceCheckUtils]: 53: Hoare triple {58121#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {58122#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:53,537 INFO L273 TraceCheckUtils]: 54: Hoare triple {58122#(<= main_~i~0 12)} assume true; {58122#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:53,538 INFO L273 TraceCheckUtils]: 55: Hoare triple {58122#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58122#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:53,538 INFO L273 TraceCheckUtils]: 56: Hoare triple {58122#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58122#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:53,539 INFO L273 TraceCheckUtils]: 57: Hoare triple {58122#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {58123#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:53,539 INFO L273 TraceCheckUtils]: 58: Hoare triple {58123#(<= main_~i~0 13)} assume true; {58123#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:53,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {58123#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58123#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:53,540 INFO L273 TraceCheckUtils]: 60: Hoare triple {58123#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58123#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:53,541 INFO L273 TraceCheckUtils]: 61: Hoare triple {58123#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {58124#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:53,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {58124#(<= main_~i~0 14)} assume true; {58124#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:53,542 INFO L273 TraceCheckUtils]: 63: Hoare triple {58124#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58124#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:53,542 INFO L273 TraceCheckUtils]: 64: Hoare triple {58124#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58124#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:53,543 INFO L273 TraceCheckUtils]: 65: Hoare triple {58124#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {58125#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:53,544 INFO L273 TraceCheckUtils]: 66: Hoare triple {58125#(<= main_~i~0 15)} assume true; {58125#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:53,544 INFO L273 TraceCheckUtils]: 67: Hoare triple {58125#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58125#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:53,545 INFO L273 TraceCheckUtils]: 68: Hoare triple {58125#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58125#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:53,545 INFO L273 TraceCheckUtils]: 69: Hoare triple {58125#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {58126#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:53,546 INFO L273 TraceCheckUtils]: 70: Hoare triple {58126#(<= main_~i~0 16)} assume true; {58126#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:53,546 INFO L273 TraceCheckUtils]: 71: Hoare triple {58126#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58126#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:53,547 INFO L273 TraceCheckUtils]: 72: Hoare triple {58126#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58126#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:53,548 INFO L273 TraceCheckUtils]: 73: Hoare triple {58126#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {58127#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:53,548 INFO L273 TraceCheckUtils]: 74: Hoare triple {58127#(<= main_~i~0 17)} assume true; {58127#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:53,549 INFO L273 TraceCheckUtils]: 75: Hoare triple {58127#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58127#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:53,549 INFO L273 TraceCheckUtils]: 76: Hoare triple {58127#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58127#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:53,550 INFO L273 TraceCheckUtils]: 77: Hoare triple {58127#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {58128#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:53,550 INFO L273 TraceCheckUtils]: 78: Hoare triple {58128#(<= main_~i~0 18)} assume true; {58128#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:53,551 INFO L273 TraceCheckUtils]: 79: Hoare triple {58128#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58128#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:53,551 INFO L273 TraceCheckUtils]: 80: Hoare triple {58128#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58128#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:53,552 INFO L273 TraceCheckUtils]: 81: Hoare triple {58128#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {58129#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:53,553 INFO L273 TraceCheckUtils]: 82: Hoare triple {58129#(<= main_~i~0 19)} assume true; {58129#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:53,553 INFO L273 TraceCheckUtils]: 83: Hoare triple {58129#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58129#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:53,553 INFO L273 TraceCheckUtils]: 84: Hoare triple {58129#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58129#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:53,554 INFO L273 TraceCheckUtils]: 85: Hoare triple {58129#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {58130#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:53,555 INFO L273 TraceCheckUtils]: 86: Hoare triple {58130#(<= main_~i~0 20)} assume true; {58130#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:53,555 INFO L273 TraceCheckUtils]: 87: Hoare triple {58130#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58130#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:53,556 INFO L273 TraceCheckUtils]: 88: Hoare triple {58130#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58130#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:53,556 INFO L273 TraceCheckUtils]: 89: Hoare triple {58130#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {58131#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:53,557 INFO L273 TraceCheckUtils]: 90: Hoare triple {58131#(<= main_~i~0 21)} assume true; {58131#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:53,557 INFO L273 TraceCheckUtils]: 91: Hoare triple {58131#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58131#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:53,558 INFO L273 TraceCheckUtils]: 92: Hoare triple {58131#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58131#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:53,559 INFO L273 TraceCheckUtils]: 93: Hoare triple {58131#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {58132#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:53,559 INFO L273 TraceCheckUtils]: 94: Hoare triple {58132#(<= main_~i~0 22)} assume true; {58132#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:53,560 INFO L273 TraceCheckUtils]: 95: Hoare triple {58132#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58132#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:53,560 INFO L273 TraceCheckUtils]: 96: Hoare triple {58132#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58132#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:53,561 INFO L273 TraceCheckUtils]: 97: Hoare triple {58132#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {58133#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:53,561 INFO L273 TraceCheckUtils]: 98: Hoare triple {58133#(<= main_~i~0 23)} assume true; {58133#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:53,562 INFO L273 TraceCheckUtils]: 99: Hoare triple {58133#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58133#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:53,562 INFO L273 TraceCheckUtils]: 100: Hoare triple {58133#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58133#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:53,563 INFO L273 TraceCheckUtils]: 101: Hoare triple {58133#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {58134#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:53,564 INFO L273 TraceCheckUtils]: 102: Hoare triple {58134#(<= main_~i~0 24)} assume true; {58134#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:53,564 INFO L273 TraceCheckUtils]: 103: Hoare triple {58134#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58134#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:53,565 INFO L273 TraceCheckUtils]: 104: Hoare triple {58134#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58134#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:53,565 INFO L273 TraceCheckUtils]: 105: Hoare triple {58134#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {58135#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:53,566 INFO L273 TraceCheckUtils]: 106: Hoare triple {58135#(<= main_~i~0 25)} assume true; {58135#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:53,566 INFO L273 TraceCheckUtils]: 107: Hoare triple {58135#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58135#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:53,567 INFO L273 TraceCheckUtils]: 108: Hoare triple {58135#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58135#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:53,567 INFO L273 TraceCheckUtils]: 109: Hoare triple {58135#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {58136#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:53,568 INFO L273 TraceCheckUtils]: 110: Hoare triple {58136#(<= main_~i~0 26)} assume true; {58136#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:53,568 INFO L273 TraceCheckUtils]: 111: Hoare triple {58136#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58136#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:53,569 INFO L273 TraceCheckUtils]: 112: Hoare triple {58136#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58136#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:53,570 INFO L273 TraceCheckUtils]: 113: Hoare triple {58136#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {58137#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:53,570 INFO L273 TraceCheckUtils]: 114: Hoare triple {58137#(<= main_~i~0 27)} assume true; {58137#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:53,571 INFO L273 TraceCheckUtils]: 115: Hoare triple {58137#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58137#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:53,571 INFO L273 TraceCheckUtils]: 116: Hoare triple {58137#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58137#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:53,572 INFO L273 TraceCheckUtils]: 117: Hoare triple {58137#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {58138#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:53,572 INFO L273 TraceCheckUtils]: 118: Hoare triple {58138#(<= main_~i~0 28)} assume true; {58138#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:53,574 INFO L273 TraceCheckUtils]: 119: Hoare triple {58138#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58138#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:53,574 INFO L273 TraceCheckUtils]: 120: Hoare triple {58138#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58138#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:53,575 INFO L273 TraceCheckUtils]: 121: Hoare triple {58138#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {58139#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:53,575 INFO L273 TraceCheckUtils]: 122: Hoare triple {58139#(<= main_~i~0 29)} assume true; {58139#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:53,576 INFO L273 TraceCheckUtils]: 123: Hoare triple {58139#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58139#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:53,576 INFO L273 TraceCheckUtils]: 124: Hoare triple {58139#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58139#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:53,577 INFO L273 TraceCheckUtils]: 125: Hoare triple {58139#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {58140#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:53,578 INFO L273 TraceCheckUtils]: 126: Hoare triple {58140#(<= main_~i~0 30)} assume true; {58140#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:53,578 INFO L273 TraceCheckUtils]: 127: Hoare triple {58140#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58140#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:53,579 INFO L273 TraceCheckUtils]: 128: Hoare triple {58140#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58140#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:53,579 INFO L273 TraceCheckUtils]: 129: Hoare triple {58140#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {58141#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:53,580 INFO L273 TraceCheckUtils]: 130: Hoare triple {58141#(<= main_~i~0 31)} assume true; {58141#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:53,580 INFO L273 TraceCheckUtils]: 131: Hoare triple {58141#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58141#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:53,581 INFO L273 TraceCheckUtils]: 132: Hoare triple {58141#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58141#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:53,582 INFO L273 TraceCheckUtils]: 133: Hoare triple {58141#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {58142#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:53,582 INFO L273 TraceCheckUtils]: 134: Hoare triple {58142#(<= main_~i~0 32)} assume true; {58142#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:53,583 INFO L273 TraceCheckUtils]: 135: Hoare triple {58142#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58142#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:53,583 INFO L273 TraceCheckUtils]: 136: Hoare triple {58142#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58142#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:53,584 INFO L273 TraceCheckUtils]: 137: Hoare triple {58142#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {58143#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:53,584 INFO L273 TraceCheckUtils]: 138: Hoare triple {58143#(<= main_~i~0 33)} assume true; {58143#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:53,585 INFO L273 TraceCheckUtils]: 139: Hoare triple {58143#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58143#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:53,585 INFO L273 TraceCheckUtils]: 140: Hoare triple {58143#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58143#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:53,586 INFO L273 TraceCheckUtils]: 141: Hoare triple {58143#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {58144#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:53,586 INFO L273 TraceCheckUtils]: 142: Hoare triple {58144#(<= main_~i~0 34)} assume true; {58144#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:53,587 INFO L273 TraceCheckUtils]: 143: Hoare triple {58144#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58144#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:53,587 INFO L273 TraceCheckUtils]: 144: Hoare triple {58144#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58144#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:53,588 INFO L273 TraceCheckUtils]: 145: Hoare triple {58144#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {58145#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:53,589 INFO L273 TraceCheckUtils]: 146: Hoare triple {58145#(<= main_~i~0 35)} assume true; {58145#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:53,589 INFO L273 TraceCheckUtils]: 147: Hoare triple {58145#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58145#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:53,590 INFO L273 TraceCheckUtils]: 148: Hoare triple {58145#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58145#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:53,590 INFO L273 TraceCheckUtils]: 149: Hoare triple {58145#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {58146#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:53,591 INFO L273 TraceCheckUtils]: 150: Hoare triple {58146#(<= main_~i~0 36)} assume true; {58146#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:53,591 INFO L273 TraceCheckUtils]: 151: Hoare triple {58146#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58146#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:53,592 INFO L273 TraceCheckUtils]: 152: Hoare triple {58146#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58146#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:53,593 INFO L273 TraceCheckUtils]: 153: Hoare triple {58146#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {58147#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:53,593 INFO L273 TraceCheckUtils]: 154: Hoare triple {58147#(<= main_~i~0 37)} assume true; {58147#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:53,594 INFO L273 TraceCheckUtils]: 155: Hoare triple {58147#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58147#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:53,594 INFO L273 TraceCheckUtils]: 156: Hoare triple {58147#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58147#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:53,599 INFO L273 TraceCheckUtils]: 157: Hoare triple {58147#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {58148#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:53,599 INFO L273 TraceCheckUtils]: 158: Hoare triple {58148#(<= main_~i~0 38)} assume true; {58148#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:53,600 INFO L273 TraceCheckUtils]: 159: Hoare triple {58148#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58148#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:53,601 INFO L273 TraceCheckUtils]: 160: Hoare triple {58148#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58148#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:53,601 INFO L273 TraceCheckUtils]: 161: Hoare triple {58148#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {58149#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:53,601 INFO L273 TraceCheckUtils]: 162: Hoare triple {58149#(<= main_~i~0 39)} assume true; {58149#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:53,602 INFO L273 TraceCheckUtils]: 163: Hoare triple {58149#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58149#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:53,602 INFO L273 TraceCheckUtils]: 164: Hoare triple {58149#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58149#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:53,603 INFO L273 TraceCheckUtils]: 165: Hoare triple {58149#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {58150#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:53,604 INFO L273 TraceCheckUtils]: 166: Hoare triple {58150#(<= main_~i~0 40)} assume true; {58150#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:53,604 INFO L273 TraceCheckUtils]: 167: Hoare triple {58150#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58150#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:53,605 INFO L273 TraceCheckUtils]: 168: Hoare triple {58150#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58150#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:53,605 INFO L273 TraceCheckUtils]: 169: Hoare triple {58150#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {58151#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:53,606 INFO L273 TraceCheckUtils]: 170: Hoare triple {58151#(<= main_~i~0 41)} assume true; {58151#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:53,606 INFO L273 TraceCheckUtils]: 171: Hoare triple {58151#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58151#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:53,607 INFO L273 TraceCheckUtils]: 172: Hoare triple {58151#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58151#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:53,608 INFO L273 TraceCheckUtils]: 173: Hoare triple {58151#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {58152#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:53,608 INFO L273 TraceCheckUtils]: 174: Hoare triple {58152#(<= main_~i~0 42)} assume true; {58152#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:53,609 INFO L273 TraceCheckUtils]: 175: Hoare triple {58152#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58152#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:53,609 INFO L273 TraceCheckUtils]: 176: Hoare triple {58152#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58152#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:53,610 INFO L273 TraceCheckUtils]: 177: Hoare triple {58152#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {58153#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:53,610 INFO L273 TraceCheckUtils]: 178: Hoare triple {58153#(<= main_~i~0 43)} assume true; {58153#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:53,611 INFO L273 TraceCheckUtils]: 179: Hoare triple {58153#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58153#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:53,611 INFO L273 TraceCheckUtils]: 180: Hoare triple {58153#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58153#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:53,612 INFO L273 TraceCheckUtils]: 181: Hoare triple {58153#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {58154#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:53,613 INFO L273 TraceCheckUtils]: 182: Hoare triple {58154#(<= main_~i~0 44)} assume true; {58154#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:53,613 INFO L273 TraceCheckUtils]: 183: Hoare triple {58154#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58154#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:53,613 INFO L273 TraceCheckUtils]: 184: Hoare triple {58154#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58154#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:53,614 INFO L273 TraceCheckUtils]: 185: Hoare triple {58154#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {58155#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:53,615 INFO L273 TraceCheckUtils]: 186: Hoare triple {58155#(<= main_~i~0 45)} assume true; {58155#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:53,615 INFO L273 TraceCheckUtils]: 187: Hoare triple {58155#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58155#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:53,616 INFO L273 TraceCheckUtils]: 188: Hoare triple {58155#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58155#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:53,616 INFO L273 TraceCheckUtils]: 189: Hoare triple {58155#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {58156#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:53,617 INFO L273 TraceCheckUtils]: 190: Hoare triple {58156#(<= main_~i~0 46)} assume true; {58156#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:53,617 INFO L273 TraceCheckUtils]: 191: Hoare triple {58156#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58156#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:53,618 INFO L273 TraceCheckUtils]: 192: Hoare triple {58156#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58156#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:53,619 INFO L273 TraceCheckUtils]: 193: Hoare triple {58156#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {58157#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:53,619 INFO L273 TraceCheckUtils]: 194: Hoare triple {58157#(<= main_~i~0 47)} assume true; {58157#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:53,620 INFO L273 TraceCheckUtils]: 195: Hoare triple {58157#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58157#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:53,620 INFO L273 TraceCheckUtils]: 196: Hoare triple {58157#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58157#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:53,621 INFO L273 TraceCheckUtils]: 197: Hoare triple {58157#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {58158#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:53,621 INFO L273 TraceCheckUtils]: 198: Hoare triple {58158#(<= main_~i~0 48)} assume true; {58158#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:53,622 INFO L273 TraceCheckUtils]: 199: Hoare triple {58158#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58158#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:53,622 INFO L273 TraceCheckUtils]: 200: Hoare triple {58158#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58158#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:53,623 INFO L273 TraceCheckUtils]: 201: Hoare triple {58158#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {58159#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:53,624 INFO L273 TraceCheckUtils]: 202: Hoare triple {58159#(<= main_~i~0 49)} assume true; {58159#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:53,624 INFO L273 TraceCheckUtils]: 203: Hoare triple {58159#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58159#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:53,625 INFO L273 TraceCheckUtils]: 204: Hoare triple {58159#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58159#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:53,625 INFO L273 TraceCheckUtils]: 205: Hoare triple {58159#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {58160#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:53,626 INFO L273 TraceCheckUtils]: 206: Hoare triple {58160#(<= main_~i~0 50)} assume true; {58160#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:53,626 INFO L273 TraceCheckUtils]: 207: Hoare triple {58160#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58160#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:53,627 INFO L273 TraceCheckUtils]: 208: Hoare triple {58160#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58160#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:53,628 INFO L273 TraceCheckUtils]: 209: Hoare triple {58160#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {58161#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:53,628 INFO L273 TraceCheckUtils]: 210: Hoare triple {58161#(<= main_~i~0 51)} assume true; {58161#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:53,629 INFO L273 TraceCheckUtils]: 211: Hoare triple {58161#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58161#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:53,629 INFO L273 TraceCheckUtils]: 212: Hoare triple {58161#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58161#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:53,630 INFO L273 TraceCheckUtils]: 213: Hoare triple {58161#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {58162#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:53,630 INFO L273 TraceCheckUtils]: 214: Hoare triple {58162#(<= main_~i~0 52)} assume true; {58162#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:53,631 INFO L273 TraceCheckUtils]: 215: Hoare triple {58162#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58162#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:53,631 INFO L273 TraceCheckUtils]: 216: Hoare triple {58162#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58162#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:53,632 INFO L273 TraceCheckUtils]: 217: Hoare triple {58162#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {58163#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:53,633 INFO L273 TraceCheckUtils]: 218: Hoare triple {58163#(<= main_~i~0 53)} assume true; {58163#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:53,633 INFO L273 TraceCheckUtils]: 219: Hoare triple {58163#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58163#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:53,634 INFO L273 TraceCheckUtils]: 220: Hoare triple {58163#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58163#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:53,634 INFO L273 TraceCheckUtils]: 221: Hoare triple {58163#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {58164#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:53,635 INFO L273 TraceCheckUtils]: 222: Hoare triple {58164#(<= main_~i~0 54)} assume true; {58164#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:53,635 INFO L273 TraceCheckUtils]: 223: Hoare triple {58164#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58164#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:53,636 INFO L273 TraceCheckUtils]: 224: Hoare triple {58164#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58164#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:53,636 INFO L273 TraceCheckUtils]: 225: Hoare triple {58164#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {58165#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:53,637 INFO L273 TraceCheckUtils]: 226: Hoare triple {58165#(<= main_~i~0 55)} assume true; {58165#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:53,638 INFO L273 TraceCheckUtils]: 227: Hoare triple {58165#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58165#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:53,638 INFO L273 TraceCheckUtils]: 228: Hoare triple {58165#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58165#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:53,639 INFO L273 TraceCheckUtils]: 229: Hoare triple {58165#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {58166#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:53,639 INFO L273 TraceCheckUtils]: 230: Hoare triple {58166#(<= main_~i~0 56)} assume true; {58166#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:53,640 INFO L273 TraceCheckUtils]: 231: Hoare triple {58166#(<= main_~i~0 56)} assume !(~i~0 < 100000); {58109#false} is VALID [2018-11-18 22:58:53,640 INFO L273 TraceCheckUtils]: 232: Hoare triple {58109#false} havoc ~x~0;~x~0 := 0; {58109#false} is VALID [2018-11-18 22:58:53,640 INFO L273 TraceCheckUtils]: 233: Hoare triple {58109#false} assume true; {58109#false} is VALID [2018-11-18 22:58:53,641 INFO L273 TraceCheckUtils]: 234: Hoare triple {58109#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {58109#false} is VALID [2018-11-18 22:58:53,641 INFO L256 TraceCheckUtils]: 235: Hoare triple {58109#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {58109#false} is VALID [2018-11-18 22:58:53,641 INFO L273 TraceCheckUtils]: 236: Hoare triple {58109#false} ~cond := #in~cond; {58109#false} is VALID [2018-11-18 22:58:53,641 INFO L273 TraceCheckUtils]: 237: Hoare triple {58109#false} assume 0 == ~cond; {58109#false} is VALID [2018-11-18 22:58:53,641 INFO L273 TraceCheckUtils]: 238: Hoare triple {58109#false} assume !false; {58109#false} is VALID [2018-11-18 22:58:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:53,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:53,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:53,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:58:53,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:58:53,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:53,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:54,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {58108#true} call ULTIMATE.init(); {58108#true} is VALID [2018-11-18 22:58:54,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {58108#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {58108#true} is VALID [2018-11-18 22:58:54,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {58108#true} assume true; {58108#true} is VALID [2018-11-18 22:58:54,249 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58108#true} {58108#true} #57#return; {58108#true} is VALID [2018-11-18 22:58:54,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {58108#true} call #t~ret4 := main(); {58108#true} is VALID [2018-11-18 22:58:54,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {58108#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {58185#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:54,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {58185#(<= main_~i~0 0)} assume true; {58185#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:54,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {58185#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58185#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:54,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {58185#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58185#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:54,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {58185#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {58111#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:54,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {58111#(<= main_~i~0 1)} assume true; {58111#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:54,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {58111#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58111#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:54,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {58111#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58111#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:54,253 INFO L273 TraceCheckUtils]: 13: Hoare triple {58111#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {58112#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:54,253 INFO L273 TraceCheckUtils]: 14: Hoare triple {58112#(<= main_~i~0 2)} assume true; {58112#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:54,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {58112#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58112#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:54,254 INFO L273 TraceCheckUtils]: 16: Hoare triple {58112#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58112#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:54,254 INFO L273 TraceCheckUtils]: 17: Hoare triple {58112#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {58113#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:54,255 INFO L273 TraceCheckUtils]: 18: Hoare triple {58113#(<= main_~i~0 3)} assume true; {58113#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:54,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {58113#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58113#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:54,256 INFO L273 TraceCheckUtils]: 20: Hoare triple {58113#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58113#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:54,257 INFO L273 TraceCheckUtils]: 21: Hoare triple {58113#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {58114#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:54,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {58114#(<= main_~i~0 4)} assume true; {58114#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:54,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {58114#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58114#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:54,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {58114#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58114#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:54,259 INFO L273 TraceCheckUtils]: 25: Hoare triple {58114#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {58115#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:54,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {58115#(<= main_~i~0 5)} assume true; {58115#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:54,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {58115#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58115#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:54,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {58115#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58115#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:54,261 INFO L273 TraceCheckUtils]: 29: Hoare triple {58115#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {58116#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:54,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {58116#(<= main_~i~0 6)} assume true; {58116#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:54,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {58116#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58116#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:54,263 INFO L273 TraceCheckUtils]: 32: Hoare triple {58116#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58116#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:54,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {58116#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {58117#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:54,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {58117#(<= main_~i~0 7)} assume true; {58117#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:54,264 INFO L273 TraceCheckUtils]: 35: Hoare triple {58117#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58117#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:54,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {58117#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58117#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:54,265 INFO L273 TraceCheckUtils]: 37: Hoare triple {58117#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {58118#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:54,266 INFO L273 TraceCheckUtils]: 38: Hoare triple {58118#(<= main_~i~0 8)} assume true; {58118#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:54,266 INFO L273 TraceCheckUtils]: 39: Hoare triple {58118#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58118#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:54,267 INFO L273 TraceCheckUtils]: 40: Hoare triple {58118#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58118#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:54,268 INFO L273 TraceCheckUtils]: 41: Hoare triple {58118#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {58119#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:54,268 INFO L273 TraceCheckUtils]: 42: Hoare triple {58119#(<= main_~i~0 9)} assume true; {58119#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:54,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {58119#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58119#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:54,269 INFO L273 TraceCheckUtils]: 44: Hoare triple {58119#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58119#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:54,270 INFO L273 TraceCheckUtils]: 45: Hoare triple {58119#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {58120#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:54,270 INFO L273 TraceCheckUtils]: 46: Hoare triple {58120#(<= main_~i~0 10)} assume true; {58120#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:54,271 INFO L273 TraceCheckUtils]: 47: Hoare triple {58120#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58120#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:54,271 INFO L273 TraceCheckUtils]: 48: Hoare triple {58120#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58120#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:54,272 INFO L273 TraceCheckUtils]: 49: Hoare triple {58120#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {58121#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:54,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {58121#(<= main_~i~0 11)} assume true; {58121#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:54,273 INFO L273 TraceCheckUtils]: 51: Hoare triple {58121#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58121#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:54,274 INFO L273 TraceCheckUtils]: 52: Hoare triple {58121#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58121#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:54,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {58121#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {58122#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:54,275 INFO L273 TraceCheckUtils]: 54: Hoare triple {58122#(<= main_~i~0 12)} assume true; {58122#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:54,275 INFO L273 TraceCheckUtils]: 55: Hoare triple {58122#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58122#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:54,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {58122#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58122#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:54,277 INFO L273 TraceCheckUtils]: 57: Hoare triple {58122#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {58123#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:54,277 INFO L273 TraceCheckUtils]: 58: Hoare triple {58123#(<= main_~i~0 13)} assume true; {58123#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:54,278 INFO L273 TraceCheckUtils]: 59: Hoare triple {58123#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58123#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:54,278 INFO L273 TraceCheckUtils]: 60: Hoare triple {58123#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58123#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:54,279 INFO L273 TraceCheckUtils]: 61: Hoare triple {58123#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {58124#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:54,279 INFO L273 TraceCheckUtils]: 62: Hoare triple {58124#(<= main_~i~0 14)} assume true; {58124#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:54,280 INFO L273 TraceCheckUtils]: 63: Hoare triple {58124#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58124#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:54,280 INFO L273 TraceCheckUtils]: 64: Hoare triple {58124#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58124#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:54,281 INFO L273 TraceCheckUtils]: 65: Hoare triple {58124#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {58125#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:54,281 INFO L273 TraceCheckUtils]: 66: Hoare triple {58125#(<= main_~i~0 15)} assume true; {58125#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:54,282 INFO L273 TraceCheckUtils]: 67: Hoare triple {58125#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58125#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:54,282 INFO L273 TraceCheckUtils]: 68: Hoare triple {58125#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58125#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:54,283 INFO L273 TraceCheckUtils]: 69: Hoare triple {58125#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {58126#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:54,284 INFO L273 TraceCheckUtils]: 70: Hoare triple {58126#(<= main_~i~0 16)} assume true; {58126#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:54,284 INFO L273 TraceCheckUtils]: 71: Hoare triple {58126#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58126#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:54,285 INFO L273 TraceCheckUtils]: 72: Hoare triple {58126#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58126#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:54,285 INFO L273 TraceCheckUtils]: 73: Hoare triple {58126#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {58127#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:54,286 INFO L273 TraceCheckUtils]: 74: Hoare triple {58127#(<= main_~i~0 17)} assume true; {58127#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:54,286 INFO L273 TraceCheckUtils]: 75: Hoare triple {58127#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58127#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:54,287 INFO L273 TraceCheckUtils]: 76: Hoare triple {58127#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58127#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:54,288 INFO L273 TraceCheckUtils]: 77: Hoare triple {58127#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {58128#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:54,288 INFO L273 TraceCheckUtils]: 78: Hoare triple {58128#(<= main_~i~0 18)} assume true; {58128#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:54,289 INFO L273 TraceCheckUtils]: 79: Hoare triple {58128#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58128#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:54,289 INFO L273 TraceCheckUtils]: 80: Hoare triple {58128#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58128#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:54,290 INFO L273 TraceCheckUtils]: 81: Hoare triple {58128#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {58129#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:54,290 INFO L273 TraceCheckUtils]: 82: Hoare triple {58129#(<= main_~i~0 19)} assume true; {58129#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:54,291 INFO L273 TraceCheckUtils]: 83: Hoare triple {58129#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58129#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:54,291 INFO L273 TraceCheckUtils]: 84: Hoare triple {58129#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58129#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:54,292 INFO L273 TraceCheckUtils]: 85: Hoare triple {58129#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {58130#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:54,293 INFO L273 TraceCheckUtils]: 86: Hoare triple {58130#(<= main_~i~0 20)} assume true; {58130#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:54,293 INFO L273 TraceCheckUtils]: 87: Hoare triple {58130#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58130#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:54,294 INFO L273 TraceCheckUtils]: 88: Hoare triple {58130#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58130#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:54,294 INFO L273 TraceCheckUtils]: 89: Hoare triple {58130#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {58131#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:54,295 INFO L273 TraceCheckUtils]: 90: Hoare triple {58131#(<= main_~i~0 21)} assume true; {58131#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:54,295 INFO L273 TraceCheckUtils]: 91: Hoare triple {58131#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58131#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:54,296 INFO L273 TraceCheckUtils]: 92: Hoare triple {58131#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58131#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:54,296 INFO L273 TraceCheckUtils]: 93: Hoare triple {58131#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {58132#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:54,297 INFO L273 TraceCheckUtils]: 94: Hoare triple {58132#(<= main_~i~0 22)} assume true; {58132#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:54,297 INFO L273 TraceCheckUtils]: 95: Hoare triple {58132#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58132#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:54,298 INFO L273 TraceCheckUtils]: 96: Hoare triple {58132#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58132#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:54,299 INFO L273 TraceCheckUtils]: 97: Hoare triple {58132#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {58133#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:54,299 INFO L273 TraceCheckUtils]: 98: Hoare triple {58133#(<= main_~i~0 23)} assume true; {58133#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:54,300 INFO L273 TraceCheckUtils]: 99: Hoare triple {58133#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58133#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:54,300 INFO L273 TraceCheckUtils]: 100: Hoare triple {58133#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58133#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:54,301 INFO L273 TraceCheckUtils]: 101: Hoare triple {58133#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {58134#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:54,301 INFO L273 TraceCheckUtils]: 102: Hoare triple {58134#(<= main_~i~0 24)} assume true; {58134#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:54,302 INFO L273 TraceCheckUtils]: 103: Hoare triple {58134#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58134#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:54,302 INFO L273 TraceCheckUtils]: 104: Hoare triple {58134#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58134#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:54,303 INFO L273 TraceCheckUtils]: 105: Hoare triple {58134#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {58135#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:54,304 INFO L273 TraceCheckUtils]: 106: Hoare triple {58135#(<= main_~i~0 25)} assume true; {58135#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:54,304 INFO L273 TraceCheckUtils]: 107: Hoare triple {58135#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58135#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:54,305 INFO L273 TraceCheckUtils]: 108: Hoare triple {58135#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58135#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:54,305 INFO L273 TraceCheckUtils]: 109: Hoare triple {58135#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {58136#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:54,306 INFO L273 TraceCheckUtils]: 110: Hoare triple {58136#(<= main_~i~0 26)} assume true; {58136#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:54,306 INFO L273 TraceCheckUtils]: 111: Hoare triple {58136#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58136#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:54,307 INFO L273 TraceCheckUtils]: 112: Hoare triple {58136#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58136#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:54,308 INFO L273 TraceCheckUtils]: 113: Hoare triple {58136#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {58137#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:54,308 INFO L273 TraceCheckUtils]: 114: Hoare triple {58137#(<= main_~i~0 27)} assume true; {58137#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:54,309 INFO L273 TraceCheckUtils]: 115: Hoare triple {58137#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58137#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:54,309 INFO L273 TraceCheckUtils]: 116: Hoare triple {58137#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58137#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:54,310 INFO L273 TraceCheckUtils]: 117: Hoare triple {58137#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {58138#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:54,310 INFO L273 TraceCheckUtils]: 118: Hoare triple {58138#(<= main_~i~0 28)} assume true; {58138#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:54,311 INFO L273 TraceCheckUtils]: 119: Hoare triple {58138#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58138#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:54,311 INFO L273 TraceCheckUtils]: 120: Hoare triple {58138#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58138#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:54,312 INFO L273 TraceCheckUtils]: 121: Hoare triple {58138#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {58139#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:54,312 INFO L273 TraceCheckUtils]: 122: Hoare triple {58139#(<= main_~i~0 29)} assume true; {58139#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:54,313 INFO L273 TraceCheckUtils]: 123: Hoare triple {58139#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58139#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:54,313 INFO L273 TraceCheckUtils]: 124: Hoare triple {58139#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58139#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:54,314 INFO L273 TraceCheckUtils]: 125: Hoare triple {58139#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {58140#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:54,315 INFO L273 TraceCheckUtils]: 126: Hoare triple {58140#(<= main_~i~0 30)} assume true; {58140#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:54,315 INFO L273 TraceCheckUtils]: 127: Hoare triple {58140#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58140#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:54,316 INFO L273 TraceCheckUtils]: 128: Hoare triple {58140#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58140#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:54,316 INFO L273 TraceCheckUtils]: 129: Hoare triple {58140#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {58141#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:54,317 INFO L273 TraceCheckUtils]: 130: Hoare triple {58141#(<= main_~i~0 31)} assume true; {58141#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:54,317 INFO L273 TraceCheckUtils]: 131: Hoare triple {58141#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58141#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:54,318 INFO L273 TraceCheckUtils]: 132: Hoare triple {58141#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58141#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:54,319 INFO L273 TraceCheckUtils]: 133: Hoare triple {58141#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {58142#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:54,319 INFO L273 TraceCheckUtils]: 134: Hoare triple {58142#(<= main_~i~0 32)} assume true; {58142#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:54,320 INFO L273 TraceCheckUtils]: 135: Hoare triple {58142#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58142#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:54,320 INFO L273 TraceCheckUtils]: 136: Hoare triple {58142#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58142#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:54,321 INFO L273 TraceCheckUtils]: 137: Hoare triple {58142#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {58143#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:54,321 INFO L273 TraceCheckUtils]: 138: Hoare triple {58143#(<= main_~i~0 33)} assume true; {58143#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:54,322 INFO L273 TraceCheckUtils]: 139: Hoare triple {58143#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58143#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:54,322 INFO L273 TraceCheckUtils]: 140: Hoare triple {58143#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58143#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:54,323 INFO L273 TraceCheckUtils]: 141: Hoare triple {58143#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {58144#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:54,323 INFO L273 TraceCheckUtils]: 142: Hoare triple {58144#(<= main_~i~0 34)} assume true; {58144#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:54,324 INFO L273 TraceCheckUtils]: 143: Hoare triple {58144#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58144#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:54,324 INFO L273 TraceCheckUtils]: 144: Hoare triple {58144#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58144#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:54,325 INFO L273 TraceCheckUtils]: 145: Hoare triple {58144#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {58145#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:54,326 INFO L273 TraceCheckUtils]: 146: Hoare triple {58145#(<= main_~i~0 35)} assume true; {58145#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:54,326 INFO L273 TraceCheckUtils]: 147: Hoare triple {58145#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58145#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:54,327 INFO L273 TraceCheckUtils]: 148: Hoare triple {58145#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58145#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:54,327 INFO L273 TraceCheckUtils]: 149: Hoare triple {58145#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {58146#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:54,328 INFO L273 TraceCheckUtils]: 150: Hoare triple {58146#(<= main_~i~0 36)} assume true; {58146#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:54,328 INFO L273 TraceCheckUtils]: 151: Hoare triple {58146#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58146#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:54,329 INFO L273 TraceCheckUtils]: 152: Hoare triple {58146#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58146#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:54,330 INFO L273 TraceCheckUtils]: 153: Hoare triple {58146#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {58147#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:54,330 INFO L273 TraceCheckUtils]: 154: Hoare triple {58147#(<= main_~i~0 37)} assume true; {58147#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:54,331 INFO L273 TraceCheckUtils]: 155: Hoare triple {58147#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58147#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:54,331 INFO L273 TraceCheckUtils]: 156: Hoare triple {58147#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58147#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:54,332 INFO L273 TraceCheckUtils]: 157: Hoare triple {58147#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {58148#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:54,332 INFO L273 TraceCheckUtils]: 158: Hoare triple {58148#(<= main_~i~0 38)} assume true; {58148#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:54,333 INFO L273 TraceCheckUtils]: 159: Hoare triple {58148#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58148#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:54,333 INFO L273 TraceCheckUtils]: 160: Hoare triple {58148#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58148#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:54,334 INFO L273 TraceCheckUtils]: 161: Hoare triple {58148#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {58149#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:54,334 INFO L273 TraceCheckUtils]: 162: Hoare triple {58149#(<= main_~i~0 39)} assume true; {58149#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:54,335 INFO L273 TraceCheckUtils]: 163: Hoare triple {58149#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58149#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:54,335 INFO L273 TraceCheckUtils]: 164: Hoare triple {58149#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58149#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:54,336 INFO L273 TraceCheckUtils]: 165: Hoare triple {58149#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {58150#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:54,337 INFO L273 TraceCheckUtils]: 166: Hoare triple {58150#(<= main_~i~0 40)} assume true; {58150#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:54,337 INFO L273 TraceCheckUtils]: 167: Hoare triple {58150#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58150#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:54,338 INFO L273 TraceCheckUtils]: 168: Hoare triple {58150#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58150#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:54,338 INFO L273 TraceCheckUtils]: 169: Hoare triple {58150#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {58151#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:54,339 INFO L273 TraceCheckUtils]: 170: Hoare triple {58151#(<= main_~i~0 41)} assume true; {58151#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:54,339 INFO L273 TraceCheckUtils]: 171: Hoare triple {58151#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58151#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:54,340 INFO L273 TraceCheckUtils]: 172: Hoare triple {58151#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58151#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:54,341 INFO L273 TraceCheckUtils]: 173: Hoare triple {58151#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {58152#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:54,341 INFO L273 TraceCheckUtils]: 174: Hoare triple {58152#(<= main_~i~0 42)} assume true; {58152#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:54,342 INFO L273 TraceCheckUtils]: 175: Hoare triple {58152#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58152#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:54,342 INFO L273 TraceCheckUtils]: 176: Hoare triple {58152#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58152#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:54,343 INFO L273 TraceCheckUtils]: 177: Hoare triple {58152#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {58153#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:54,343 INFO L273 TraceCheckUtils]: 178: Hoare triple {58153#(<= main_~i~0 43)} assume true; {58153#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:54,344 INFO L273 TraceCheckUtils]: 179: Hoare triple {58153#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58153#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:54,344 INFO L273 TraceCheckUtils]: 180: Hoare triple {58153#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58153#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:54,345 INFO L273 TraceCheckUtils]: 181: Hoare triple {58153#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {58154#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:54,346 INFO L273 TraceCheckUtils]: 182: Hoare triple {58154#(<= main_~i~0 44)} assume true; {58154#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:54,346 INFO L273 TraceCheckUtils]: 183: Hoare triple {58154#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58154#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:54,347 INFO L273 TraceCheckUtils]: 184: Hoare triple {58154#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58154#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:54,347 INFO L273 TraceCheckUtils]: 185: Hoare triple {58154#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {58155#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:54,348 INFO L273 TraceCheckUtils]: 186: Hoare triple {58155#(<= main_~i~0 45)} assume true; {58155#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:54,348 INFO L273 TraceCheckUtils]: 187: Hoare triple {58155#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58155#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:54,349 INFO L273 TraceCheckUtils]: 188: Hoare triple {58155#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58155#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:54,350 INFO L273 TraceCheckUtils]: 189: Hoare triple {58155#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {58156#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:54,350 INFO L273 TraceCheckUtils]: 190: Hoare triple {58156#(<= main_~i~0 46)} assume true; {58156#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:54,351 INFO L273 TraceCheckUtils]: 191: Hoare triple {58156#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58156#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:54,351 INFO L273 TraceCheckUtils]: 192: Hoare triple {58156#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58156#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:54,352 INFO L273 TraceCheckUtils]: 193: Hoare triple {58156#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {58157#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:54,352 INFO L273 TraceCheckUtils]: 194: Hoare triple {58157#(<= main_~i~0 47)} assume true; {58157#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:54,353 INFO L273 TraceCheckUtils]: 195: Hoare triple {58157#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58157#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:54,353 INFO L273 TraceCheckUtils]: 196: Hoare triple {58157#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58157#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:54,354 INFO L273 TraceCheckUtils]: 197: Hoare triple {58157#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {58158#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:54,354 INFO L273 TraceCheckUtils]: 198: Hoare triple {58158#(<= main_~i~0 48)} assume true; {58158#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:54,355 INFO L273 TraceCheckUtils]: 199: Hoare triple {58158#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58158#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:54,355 INFO L273 TraceCheckUtils]: 200: Hoare triple {58158#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58158#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:54,356 INFO L273 TraceCheckUtils]: 201: Hoare triple {58158#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {58159#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:54,357 INFO L273 TraceCheckUtils]: 202: Hoare triple {58159#(<= main_~i~0 49)} assume true; {58159#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:54,357 INFO L273 TraceCheckUtils]: 203: Hoare triple {58159#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58159#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:54,358 INFO L273 TraceCheckUtils]: 204: Hoare triple {58159#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58159#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:54,358 INFO L273 TraceCheckUtils]: 205: Hoare triple {58159#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {58160#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:54,359 INFO L273 TraceCheckUtils]: 206: Hoare triple {58160#(<= main_~i~0 50)} assume true; {58160#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:54,359 INFO L273 TraceCheckUtils]: 207: Hoare triple {58160#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58160#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:54,360 INFO L273 TraceCheckUtils]: 208: Hoare triple {58160#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58160#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:54,361 INFO L273 TraceCheckUtils]: 209: Hoare triple {58160#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {58161#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:54,361 INFO L273 TraceCheckUtils]: 210: Hoare triple {58161#(<= main_~i~0 51)} assume true; {58161#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:54,362 INFO L273 TraceCheckUtils]: 211: Hoare triple {58161#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58161#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:54,362 INFO L273 TraceCheckUtils]: 212: Hoare triple {58161#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58161#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:54,363 INFO L273 TraceCheckUtils]: 213: Hoare triple {58161#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {58162#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:54,363 INFO L273 TraceCheckUtils]: 214: Hoare triple {58162#(<= main_~i~0 52)} assume true; {58162#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:54,364 INFO L273 TraceCheckUtils]: 215: Hoare triple {58162#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58162#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:54,364 INFO L273 TraceCheckUtils]: 216: Hoare triple {58162#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58162#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:54,365 INFO L273 TraceCheckUtils]: 217: Hoare triple {58162#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {58163#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:54,365 INFO L273 TraceCheckUtils]: 218: Hoare triple {58163#(<= main_~i~0 53)} assume true; {58163#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:54,366 INFO L273 TraceCheckUtils]: 219: Hoare triple {58163#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58163#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:54,366 INFO L273 TraceCheckUtils]: 220: Hoare triple {58163#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58163#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:54,367 INFO L273 TraceCheckUtils]: 221: Hoare triple {58163#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {58164#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:54,368 INFO L273 TraceCheckUtils]: 222: Hoare triple {58164#(<= main_~i~0 54)} assume true; {58164#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:54,368 INFO L273 TraceCheckUtils]: 223: Hoare triple {58164#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58164#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:54,369 INFO L273 TraceCheckUtils]: 224: Hoare triple {58164#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58164#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:54,369 INFO L273 TraceCheckUtils]: 225: Hoare triple {58164#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {58165#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:54,370 INFO L273 TraceCheckUtils]: 226: Hoare triple {58165#(<= main_~i~0 55)} assume true; {58165#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:54,370 INFO L273 TraceCheckUtils]: 227: Hoare triple {58165#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58165#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:54,371 INFO L273 TraceCheckUtils]: 228: Hoare triple {58165#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {58165#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:54,371 INFO L273 TraceCheckUtils]: 229: Hoare triple {58165#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {58166#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:54,372 INFO L273 TraceCheckUtils]: 230: Hoare triple {58166#(<= main_~i~0 56)} assume true; {58166#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:54,373 INFO L273 TraceCheckUtils]: 231: Hoare triple {58166#(<= main_~i~0 56)} assume !(~i~0 < 100000); {58109#false} is VALID [2018-11-18 22:58:54,373 INFO L273 TraceCheckUtils]: 232: Hoare triple {58109#false} havoc ~x~0;~x~0 := 0; {58109#false} is VALID [2018-11-18 22:58:54,373 INFO L273 TraceCheckUtils]: 233: Hoare triple {58109#false} assume true; {58109#false} is VALID [2018-11-18 22:58:54,373 INFO L273 TraceCheckUtils]: 234: Hoare triple {58109#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {58109#false} is VALID [2018-11-18 22:58:54,373 INFO L256 TraceCheckUtils]: 235: Hoare triple {58109#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {58109#false} is VALID [2018-11-18 22:58:54,374 INFO L273 TraceCheckUtils]: 236: Hoare triple {58109#false} ~cond := #in~cond; {58109#false} is VALID [2018-11-18 22:58:54,374 INFO L273 TraceCheckUtils]: 237: Hoare triple {58109#false} assume 0 == ~cond; {58109#false} is VALID [2018-11-18 22:58:54,374 INFO L273 TraceCheckUtils]: 238: Hoare triple {58109#false} assume !false; {58109#false} is VALID [2018-11-18 22:58:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:54,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:54,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2018-11-18 22:58:54,436 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 239 [2018-11-18 22:58:54,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:54,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2018-11-18 22:58:54,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:54,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-18 22:58:54,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-18 22:58:54,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-18 22:58:54,671 INFO L87 Difference]: Start difference. First operand 244 states and 301 transitions. Second operand 60 states. [2018-11-18 22:58:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:56,051 INFO L93 Difference]: Finished difference Result 262 states and 322 transitions. [2018-11-18 22:58:56,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-18 22:58:56,051 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 239 [2018-11-18 22:58:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 22:58:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 322 transitions. [2018-11-18 22:58:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 22:58:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 322 transitions. [2018-11-18 22:58:56,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 322 transitions. [2018-11-18 22:58:56,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:56,353 INFO L225 Difference]: With dead ends: 262 [2018-11-18 22:58:56,353 INFO L226 Difference]: Without dead ends: 250 [2018-11-18 22:58:56,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-18 22:58:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-18 22:58:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-11-18 22:58:56,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:56,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand 248 states. [2018-11-18 22:58:56,424 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 248 states. [2018-11-18 22:58:56,424 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 248 states. [2018-11-18 22:58:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:56,429 INFO L93 Difference]: Finished difference Result 250 states and 309 transitions. [2018-11-18 22:58:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 309 transitions. [2018-11-18 22:58:56,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:56,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:56,430 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 250 states. [2018-11-18 22:58:56,430 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 250 states. [2018-11-18 22:58:56,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:56,434 INFO L93 Difference]: Finished difference Result 250 states and 309 transitions. [2018-11-18 22:58:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 309 transitions. [2018-11-18 22:58:56,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:56,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:56,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:56,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-18 22:58:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2018-11-18 22:58:56,438 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 239 [2018-11-18 22:58:56,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:56,438 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2018-11-18 22:58:56,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-18 22:58:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2018-11-18 22:58:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-18 22:58:56,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:56,439 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:56,440 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:56,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:56,440 INFO L82 PathProgramCache]: Analyzing trace with hash 527211944, now seen corresponding path program 57 times [2018-11-18 22:58:56,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:56,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:56,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:56,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:56,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:58,059 INFO L256 TraceCheckUtils]: 0: Hoare triple {60027#true} call ULTIMATE.init(); {60027#true} is VALID [2018-11-18 22:58:58,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {60027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {60027#true} is VALID [2018-11-18 22:58:58,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {60027#true} assume true; {60027#true} is VALID [2018-11-18 22:58:58,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60027#true} {60027#true} #57#return; {60027#true} is VALID [2018-11-18 22:58:58,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {60027#true} call #t~ret4 := main(); {60027#true} is VALID [2018-11-18 22:58:58,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {60027#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {60029#(= main_~i~0 0)} is VALID [2018-11-18 22:58:58,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {60029#(= main_~i~0 0)} assume true; {60029#(= main_~i~0 0)} is VALID [2018-11-18 22:58:58,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {60029#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60029#(= main_~i~0 0)} is VALID [2018-11-18 22:58:58,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {60029#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60029#(= main_~i~0 0)} is VALID [2018-11-18 22:58:58,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {60029#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {60030#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:58,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {60030#(<= main_~i~0 1)} assume true; {60030#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:58,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {60030#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60030#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:58,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {60030#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60030#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:58,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {60030#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {60031#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:58,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {60031#(<= main_~i~0 2)} assume true; {60031#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:58,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {60031#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60031#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:58,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {60031#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60031#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:58,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {60031#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {60032#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:58,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {60032#(<= main_~i~0 3)} assume true; {60032#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:58,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {60032#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60032#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:58,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {60032#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60032#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:58,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {60032#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {60033#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:58,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {60033#(<= main_~i~0 4)} assume true; {60033#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:58,070 INFO L273 TraceCheckUtils]: 23: Hoare triple {60033#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60033#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:58,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {60033#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60033#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:58,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {60033#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {60034#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:58,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {60034#(<= main_~i~0 5)} assume true; {60034#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:58,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {60034#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60034#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:58,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {60034#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60034#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:58,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {60034#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {60035#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:58,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {60035#(<= main_~i~0 6)} assume true; {60035#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:58,074 INFO L273 TraceCheckUtils]: 31: Hoare triple {60035#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60035#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:58,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {60035#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60035#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:58,075 INFO L273 TraceCheckUtils]: 33: Hoare triple {60035#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {60036#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:58,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {60036#(<= main_~i~0 7)} assume true; {60036#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:58,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {60036#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60036#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:58,077 INFO L273 TraceCheckUtils]: 36: Hoare triple {60036#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60036#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:58,078 INFO L273 TraceCheckUtils]: 37: Hoare triple {60036#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {60037#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:58,078 INFO L273 TraceCheckUtils]: 38: Hoare triple {60037#(<= main_~i~0 8)} assume true; {60037#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:58,079 INFO L273 TraceCheckUtils]: 39: Hoare triple {60037#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60037#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:58,079 INFO L273 TraceCheckUtils]: 40: Hoare triple {60037#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60037#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:58,080 INFO L273 TraceCheckUtils]: 41: Hoare triple {60037#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {60038#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:58,080 INFO L273 TraceCheckUtils]: 42: Hoare triple {60038#(<= main_~i~0 9)} assume true; {60038#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:58,081 INFO L273 TraceCheckUtils]: 43: Hoare triple {60038#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60038#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:58,081 INFO L273 TraceCheckUtils]: 44: Hoare triple {60038#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60038#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:58,082 INFO L273 TraceCheckUtils]: 45: Hoare triple {60038#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {60039#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:58,083 INFO L273 TraceCheckUtils]: 46: Hoare triple {60039#(<= main_~i~0 10)} assume true; {60039#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:58,083 INFO L273 TraceCheckUtils]: 47: Hoare triple {60039#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60039#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:58,084 INFO L273 TraceCheckUtils]: 48: Hoare triple {60039#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60039#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:58,084 INFO L273 TraceCheckUtils]: 49: Hoare triple {60039#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {60040#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:58,085 INFO L273 TraceCheckUtils]: 50: Hoare triple {60040#(<= main_~i~0 11)} assume true; {60040#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:58,085 INFO L273 TraceCheckUtils]: 51: Hoare triple {60040#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60040#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:58,086 INFO L273 TraceCheckUtils]: 52: Hoare triple {60040#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60040#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:58,087 INFO L273 TraceCheckUtils]: 53: Hoare triple {60040#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {60041#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:58,087 INFO L273 TraceCheckUtils]: 54: Hoare triple {60041#(<= main_~i~0 12)} assume true; {60041#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:58,088 INFO L273 TraceCheckUtils]: 55: Hoare triple {60041#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60041#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:58,088 INFO L273 TraceCheckUtils]: 56: Hoare triple {60041#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60041#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:58,089 INFO L273 TraceCheckUtils]: 57: Hoare triple {60041#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {60042#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:58,089 INFO L273 TraceCheckUtils]: 58: Hoare triple {60042#(<= main_~i~0 13)} assume true; {60042#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:58,090 INFO L273 TraceCheckUtils]: 59: Hoare triple {60042#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60042#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:58,090 INFO L273 TraceCheckUtils]: 60: Hoare triple {60042#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60042#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:58,091 INFO L273 TraceCheckUtils]: 61: Hoare triple {60042#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {60043#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:58,091 INFO L273 TraceCheckUtils]: 62: Hoare triple {60043#(<= main_~i~0 14)} assume true; {60043#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:58,092 INFO L273 TraceCheckUtils]: 63: Hoare triple {60043#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60043#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:58,092 INFO L273 TraceCheckUtils]: 64: Hoare triple {60043#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60043#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:58,093 INFO L273 TraceCheckUtils]: 65: Hoare triple {60043#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {60044#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:58,094 INFO L273 TraceCheckUtils]: 66: Hoare triple {60044#(<= main_~i~0 15)} assume true; {60044#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:58,094 INFO L273 TraceCheckUtils]: 67: Hoare triple {60044#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60044#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:58,095 INFO L273 TraceCheckUtils]: 68: Hoare triple {60044#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60044#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:58,095 INFO L273 TraceCheckUtils]: 69: Hoare triple {60044#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {60045#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:58,096 INFO L273 TraceCheckUtils]: 70: Hoare triple {60045#(<= main_~i~0 16)} assume true; {60045#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:58,096 INFO L273 TraceCheckUtils]: 71: Hoare triple {60045#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60045#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:58,097 INFO L273 TraceCheckUtils]: 72: Hoare triple {60045#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60045#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:58,098 INFO L273 TraceCheckUtils]: 73: Hoare triple {60045#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {60046#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:58,098 INFO L273 TraceCheckUtils]: 74: Hoare triple {60046#(<= main_~i~0 17)} assume true; {60046#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:58,099 INFO L273 TraceCheckUtils]: 75: Hoare triple {60046#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60046#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:58,099 INFO L273 TraceCheckUtils]: 76: Hoare triple {60046#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60046#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:58,100 INFO L273 TraceCheckUtils]: 77: Hoare triple {60046#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {60047#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:58,100 INFO L273 TraceCheckUtils]: 78: Hoare triple {60047#(<= main_~i~0 18)} assume true; {60047#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:58,101 INFO L273 TraceCheckUtils]: 79: Hoare triple {60047#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60047#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:58,101 INFO L273 TraceCheckUtils]: 80: Hoare triple {60047#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60047#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:58,102 INFO L273 TraceCheckUtils]: 81: Hoare triple {60047#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {60048#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:58,103 INFO L273 TraceCheckUtils]: 82: Hoare triple {60048#(<= main_~i~0 19)} assume true; {60048#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:58,103 INFO L273 TraceCheckUtils]: 83: Hoare triple {60048#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60048#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:58,104 INFO L273 TraceCheckUtils]: 84: Hoare triple {60048#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60048#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:58,104 INFO L273 TraceCheckUtils]: 85: Hoare triple {60048#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {60049#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:58,105 INFO L273 TraceCheckUtils]: 86: Hoare triple {60049#(<= main_~i~0 20)} assume true; {60049#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:58,105 INFO L273 TraceCheckUtils]: 87: Hoare triple {60049#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60049#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:58,106 INFO L273 TraceCheckUtils]: 88: Hoare triple {60049#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60049#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:58,106 INFO L273 TraceCheckUtils]: 89: Hoare triple {60049#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {60050#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:58,107 INFO L273 TraceCheckUtils]: 90: Hoare triple {60050#(<= main_~i~0 21)} assume true; {60050#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:58,107 INFO L273 TraceCheckUtils]: 91: Hoare triple {60050#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60050#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:58,108 INFO L273 TraceCheckUtils]: 92: Hoare triple {60050#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60050#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:58,109 INFO L273 TraceCheckUtils]: 93: Hoare triple {60050#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {60051#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:58,109 INFO L273 TraceCheckUtils]: 94: Hoare triple {60051#(<= main_~i~0 22)} assume true; {60051#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:58,110 INFO L273 TraceCheckUtils]: 95: Hoare triple {60051#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60051#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:58,110 INFO L273 TraceCheckUtils]: 96: Hoare triple {60051#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60051#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:58,111 INFO L273 TraceCheckUtils]: 97: Hoare triple {60051#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {60052#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:58,111 INFO L273 TraceCheckUtils]: 98: Hoare triple {60052#(<= main_~i~0 23)} assume true; {60052#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:58,112 INFO L273 TraceCheckUtils]: 99: Hoare triple {60052#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60052#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:58,112 INFO L273 TraceCheckUtils]: 100: Hoare triple {60052#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60052#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:58,113 INFO L273 TraceCheckUtils]: 101: Hoare triple {60052#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {60053#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:58,114 INFO L273 TraceCheckUtils]: 102: Hoare triple {60053#(<= main_~i~0 24)} assume true; {60053#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:58,114 INFO L273 TraceCheckUtils]: 103: Hoare triple {60053#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60053#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:58,114 INFO L273 TraceCheckUtils]: 104: Hoare triple {60053#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60053#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:58,115 INFO L273 TraceCheckUtils]: 105: Hoare triple {60053#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {60054#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:58,116 INFO L273 TraceCheckUtils]: 106: Hoare triple {60054#(<= main_~i~0 25)} assume true; {60054#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:58,116 INFO L273 TraceCheckUtils]: 107: Hoare triple {60054#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60054#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:58,117 INFO L273 TraceCheckUtils]: 108: Hoare triple {60054#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60054#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:58,117 INFO L273 TraceCheckUtils]: 109: Hoare triple {60054#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {60055#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:58,118 INFO L273 TraceCheckUtils]: 110: Hoare triple {60055#(<= main_~i~0 26)} assume true; {60055#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:58,118 INFO L273 TraceCheckUtils]: 111: Hoare triple {60055#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60055#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:58,119 INFO L273 TraceCheckUtils]: 112: Hoare triple {60055#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60055#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:58,120 INFO L273 TraceCheckUtils]: 113: Hoare triple {60055#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {60056#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:58,120 INFO L273 TraceCheckUtils]: 114: Hoare triple {60056#(<= main_~i~0 27)} assume true; {60056#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:58,121 INFO L273 TraceCheckUtils]: 115: Hoare triple {60056#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60056#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:58,121 INFO L273 TraceCheckUtils]: 116: Hoare triple {60056#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60056#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:58,122 INFO L273 TraceCheckUtils]: 117: Hoare triple {60056#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {60057#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:58,122 INFO L273 TraceCheckUtils]: 118: Hoare triple {60057#(<= main_~i~0 28)} assume true; {60057#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:58,123 INFO L273 TraceCheckUtils]: 119: Hoare triple {60057#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60057#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:58,123 INFO L273 TraceCheckUtils]: 120: Hoare triple {60057#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60057#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:58,124 INFO L273 TraceCheckUtils]: 121: Hoare triple {60057#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {60058#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:58,125 INFO L273 TraceCheckUtils]: 122: Hoare triple {60058#(<= main_~i~0 29)} assume true; {60058#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:58,125 INFO L273 TraceCheckUtils]: 123: Hoare triple {60058#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60058#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:58,126 INFO L273 TraceCheckUtils]: 124: Hoare triple {60058#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60058#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:58,126 INFO L273 TraceCheckUtils]: 125: Hoare triple {60058#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {60059#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:58,127 INFO L273 TraceCheckUtils]: 126: Hoare triple {60059#(<= main_~i~0 30)} assume true; {60059#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:58,127 INFO L273 TraceCheckUtils]: 127: Hoare triple {60059#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60059#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:58,128 INFO L273 TraceCheckUtils]: 128: Hoare triple {60059#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60059#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:58,128 INFO L273 TraceCheckUtils]: 129: Hoare triple {60059#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {60060#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:58,129 INFO L273 TraceCheckUtils]: 130: Hoare triple {60060#(<= main_~i~0 31)} assume true; {60060#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:58,129 INFO L273 TraceCheckUtils]: 131: Hoare triple {60060#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60060#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:58,130 INFO L273 TraceCheckUtils]: 132: Hoare triple {60060#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60060#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:58,131 INFO L273 TraceCheckUtils]: 133: Hoare triple {60060#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {60061#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:58,131 INFO L273 TraceCheckUtils]: 134: Hoare triple {60061#(<= main_~i~0 32)} assume true; {60061#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:58,132 INFO L273 TraceCheckUtils]: 135: Hoare triple {60061#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60061#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:58,132 INFO L273 TraceCheckUtils]: 136: Hoare triple {60061#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60061#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:58,133 INFO L273 TraceCheckUtils]: 137: Hoare triple {60061#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {60062#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:58,133 INFO L273 TraceCheckUtils]: 138: Hoare triple {60062#(<= main_~i~0 33)} assume true; {60062#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:58,134 INFO L273 TraceCheckUtils]: 139: Hoare triple {60062#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60062#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:58,134 INFO L273 TraceCheckUtils]: 140: Hoare triple {60062#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60062#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:58,135 INFO L273 TraceCheckUtils]: 141: Hoare triple {60062#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {60063#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:58,136 INFO L273 TraceCheckUtils]: 142: Hoare triple {60063#(<= main_~i~0 34)} assume true; {60063#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:58,136 INFO L273 TraceCheckUtils]: 143: Hoare triple {60063#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60063#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:58,137 INFO L273 TraceCheckUtils]: 144: Hoare triple {60063#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60063#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:58,137 INFO L273 TraceCheckUtils]: 145: Hoare triple {60063#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {60064#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:58,138 INFO L273 TraceCheckUtils]: 146: Hoare triple {60064#(<= main_~i~0 35)} assume true; {60064#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:58,138 INFO L273 TraceCheckUtils]: 147: Hoare triple {60064#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60064#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:58,139 INFO L273 TraceCheckUtils]: 148: Hoare triple {60064#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60064#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:58,140 INFO L273 TraceCheckUtils]: 149: Hoare triple {60064#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {60065#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:58,140 INFO L273 TraceCheckUtils]: 150: Hoare triple {60065#(<= main_~i~0 36)} assume true; {60065#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:58,141 INFO L273 TraceCheckUtils]: 151: Hoare triple {60065#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60065#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:58,141 INFO L273 TraceCheckUtils]: 152: Hoare triple {60065#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60065#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:58,142 INFO L273 TraceCheckUtils]: 153: Hoare triple {60065#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {60066#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:58,142 INFO L273 TraceCheckUtils]: 154: Hoare triple {60066#(<= main_~i~0 37)} assume true; {60066#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:58,143 INFO L273 TraceCheckUtils]: 155: Hoare triple {60066#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60066#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:58,143 INFO L273 TraceCheckUtils]: 156: Hoare triple {60066#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60066#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:58,144 INFO L273 TraceCheckUtils]: 157: Hoare triple {60066#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {60067#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:58,145 INFO L273 TraceCheckUtils]: 158: Hoare triple {60067#(<= main_~i~0 38)} assume true; {60067#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:58,145 INFO L273 TraceCheckUtils]: 159: Hoare triple {60067#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60067#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:58,146 INFO L273 TraceCheckUtils]: 160: Hoare triple {60067#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60067#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:58,146 INFO L273 TraceCheckUtils]: 161: Hoare triple {60067#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {60068#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:58,147 INFO L273 TraceCheckUtils]: 162: Hoare triple {60068#(<= main_~i~0 39)} assume true; {60068#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:58,147 INFO L273 TraceCheckUtils]: 163: Hoare triple {60068#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60068#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:58,148 INFO L273 TraceCheckUtils]: 164: Hoare triple {60068#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60068#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:58,148 INFO L273 TraceCheckUtils]: 165: Hoare triple {60068#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {60069#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:58,149 INFO L273 TraceCheckUtils]: 166: Hoare triple {60069#(<= main_~i~0 40)} assume true; {60069#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:58,149 INFO L273 TraceCheckUtils]: 167: Hoare triple {60069#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60069#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:58,150 INFO L273 TraceCheckUtils]: 168: Hoare triple {60069#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60069#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:58,151 INFO L273 TraceCheckUtils]: 169: Hoare triple {60069#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {60070#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:58,151 INFO L273 TraceCheckUtils]: 170: Hoare triple {60070#(<= main_~i~0 41)} assume true; {60070#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:58,152 INFO L273 TraceCheckUtils]: 171: Hoare triple {60070#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60070#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:58,152 INFO L273 TraceCheckUtils]: 172: Hoare triple {60070#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60070#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:58,153 INFO L273 TraceCheckUtils]: 173: Hoare triple {60070#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {60071#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:58,153 INFO L273 TraceCheckUtils]: 174: Hoare triple {60071#(<= main_~i~0 42)} assume true; {60071#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:58,154 INFO L273 TraceCheckUtils]: 175: Hoare triple {60071#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60071#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:58,154 INFO L273 TraceCheckUtils]: 176: Hoare triple {60071#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60071#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:58,155 INFO L273 TraceCheckUtils]: 177: Hoare triple {60071#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {60072#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:58,156 INFO L273 TraceCheckUtils]: 178: Hoare triple {60072#(<= main_~i~0 43)} assume true; {60072#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:58,156 INFO L273 TraceCheckUtils]: 179: Hoare triple {60072#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60072#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:58,156 INFO L273 TraceCheckUtils]: 180: Hoare triple {60072#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60072#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:58,157 INFO L273 TraceCheckUtils]: 181: Hoare triple {60072#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {60073#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:58,158 INFO L273 TraceCheckUtils]: 182: Hoare triple {60073#(<= main_~i~0 44)} assume true; {60073#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:58,158 INFO L273 TraceCheckUtils]: 183: Hoare triple {60073#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60073#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:58,159 INFO L273 TraceCheckUtils]: 184: Hoare triple {60073#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60073#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:58,159 INFO L273 TraceCheckUtils]: 185: Hoare triple {60073#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {60074#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:58,160 INFO L273 TraceCheckUtils]: 186: Hoare triple {60074#(<= main_~i~0 45)} assume true; {60074#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:58,160 INFO L273 TraceCheckUtils]: 187: Hoare triple {60074#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60074#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:58,161 INFO L273 TraceCheckUtils]: 188: Hoare triple {60074#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60074#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:58,162 INFO L273 TraceCheckUtils]: 189: Hoare triple {60074#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {60075#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:58,162 INFO L273 TraceCheckUtils]: 190: Hoare triple {60075#(<= main_~i~0 46)} assume true; {60075#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:58,163 INFO L273 TraceCheckUtils]: 191: Hoare triple {60075#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60075#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:58,163 INFO L273 TraceCheckUtils]: 192: Hoare triple {60075#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60075#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:58,164 INFO L273 TraceCheckUtils]: 193: Hoare triple {60075#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {60076#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:58,164 INFO L273 TraceCheckUtils]: 194: Hoare triple {60076#(<= main_~i~0 47)} assume true; {60076#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:58,165 INFO L273 TraceCheckUtils]: 195: Hoare triple {60076#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60076#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:58,165 INFO L273 TraceCheckUtils]: 196: Hoare triple {60076#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60076#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:58,166 INFO L273 TraceCheckUtils]: 197: Hoare triple {60076#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {60077#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:58,167 INFO L273 TraceCheckUtils]: 198: Hoare triple {60077#(<= main_~i~0 48)} assume true; {60077#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:58,167 INFO L273 TraceCheckUtils]: 199: Hoare triple {60077#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60077#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:58,168 INFO L273 TraceCheckUtils]: 200: Hoare triple {60077#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60077#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:58,168 INFO L273 TraceCheckUtils]: 201: Hoare triple {60077#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {60078#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:58,169 INFO L273 TraceCheckUtils]: 202: Hoare triple {60078#(<= main_~i~0 49)} assume true; {60078#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:58,169 INFO L273 TraceCheckUtils]: 203: Hoare triple {60078#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60078#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:58,170 INFO L273 TraceCheckUtils]: 204: Hoare triple {60078#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60078#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:58,171 INFO L273 TraceCheckUtils]: 205: Hoare triple {60078#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {60079#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:58,171 INFO L273 TraceCheckUtils]: 206: Hoare triple {60079#(<= main_~i~0 50)} assume true; {60079#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:58,172 INFO L273 TraceCheckUtils]: 207: Hoare triple {60079#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60079#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:58,172 INFO L273 TraceCheckUtils]: 208: Hoare triple {60079#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60079#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:58,173 INFO L273 TraceCheckUtils]: 209: Hoare triple {60079#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {60080#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:58,173 INFO L273 TraceCheckUtils]: 210: Hoare triple {60080#(<= main_~i~0 51)} assume true; {60080#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:58,174 INFO L273 TraceCheckUtils]: 211: Hoare triple {60080#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60080#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:58,174 INFO L273 TraceCheckUtils]: 212: Hoare triple {60080#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60080#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:58,175 INFO L273 TraceCheckUtils]: 213: Hoare triple {60080#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {60081#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:58,175 INFO L273 TraceCheckUtils]: 214: Hoare triple {60081#(<= main_~i~0 52)} assume true; {60081#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:58,176 INFO L273 TraceCheckUtils]: 215: Hoare triple {60081#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60081#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:58,176 INFO L273 TraceCheckUtils]: 216: Hoare triple {60081#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60081#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:58,177 INFO L273 TraceCheckUtils]: 217: Hoare triple {60081#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {60082#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:58,178 INFO L273 TraceCheckUtils]: 218: Hoare triple {60082#(<= main_~i~0 53)} assume true; {60082#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:58,178 INFO L273 TraceCheckUtils]: 219: Hoare triple {60082#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60082#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:58,179 INFO L273 TraceCheckUtils]: 220: Hoare triple {60082#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60082#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:58,179 INFO L273 TraceCheckUtils]: 221: Hoare triple {60082#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {60083#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:58,180 INFO L273 TraceCheckUtils]: 222: Hoare triple {60083#(<= main_~i~0 54)} assume true; {60083#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:58,180 INFO L273 TraceCheckUtils]: 223: Hoare triple {60083#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60083#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:58,181 INFO L273 TraceCheckUtils]: 224: Hoare triple {60083#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60083#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:58,182 INFO L273 TraceCheckUtils]: 225: Hoare triple {60083#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {60084#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:58,182 INFO L273 TraceCheckUtils]: 226: Hoare triple {60084#(<= main_~i~0 55)} assume true; {60084#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:58,183 INFO L273 TraceCheckUtils]: 227: Hoare triple {60084#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60084#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:58,183 INFO L273 TraceCheckUtils]: 228: Hoare triple {60084#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60084#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:58,184 INFO L273 TraceCheckUtils]: 229: Hoare triple {60084#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {60085#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:58,184 INFO L273 TraceCheckUtils]: 230: Hoare triple {60085#(<= main_~i~0 56)} assume true; {60085#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:58,185 INFO L273 TraceCheckUtils]: 231: Hoare triple {60085#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60085#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:58,185 INFO L273 TraceCheckUtils]: 232: Hoare triple {60085#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60085#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:58,186 INFO L273 TraceCheckUtils]: 233: Hoare triple {60085#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {60086#(<= main_~i~0 57)} is VALID [2018-11-18 22:58:58,186 INFO L273 TraceCheckUtils]: 234: Hoare triple {60086#(<= main_~i~0 57)} assume true; {60086#(<= main_~i~0 57)} is VALID [2018-11-18 22:58:58,187 INFO L273 TraceCheckUtils]: 235: Hoare triple {60086#(<= main_~i~0 57)} assume !(~i~0 < 100000); {60028#false} is VALID [2018-11-18 22:58:58,187 INFO L273 TraceCheckUtils]: 236: Hoare triple {60028#false} havoc ~x~0;~x~0 := 0; {60028#false} is VALID [2018-11-18 22:58:58,188 INFO L273 TraceCheckUtils]: 237: Hoare triple {60028#false} assume true; {60028#false} is VALID [2018-11-18 22:58:58,188 INFO L273 TraceCheckUtils]: 238: Hoare triple {60028#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {60028#false} is VALID [2018-11-18 22:58:58,188 INFO L256 TraceCheckUtils]: 239: Hoare triple {60028#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {60028#false} is VALID [2018-11-18 22:58:58,188 INFO L273 TraceCheckUtils]: 240: Hoare triple {60028#false} ~cond := #in~cond; {60028#false} is VALID [2018-11-18 22:58:58,188 INFO L273 TraceCheckUtils]: 241: Hoare triple {60028#false} assume 0 == ~cond; {60028#false} is VALID [2018-11-18 22:58:58,188 INFO L273 TraceCheckUtils]: 242: Hoare triple {60028#false} assume !false; {60028#false} is VALID [2018-11-18 22:58:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:58,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:58,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:58,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:58:58,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-11-18 22:58:58,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:58,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:59,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {60027#true} call ULTIMATE.init(); {60027#true} is VALID [2018-11-18 22:58:59,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {60027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {60027#true} is VALID [2018-11-18 22:58:59,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {60027#true} assume true; {60027#true} is VALID [2018-11-18 22:58:59,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60027#true} {60027#true} #57#return; {60027#true} is VALID [2018-11-18 22:58:59,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {60027#true} call #t~ret4 := main(); {60027#true} is VALID [2018-11-18 22:58:59,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {60027#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {60105#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:59,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {60105#(<= main_~i~0 0)} assume true; {60105#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:59,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {60105#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60105#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:59,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {60105#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60105#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:59,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {60105#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {60030#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:59,017 INFO L273 TraceCheckUtils]: 10: Hoare triple {60030#(<= main_~i~0 1)} assume true; {60030#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:59,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {60030#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60030#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:59,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {60030#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60030#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:59,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {60030#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {60031#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:59,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {60031#(<= main_~i~0 2)} assume true; {60031#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:59,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {60031#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60031#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:59,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {60031#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60031#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:59,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {60031#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {60032#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:59,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {60032#(<= main_~i~0 3)} assume true; {60032#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:59,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {60032#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60032#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:59,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {60032#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60032#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:59,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {60032#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {60033#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:59,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {60033#(<= main_~i~0 4)} assume true; {60033#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:59,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {60033#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60033#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:59,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {60033#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60033#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:59,025 INFO L273 TraceCheckUtils]: 25: Hoare triple {60033#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {60034#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:59,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {60034#(<= main_~i~0 5)} assume true; {60034#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:59,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {60034#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60034#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:59,027 INFO L273 TraceCheckUtils]: 28: Hoare triple {60034#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60034#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:59,027 INFO L273 TraceCheckUtils]: 29: Hoare triple {60034#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {60035#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:59,028 INFO L273 TraceCheckUtils]: 30: Hoare triple {60035#(<= main_~i~0 6)} assume true; {60035#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:59,028 INFO L273 TraceCheckUtils]: 31: Hoare triple {60035#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60035#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:59,029 INFO L273 TraceCheckUtils]: 32: Hoare triple {60035#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60035#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:59,030 INFO L273 TraceCheckUtils]: 33: Hoare triple {60035#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {60036#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:59,030 INFO L273 TraceCheckUtils]: 34: Hoare triple {60036#(<= main_~i~0 7)} assume true; {60036#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:59,031 INFO L273 TraceCheckUtils]: 35: Hoare triple {60036#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60036#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:59,031 INFO L273 TraceCheckUtils]: 36: Hoare triple {60036#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60036#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:59,032 INFO L273 TraceCheckUtils]: 37: Hoare triple {60036#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {60037#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:59,032 INFO L273 TraceCheckUtils]: 38: Hoare triple {60037#(<= main_~i~0 8)} assume true; {60037#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:59,033 INFO L273 TraceCheckUtils]: 39: Hoare triple {60037#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60037#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:59,033 INFO L273 TraceCheckUtils]: 40: Hoare triple {60037#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60037#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:59,034 INFO L273 TraceCheckUtils]: 41: Hoare triple {60037#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {60038#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:59,034 INFO L273 TraceCheckUtils]: 42: Hoare triple {60038#(<= main_~i~0 9)} assume true; {60038#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:59,035 INFO L273 TraceCheckUtils]: 43: Hoare triple {60038#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60038#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:59,035 INFO L273 TraceCheckUtils]: 44: Hoare triple {60038#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60038#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:59,036 INFO L273 TraceCheckUtils]: 45: Hoare triple {60038#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {60039#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:59,037 INFO L273 TraceCheckUtils]: 46: Hoare triple {60039#(<= main_~i~0 10)} assume true; {60039#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:59,037 INFO L273 TraceCheckUtils]: 47: Hoare triple {60039#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60039#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:59,038 INFO L273 TraceCheckUtils]: 48: Hoare triple {60039#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60039#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:59,038 INFO L273 TraceCheckUtils]: 49: Hoare triple {60039#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {60040#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:59,039 INFO L273 TraceCheckUtils]: 50: Hoare triple {60040#(<= main_~i~0 11)} assume true; {60040#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:59,039 INFO L273 TraceCheckUtils]: 51: Hoare triple {60040#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60040#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:59,040 INFO L273 TraceCheckUtils]: 52: Hoare triple {60040#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60040#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:59,041 INFO L273 TraceCheckUtils]: 53: Hoare triple {60040#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {60041#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:59,041 INFO L273 TraceCheckUtils]: 54: Hoare triple {60041#(<= main_~i~0 12)} assume true; {60041#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:59,042 INFO L273 TraceCheckUtils]: 55: Hoare triple {60041#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60041#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:59,042 INFO L273 TraceCheckUtils]: 56: Hoare triple {60041#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60041#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:59,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {60041#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {60042#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:59,043 INFO L273 TraceCheckUtils]: 58: Hoare triple {60042#(<= main_~i~0 13)} assume true; {60042#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:59,044 INFO L273 TraceCheckUtils]: 59: Hoare triple {60042#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60042#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:59,044 INFO L273 TraceCheckUtils]: 60: Hoare triple {60042#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60042#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:59,045 INFO L273 TraceCheckUtils]: 61: Hoare triple {60042#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {60043#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:59,045 INFO L273 TraceCheckUtils]: 62: Hoare triple {60043#(<= main_~i~0 14)} assume true; {60043#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:59,046 INFO L273 TraceCheckUtils]: 63: Hoare triple {60043#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60043#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:59,046 INFO L273 TraceCheckUtils]: 64: Hoare triple {60043#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60043#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:59,047 INFO L273 TraceCheckUtils]: 65: Hoare triple {60043#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {60044#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:59,048 INFO L273 TraceCheckUtils]: 66: Hoare triple {60044#(<= main_~i~0 15)} assume true; {60044#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:59,048 INFO L273 TraceCheckUtils]: 67: Hoare triple {60044#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60044#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:59,049 INFO L273 TraceCheckUtils]: 68: Hoare triple {60044#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60044#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:59,049 INFO L273 TraceCheckUtils]: 69: Hoare triple {60044#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {60045#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:59,050 INFO L273 TraceCheckUtils]: 70: Hoare triple {60045#(<= main_~i~0 16)} assume true; {60045#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:59,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {60045#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60045#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:59,051 INFO L273 TraceCheckUtils]: 72: Hoare triple {60045#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60045#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:59,052 INFO L273 TraceCheckUtils]: 73: Hoare triple {60045#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {60046#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:59,052 INFO L273 TraceCheckUtils]: 74: Hoare triple {60046#(<= main_~i~0 17)} assume true; {60046#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:59,053 INFO L273 TraceCheckUtils]: 75: Hoare triple {60046#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60046#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:59,053 INFO L273 TraceCheckUtils]: 76: Hoare triple {60046#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60046#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:59,054 INFO L273 TraceCheckUtils]: 77: Hoare triple {60046#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {60047#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:59,054 INFO L273 TraceCheckUtils]: 78: Hoare triple {60047#(<= main_~i~0 18)} assume true; {60047#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:59,055 INFO L273 TraceCheckUtils]: 79: Hoare triple {60047#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60047#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:59,055 INFO L273 TraceCheckUtils]: 80: Hoare triple {60047#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60047#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:59,056 INFO L273 TraceCheckUtils]: 81: Hoare triple {60047#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {60048#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:59,056 INFO L273 TraceCheckUtils]: 82: Hoare triple {60048#(<= main_~i~0 19)} assume true; {60048#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:59,057 INFO L273 TraceCheckUtils]: 83: Hoare triple {60048#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60048#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:59,057 INFO L273 TraceCheckUtils]: 84: Hoare triple {60048#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60048#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:59,058 INFO L273 TraceCheckUtils]: 85: Hoare triple {60048#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {60049#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:59,059 INFO L273 TraceCheckUtils]: 86: Hoare triple {60049#(<= main_~i~0 20)} assume true; {60049#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:59,059 INFO L273 TraceCheckUtils]: 87: Hoare triple {60049#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60049#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:59,060 INFO L273 TraceCheckUtils]: 88: Hoare triple {60049#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60049#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:59,060 INFO L273 TraceCheckUtils]: 89: Hoare triple {60049#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {60050#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:59,061 INFO L273 TraceCheckUtils]: 90: Hoare triple {60050#(<= main_~i~0 21)} assume true; {60050#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:59,061 INFO L273 TraceCheckUtils]: 91: Hoare triple {60050#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60050#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:59,062 INFO L273 TraceCheckUtils]: 92: Hoare triple {60050#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60050#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:59,063 INFO L273 TraceCheckUtils]: 93: Hoare triple {60050#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {60051#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:59,063 INFO L273 TraceCheckUtils]: 94: Hoare triple {60051#(<= main_~i~0 22)} assume true; {60051#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:59,064 INFO L273 TraceCheckUtils]: 95: Hoare triple {60051#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60051#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:59,064 INFO L273 TraceCheckUtils]: 96: Hoare triple {60051#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60051#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:59,065 INFO L273 TraceCheckUtils]: 97: Hoare triple {60051#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {60052#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:59,065 INFO L273 TraceCheckUtils]: 98: Hoare triple {60052#(<= main_~i~0 23)} assume true; {60052#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:59,066 INFO L273 TraceCheckUtils]: 99: Hoare triple {60052#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60052#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:59,066 INFO L273 TraceCheckUtils]: 100: Hoare triple {60052#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60052#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:59,067 INFO L273 TraceCheckUtils]: 101: Hoare triple {60052#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {60053#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:59,068 INFO L273 TraceCheckUtils]: 102: Hoare triple {60053#(<= main_~i~0 24)} assume true; {60053#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:59,068 INFO L273 TraceCheckUtils]: 103: Hoare triple {60053#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60053#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:59,069 INFO L273 TraceCheckUtils]: 104: Hoare triple {60053#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60053#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:59,069 INFO L273 TraceCheckUtils]: 105: Hoare triple {60053#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {60054#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:59,070 INFO L273 TraceCheckUtils]: 106: Hoare triple {60054#(<= main_~i~0 25)} assume true; {60054#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:59,070 INFO L273 TraceCheckUtils]: 107: Hoare triple {60054#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60054#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:59,071 INFO L273 TraceCheckUtils]: 108: Hoare triple {60054#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60054#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:59,071 INFO L273 TraceCheckUtils]: 109: Hoare triple {60054#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {60055#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:59,072 INFO L273 TraceCheckUtils]: 110: Hoare triple {60055#(<= main_~i~0 26)} assume true; {60055#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:59,072 INFO L273 TraceCheckUtils]: 111: Hoare triple {60055#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60055#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:59,073 INFO L273 TraceCheckUtils]: 112: Hoare triple {60055#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60055#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:59,074 INFO L273 TraceCheckUtils]: 113: Hoare triple {60055#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {60056#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:59,074 INFO L273 TraceCheckUtils]: 114: Hoare triple {60056#(<= main_~i~0 27)} assume true; {60056#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:59,075 INFO L273 TraceCheckUtils]: 115: Hoare triple {60056#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60056#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:59,075 INFO L273 TraceCheckUtils]: 116: Hoare triple {60056#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60056#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:59,076 INFO L273 TraceCheckUtils]: 117: Hoare triple {60056#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {60057#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:59,076 INFO L273 TraceCheckUtils]: 118: Hoare triple {60057#(<= main_~i~0 28)} assume true; {60057#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:59,077 INFO L273 TraceCheckUtils]: 119: Hoare triple {60057#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60057#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:59,077 INFO L273 TraceCheckUtils]: 120: Hoare triple {60057#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60057#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:59,078 INFO L273 TraceCheckUtils]: 121: Hoare triple {60057#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {60058#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:59,079 INFO L273 TraceCheckUtils]: 122: Hoare triple {60058#(<= main_~i~0 29)} assume true; {60058#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:59,079 INFO L273 TraceCheckUtils]: 123: Hoare triple {60058#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60058#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:59,080 INFO L273 TraceCheckUtils]: 124: Hoare triple {60058#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60058#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:59,080 INFO L273 TraceCheckUtils]: 125: Hoare triple {60058#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {60059#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:59,081 INFO L273 TraceCheckUtils]: 126: Hoare triple {60059#(<= main_~i~0 30)} assume true; {60059#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:59,081 INFO L273 TraceCheckUtils]: 127: Hoare triple {60059#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60059#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:59,082 INFO L273 TraceCheckUtils]: 128: Hoare triple {60059#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60059#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:59,082 INFO L273 TraceCheckUtils]: 129: Hoare triple {60059#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {60060#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:59,083 INFO L273 TraceCheckUtils]: 130: Hoare triple {60060#(<= main_~i~0 31)} assume true; {60060#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:59,083 INFO L273 TraceCheckUtils]: 131: Hoare triple {60060#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60060#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:59,084 INFO L273 TraceCheckUtils]: 132: Hoare triple {60060#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60060#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:59,085 INFO L273 TraceCheckUtils]: 133: Hoare triple {60060#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {60061#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:59,085 INFO L273 TraceCheckUtils]: 134: Hoare triple {60061#(<= main_~i~0 32)} assume true; {60061#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:59,086 INFO L273 TraceCheckUtils]: 135: Hoare triple {60061#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60061#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:59,086 INFO L273 TraceCheckUtils]: 136: Hoare triple {60061#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60061#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:59,087 INFO L273 TraceCheckUtils]: 137: Hoare triple {60061#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {60062#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:59,087 INFO L273 TraceCheckUtils]: 138: Hoare triple {60062#(<= main_~i~0 33)} assume true; {60062#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:59,088 INFO L273 TraceCheckUtils]: 139: Hoare triple {60062#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60062#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:59,088 INFO L273 TraceCheckUtils]: 140: Hoare triple {60062#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60062#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:59,089 INFO L273 TraceCheckUtils]: 141: Hoare triple {60062#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {60063#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:59,090 INFO L273 TraceCheckUtils]: 142: Hoare triple {60063#(<= main_~i~0 34)} assume true; {60063#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:59,090 INFO L273 TraceCheckUtils]: 143: Hoare triple {60063#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60063#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:59,091 INFO L273 TraceCheckUtils]: 144: Hoare triple {60063#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60063#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:59,091 INFO L273 TraceCheckUtils]: 145: Hoare triple {60063#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {60064#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:59,092 INFO L273 TraceCheckUtils]: 146: Hoare triple {60064#(<= main_~i~0 35)} assume true; {60064#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:59,092 INFO L273 TraceCheckUtils]: 147: Hoare triple {60064#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60064#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:59,093 INFO L273 TraceCheckUtils]: 148: Hoare triple {60064#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60064#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:59,093 INFO L273 TraceCheckUtils]: 149: Hoare triple {60064#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {60065#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:59,094 INFO L273 TraceCheckUtils]: 150: Hoare triple {60065#(<= main_~i~0 36)} assume true; {60065#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:59,094 INFO L273 TraceCheckUtils]: 151: Hoare triple {60065#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60065#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:59,095 INFO L273 TraceCheckUtils]: 152: Hoare triple {60065#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60065#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:59,096 INFO L273 TraceCheckUtils]: 153: Hoare triple {60065#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {60066#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:59,096 INFO L273 TraceCheckUtils]: 154: Hoare triple {60066#(<= main_~i~0 37)} assume true; {60066#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:59,097 INFO L273 TraceCheckUtils]: 155: Hoare triple {60066#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60066#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:59,097 INFO L273 TraceCheckUtils]: 156: Hoare triple {60066#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60066#(<= main_~i~0 37)} is VALID [2018-11-18 22:58:59,098 INFO L273 TraceCheckUtils]: 157: Hoare triple {60066#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {60067#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:59,098 INFO L273 TraceCheckUtils]: 158: Hoare triple {60067#(<= main_~i~0 38)} assume true; {60067#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:59,099 INFO L273 TraceCheckUtils]: 159: Hoare triple {60067#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60067#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:59,099 INFO L273 TraceCheckUtils]: 160: Hoare triple {60067#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60067#(<= main_~i~0 38)} is VALID [2018-11-18 22:58:59,100 INFO L273 TraceCheckUtils]: 161: Hoare triple {60067#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {60068#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:59,101 INFO L273 TraceCheckUtils]: 162: Hoare triple {60068#(<= main_~i~0 39)} assume true; {60068#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:59,101 INFO L273 TraceCheckUtils]: 163: Hoare triple {60068#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60068#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:59,102 INFO L273 TraceCheckUtils]: 164: Hoare triple {60068#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60068#(<= main_~i~0 39)} is VALID [2018-11-18 22:58:59,102 INFO L273 TraceCheckUtils]: 165: Hoare triple {60068#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {60069#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:59,103 INFO L273 TraceCheckUtils]: 166: Hoare triple {60069#(<= main_~i~0 40)} assume true; {60069#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:59,103 INFO L273 TraceCheckUtils]: 167: Hoare triple {60069#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60069#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:59,104 INFO L273 TraceCheckUtils]: 168: Hoare triple {60069#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60069#(<= main_~i~0 40)} is VALID [2018-11-18 22:58:59,105 INFO L273 TraceCheckUtils]: 169: Hoare triple {60069#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {60070#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:59,105 INFO L273 TraceCheckUtils]: 170: Hoare triple {60070#(<= main_~i~0 41)} assume true; {60070#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:59,106 INFO L273 TraceCheckUtils]: 171: Hoare triple {60070#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60070#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:59,106 INFO L273 TraceCheckUtils]: 172: Hoare triple {60070#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60070#(<= main_~i~0 41)} is VALID [2018-11-18 22:58:59,107 INFO L273 TraceCheckUtils]: 173: Hoare triple {60070#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {60071#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:59,107 INFO L273 TraceCheckUtils]: 174: Hoare triple {60071#(<= main_~i~0 42)} assume true; {60071#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:59,108 INFO L273 TraceCheckUtils]: 175: Hoare triple {60071#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60071#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:59,108 INFO L273 TraceCheckUtils]: 176: Hoare triple {60071#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60071#(<= main_~i~0 42)} is VALID [2018-11-18 22:58:59,109 INFO L273 TraceCheckUtils]: 177: Hoare triple {60071#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {60072#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:59,109 INFO L273 TraceCheckUtils]: 178: Hoare triple {60072#(<= main_~i~0 43)} assume true; {60072#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:59,110 INFO L273 TraceCheckUtils]: 179: Hoare triple {60072#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60072#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:59,110 INFO L273 TraceCheckUtils]: 180: Hoare triple {60072#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60072#(<= main_~i~0 43)} is VALID [2018-11-18 22:58:59,111 INFO L273 TraceCheckUtils]: 181: Hoare triple {60072#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {60073#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:59,112 INFO L273 TraceCheckUtils]: 182: Hoare triple {60073#(<= main_~i~0 44)} assume true; {60073#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:59,112 INFO L273 TraceCheckUtils]: 183: Hoare triple {60073#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60073#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:59,113 INFO L273 TraceCheckUtils]: 184: Hoare triple {60073#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60073#(<= main_~i~0 44)} is VALID [2018-11-18 22:58:59,113 INFO L273 TraceCheckUtils]: 185: Hoare triple {60073#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {60074#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:59,114 INFO L273 TraceCheckUtils]: 186: Hoare triple {60074#(<= main_~i~0 45)} assume true; {60074#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:59,114 INFO L273 TraceCheckUtils]: 187: Hoare triple {60074#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60074#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:59,115 INFO L273 TraceCheckUtils]: 188: Hoare triple {60074#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60074#(<= main_~i~0 45)} is VALID [2018-11-18 22:58:59,116 INFO L273 TraceCheckUtils]: 189: Hoare triple {60074#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {60075#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:59,116 INFO L273 TraceCheckUtils]: 190: Hoare triple {60075#(<= main_~i~0 46)} assume true; {60075#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:59,117 INFO L273 TraceCheckUtils]: 191: Hoare triple {60075#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60075#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:59,117 INFO L273 TraceCheckUtils]: 192: Hoare triple {60075#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60075#(<= main_~i~0 46)} is VALID [2018-11-18 22:58:59,118 INFO L273 TraceCheckUtils]: 193: Hoare triple {60075#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {60076#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:59,118 INFO L273 TraceCheckUtils]: 194: Hoare triple {60076#(<= main_~i~0 47)} assume true; {60076#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:59,119 INFO L273 TraceCheckUtils]: 195: Hoare triple {60076#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60076#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:59,119 INFO L273 TraceCheckUtils]: 196: Hoare triple {60076#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60076#(<= main_~i~0 47)} is VALID [2018-11-18 22:58:59,120 INFO L273 TraceCheckUtils]: 197: Hoare triple {60076#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {60077#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:59,120 INFO L273 TraceCheckUtils]: 198: Hoare triple {60077#(<= main_~i~0 48)} assume true; {60077#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:59,121 INFO L273 TraceCheckUtils]: 199: Hoare triple {60077#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60077#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:59,121 INFO L273 TraceCheckUtils]: 200: Hoare triple {60077#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60077#(<= main_~i~0 48)} is VALID [2018-11-18 22:58:59,122 INFO L273 TraceCheckUtils]: 201: Hoare triple {60077#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {60078#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:59,123 INFO L273 TraceCheckUtils]: 202: Hoare triple {60078#(<= main_~i~0 49)} assume true; {60078#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:59,123 INFO L273 TraceCheckUtils]: 203: Hoare triple {60078#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60078#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:59,124 INFO L273 TraceCheckUtils]: 204: Hoare triple {60078#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60078#(<= main_~i~0 49)} is VALID [2018-11-18 22:58:59,124 INFO L273 TraceCheckUtils]: 205: Hoare triple {60078#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {60079#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:59,125 INFO L273 TraceCheckUtils]: 206: Hoare triple {60079#(<= main_~i~0 50)} assume true; {60079#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:59,125 INFO L273 TraceCheckUtils]: 207: Hoare triple {60079#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60079#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:59,126 INFO L273 TraceCheckUtils]: 208: Hoare triple {60079#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60079#(<= main_~i~0 50)} is VALID [2018-11-18 22:58:59,127 INFO L273 TraceCheckUtils]: 209: Hoare triple {60079#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {60080#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:59,127 INFO L273 TraceCheckUtils]: 210: Hoare triple {60080#(<= main_~i~0 51)} assume true; {60080#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:59,128 INFO L273 TraceCheckUtils]: 211: Hoare triple {60080#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60080#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:59,128 INFO L273 TraceCheckUtils]: 212: Hoare triple {60080#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60080#(<= main_~i~0 51)} is VALID [2018-11-18 22:58:59,129 INFO L273 TraceCheckUtils]: 213: Hoare triple {60080#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {60081#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:59,129 INFO L273 TraceCheckUtils]: 214: Hoare triple {60081#(<= main_~i~0 52)} assume true; {60081#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:59,130 INFO L273 TraceCheckUtils]: 215: Hoare triple {60081#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60081#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:59,130 INFO L273 TraceCheckUtils]: 216: Hoare triple {60081#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60081#(<= main_~i~0 52)} is VALID [2018-11-18 22:58:59,131 INFO L273 TraceCheckUtils]: 217: Hoare triple {60081#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {60082#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:59,131 INFO L273 TraceCheckUtils]: 218: Hoare triple {60082#(<= main_~i~0 53)} assume true; {60082#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:59,132 INFO L273 TraceCheckUtils]: 219: Hoare triple {60082#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60082#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:59,132 INFO L273 TraceCheckUtils]: 220: Hoare triple {60082#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60082#(<= main_~i~0 53)} is VALID [2018-11-18 22:58:59,133 INFO L273 TraceCheckUtils]: 221: Hoare triple {60082#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {60083#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:59,134 INFO L273 TraceCheckUtils]: 222: Hoare triple {60083#(<= main_~i~0 54)} assume true; {60083#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:59,134 INFO L273 TraceCheckUtils]: 223: Hoare triple {60083#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60083#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:59,135 INFO L273 TraceCheckUtils]: 224: Hoare triple {60083#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60083#(<= main_~i~0 54)} is VALID [2018-11-18 22:58:59,135 INFO L273 TraceCheckUtils]: 225: Hoare triple {60083#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {60084#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:59,136 INFO L273 TraceCheckUtils]: 226: Hoare triple {60084#(<= main_~i~0 55)} assume true; {60084#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:59,136 INFO L273 TraceCheckUtils]: 227: Hoare triple {60084#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60084#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:59,137 INFO L273 TraceCheckUtils]: 228: Hoare triple {60084#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60084#(<= main_~i~0 55)} is VALID [2018-11-18 22:58:59,138 INFO L273 TraceCheckUtils]: 229: Hoare triple {60084#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {60085#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:59,138 INFO L273 TraceCheckUtils]: 230: Hoare triple {60085#(<= main_~i~0 56)} assume true; {60085#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:59,139 INFO L273 TraceCheckUtils]: 231: Hoare triple {60085#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60085#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:59,139 INFO L273 TraceCheckUtils]: 232: Hoare triple {60085#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {60085#(<= main_~i~0 56)} is VALID [2018-11-18 22:58:59,140 INFO L273 TraceCheckUtils]: 233: Hoare triple {60085#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {60086#(<= main_~i~0 57)} is VALID [2018-11-18 22:58:59,140 INFO L273 TraceCheckUtils]: 234: Hoare triple {60086#(<= main_~i~0 57)} assume true; {60086#(<= main_~i~0 57)} is VALID [2018-11-18 22:58:59,141 INFO L273 TraceCheckUtils]: 235: Hoare triple {60086#(<= main_~i~0 57)} assume !(~i~0 < 100000); {60028#false} is VALID [2018-11-18 22:58:59,141 INFO L273 TraceCheckUtils]: 236: Hoare triple {60028#false} havoc ~x~0;~x~0 := 0; {60028#false} is VALID [2018-11-18 22:58:59,141 INFO L273 TraceCheckUtils]: 237: Hoare triple {60028#false} assume true; {60028#false} is VALID [2018-11-18 22:58:59,142 INFO L273 TraceCheckUtils]: 238: Hoare triple {60028#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {60028#false} is VALID [2018-11-18 22:58:59,142 INFO L256 TraceCheckUtils]: 239: Hoare triple {60028#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {60028#false} is VALID [2018-11-18 22:58:59,142 INFO L273 TraceCheckUtils]: 240: Hoare triple {60028#false} ~cond := #in~cond; {60028#false} is VALID [2018-11-18 22:58:59,142 INFO L273 TraceCheckUtils]: 241: Hoare triple {60028#false} assume 0 == ~cond; {60028#false} is VALID [2018-11-18 22:58:59,142 INFO L273 TraceCheckUtils]: 242: Hoare triple {60028#false} assume !false; {60028#false} is VALID [2018-11-18 22:58:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:59,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:59,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2018-11-18 22:58:59,219 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 243 [2018-11-18 22:58:59,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:59,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states. [2018-11-18 22:58:59,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:59,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-18 22:58:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-18 22:58:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-18 22:58:59,457 INFO L87 Difference]: Start difference. First operand 248 states and 306 transitions. Second operand 61 states. [2018-11-18 22:59:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:00,846 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2018-11-18 22:59:00,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-18 22:59:00,846 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 243 [2018-11-18 22:59:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:59:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 22:59:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 327 transitions. [2018-11-18 22:59:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 22:59:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 327 transitions. [2018-11-18 22:59:00,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 327 transitions. [2018-11-18 22:59:01,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:01,153 INFO L225 Difference]: With dead ends: 266 [2018-11-18 22:59:01,154 INFO L226 Difference]: Without dead ends: 254 [2018-11-18 22:59:01,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-18 22:59:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-18 22:59:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-11-18 22:59:01,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:59:01,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand 252 states. [2018-11-18 22:59:01,202 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand 252 states. [2018-11-18 22:59:01,202 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 252 states. [2018-11-18 22:59:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:01,206 INFO L93 Difference]: Finished difference Result 254 states and 314 transitions. [2018-11-18 22:59:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 314 transitions. [2018-11-18 22:59:01,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:01,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:01,207 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 254 states. [2018-11-18 22:59:01,207 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 254 states. [2018-11-18 22:59:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:01,211 INFO L93 Difference]: Finished difference Result 254 states and 314 transitions. [2018-11-18 22:59:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 314 transitions. [2018-11-18 22:59:01,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:01,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:01,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:59:01,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:59:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-18 22:59:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 311 transitions. [2018-11-18 22:59:01,216 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 311 transitions. Word has length 243 [2018-11-18 22:59:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:59:01,216 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 311 transitions. [2018-11-18 22:59:01,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-18 22:59:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 311 transitions. [2018-11-18 22:59:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-18 22:59:01,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:59:01,218 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:59:01,218 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:59:01,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:59:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash -818403842, now seen corresponding path program 58 times [2018-11-18 22:59:01,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:59:01,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:59:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:01,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:59:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:02,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {61977#true} call ULTIMATE.init(); {61977#true} is VALID [2018-11-18 22:59:02,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {61977#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {61977#true} is VALID [2018-11-18 22:59:02,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {61977#true} assume true; {61977#true} is VALID [2018-11-18 22:59:02,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {61977#true} {61977#true} #57#return; {61977#true} is VALID [2018-11-18 22:59:02,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {61977#true} call #t~ret4 := main(); {61977#true} is VALID [2018-11-18 22:59:02,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {61977#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {61979#(= main_~i~0 0)} is VALID [2018-11-18 22:59:02,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {61979#(= main_~i~0 0)} assume true; {61979#(= main_~i~0 0)} is VALID [2018-11-18 22:59:02,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {61979#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61979#(= main_~i~0 0)} is VALID [2018-11-18 22:59:02,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {61979#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61979#(= main_~i~0 0)} is VALID [2018-11-18 22:59:02,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {61979#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {61980#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:02,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {61980#(<= main_~i~0 1)} assume true; {61980#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:02,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {61980#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61980#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:02,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {61980#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61980#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:02,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {61980#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {61981#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:02,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {61981#(<= main_~i~0 2)} assume true; {61981#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:02,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {61981#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61981#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:02,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {61981#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61981#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:02,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {61981#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {61982#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:02,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {61982#(<= main_~i~0 3)} assume true; {61982#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:02,917 INFO L273 TraceCheckUtils]: 19: Hoare triple {61982#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61982#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:02,918 INFO L273 TraceCheckUtils]: 20: Hoare triple {61982#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61982#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:02,918 INFO L273 TraceCheckUtils]: 21: Hoare triple {61982#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {61983#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:02,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {61983#(<= main_~i~0 4)} assume true; {61983#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:02,919 INFO L273 TraceCheckUtils]: 23: Hoare triple {61983#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61983#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:02,920 INFO L273 TraceCheckUtils]: 24: Hoare triple {61983#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61983#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:02,921 INFO L273 TraceCheckUtils]: 25: Hoare triple {61983#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {61984#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:02,921 INFO L273 TraceCheckUtils]: 26: Hoare triple {61984#(<= main_~i~0 5)} assume true; {61984#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:02,922 INFO L273 TraceCheckUtils]: 27: Hoare triple {61984#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61984#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:02,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {61984#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61984#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:02,923 INFO L273 TraceCheckUtils]: 29: Hoare triple {61984#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {61985#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:02,923 INFO L273 TraceCheckUtils]: 30: Hoare triple {61985#(<= main_~i~0 6)} assume true; {61985#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:02,924 INFO L273 TraceCheckUtils]: 31: Hoare triple {61985#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61985#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:02,924 INFO L273 TraceCheckUtils]: 32: Hoare triple {61985#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61985#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:02,925 INFO L273 TraceCheckUtils]: 33: Hoare triple {61985#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {61986#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:02,925 INFO L273 TraceCheckUtils]: 34: Hoare triple {61986#(<= main_~i~0 7)} assume true; {61986#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:02,926 INFO L273 TraceCheckUtils]: 35: Hoare triple {61986#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61986#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:02,926 INFO L273 TraceCheckUtils]: 36: Hoare triple {61986#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61986#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:02,927 INFO L273 TraceCheckUtils]: 37: Hoare triple {61986#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {61987#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:02,928 INFO L273 TraceCheckUtils]: 38: Hoare triple {61987#(<= main_~i~0 8)} assume true; {61987#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:02,928 INFO L273 TraceCheckUtils]: 39: Hoare triple {61987#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61987#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:02,929 INFO L273 TraceCheckUtils]: 40: Hoare triple {61987#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61987#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:02,929 INFO L273 TraceCheckUtils]: 41: Hoare triple {61987#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {61988#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:02,930 INFO L273 TraceCheckUtils]: 42: Hoare triple {61988#(<= main_~i~0 9)} assume true; {61988#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:02,930 INFO L273 TraceCheckUtils]: 43: Hoare triple {61988#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61988#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:02,931 INFO L273 TraceCheckUtils]: 44: Hoare triple {61988#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61988#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:02,932 INFO L273 TraceCheckUtils]: 45: Hoare triple {61988#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {61989#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:02,932 INFO L273 TraceCheckUtils]: 46: Hoare triple {61989#(<= main_~i~0 10)} assume true; {61989#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:02,933 INFO L273 TraceCheckUtils]: 47: Hoare triple {61989#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61989#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:02,933 INFO L273 TraceCheckUtils]: 48: Hoare triple {61989#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61989#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:02,934 INFO L273 TraceCheckUtils]: 49: Hoare triple {61989#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {61990#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:02,934 INFO L273 TraceCheckUtils]: 50: Hoare triple {61990#(<= main_~i~0 11)} assume true; {61990#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:02,935 INFO L273 TraceCheckUtils]: 51: Hoare triple {61990#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61990#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:02,935 INFO L273 TraceCheckUtils]: 52: Hoare triple {61990#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61990#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:02,936 INFO L273 TraceCheckUtils]: 53: Hoare triple {61990#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {61991#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:02,937 INFO L273 TraceCheckUtils]: 54: Hoare triple {61991#(<= main_~i~0 12)} assume true; {61991#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:02,937 INFO L273 TraceCheckUtils]: 55: Hoare triple {61991#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61991#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:02,938 INFO L273 TraceCheckUtils]: 56: Hoare triple {61991#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61991#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:02,938 INFO L273 TraceCheckUtils]: 57: Hoare triple {61991#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {61992#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:02,939 INFO L273 TraceCheckUtils]: 58: Hoare triple {61992#(<= main_~i~0 13)} assume true; {61992#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:02,939 INFO L273 TraceCheckUtils]: 59: Hoare triple {61992#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61992#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:02,940 INFO L273 TraceCheckUtils]: 60: Hoare triple {61992#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61992#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:02,940 INFO L273 TraceCheckUtils]: 61: Hoare triple {61992#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {61993#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:02,941 INFO L273 TraceCheckUtils]: 62: Hoare triple {61993#(<= main_~i~0 14)} assume true; {61993#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:02,941 INFO L273 TraceCheckUtils]: 63: Hoare triple {61993#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61993#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:02,942 INFO L273 TraceCheckUtils]: 64: Hoare triple {61993#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61993#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:02,943 INFO L273 TraceCheckUtils]: 65: Hoare triple {61993#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {61994#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:02,943 INFO L273 TraceCheckUtils]: 66: Hoare triple {61994#(<= main_~i~0 15)} assume true; {61994#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:02,944 INFO L273 TraceCheckUtils]: 67: Hoare triple {61994#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61994#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:02,944 INFO L273 TraceCheckUtils]: 68: Hoare triple {61994#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61994#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:02,945 INFO L273 TraceCheckUtils]: 69: Hoare triple {61994#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {61995#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:02,945 INFO L273 TraceCheckUtils]: 70: Hoare triple {61995#(<= main_~i~0 16)} assume true; {61995#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:02,946 INFO L273 TraceCheckUtils]: 71: Hoare triple {61995#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61995#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:02,946 INFO L273 TraceCheckUtils]: 72: Hoare triple {61995#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61995#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:02,947 INFO L273 TraceCheckUtils]: 73: Hoare triple {61995#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {61996#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:02,948 INFO L273 TraceCheckUtils]: 74: Hoare triple {61996#(<= main_~i~0 17)} assume true; {61996#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:02,948 INFO L273 TraceCheckUtils]: 75: Hoare triple {61996#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61996#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:02,949 INFO L273 TraceCheckUtils]: 76: Hoare triple {61996#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61996#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:02,949 INFO L273 TraceCheckUtils]: 77: Hoare triple {61996#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {61997#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:02,950 INFO L273 TraceCheckUtils]: 78: Hoare triple {61997#(<= main_~i~0 18)} assume true; {61997#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:02,950 INFO L273 TraceCheckUtils]: 79: Hoare triple {61997#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61997#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:02,951 INFO L273 TraceCheckUtils]: 80: Hoare triple {61997#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61997#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:02,951 INFO L273 TraceCheckUtils]: 81: Hoare triple {61997#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {61998#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:02,952 INFO L273 TraceCheckUtils]: 82: Hoare triple {61998#(<= main_~i~0 19)} assume true; {61998#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:02,952 INFO L273 TraceCheckUtils]: 83: Hoare triple {61998#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61998#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:02,953 INFO L273 TraceCheckUtils]: 84: Hoare triple {61998#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61998#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:02,954 INFO L273 TraceCheckUtils]: 85: Hoare triple {61998#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {61999#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:02,954 INFO L273 TraceCheckUtils]: 86: Hoare triple {61999#(<= main_~i~0 20)} assume true; {61999#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:02,955 INFO L273 TraceCheckUtils]: 87: Hoare triple {61999#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61999#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:02,955 INFO L273 TraceCheckUtils]: 88: Hoare triple {61999#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61999#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:02,956 INFO L273 TraceCheckUtils]: 89: Hoare triple {61999#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {62000#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:02,956 INFO L273 TraceCheckUtils]: 90: Hoare triple {62000#(<= main_~i~0 21)} assume true; {62000#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:02,957 INFO L273 TraceCheckUtils]: 91: Hoare triple {62000#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62000#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:02,957 INFO L273 TraceCheckUtils]: 92: Hoare triple {62000#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62000#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:02,958 INFO L273 TraceCheckUtils]: 93: Hoare triple {62000#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {62001#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:02,959 INFO L273 TraceCheckUtils]: 94: Hoare triple {62001#(<= main_~i~0 22)} assume true; {62001#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:02,959 INFO L273 TraceCheckUtils]: 95: Hoare triple {62001#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62001#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:02,960 INFO L273 TraceCheckUtils]: 96: Hoare triple {62001#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62001#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:02,960 INFO L273 TraceCheckUtils]: 97: Hoare triple {62001#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {62002#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:02,961 INFO L273 TraceCheckUtils]: 98: Hoare triple {62002#(<= main_~i~0 23)} assume true; {62002#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:02,961 INFO L273 TraceCheckUtils]: 99: Hoare triple {62002#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62002#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:02,962 INFO L273 TraceCheckUtils]: 100: Hoare triple {62002#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62002#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:02,963 INFO L273 TraceCheckUtils]: 101: Hoare triple {62002#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {62003#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:02,963 INFO L273 TraceCheckUtils]: 102: Hoare triple {62003#(<= main_~i~0 24)} assume true; {62003#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:02,964 INFO L273 TraceCheckUtils]: 103: Hoare triple {62003#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62003#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:02,964 INFO L273 TraceCheckUtils]: 104: Hoare triple {62003#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62003#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:02,965 INFO L273 TraceCheckUtils]: 105: Hoare triple {62003#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {62004#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:02,965 INFO L273 TraceCheckUtils]: 106: Hoare triple {62004#(<= main_~i~0 25)} assume true; {62004#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:02,966 INFO L273 TraceCheckUtils]: 107: Hoare triple {62004#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62004#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:02,966 INFO L273 TraceCheckUtils]: 108: Hoare triple {62004#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62004#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:02,967 INFO L273 TraceCheckUtils]: 109: Hoare triple {62004#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {62005#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:02,968 INFO L273 TraceCheckUtils]: 110: Hoare triple {62005#(<= main_~i~0 26)} assume true; {62005#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:02,968 INFO L273 TraceCheckUtils]: 111: Hoare triple {62005#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62005#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:02,969 INFO L273 TraceCheckUtils]: 112: Hoare triple {62005#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62005#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:02,969 INFO L273 TraceCheckUtils]: 113: Hoare triple {62005#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {62006#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:02,970 INFO L273 TraceCheckUtils]: 114: Hoare triple {62006#(<= main_~i~0 27)} assume true; {62006#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:02,970 INFO L273 TraceCheckUtils]: 115: Hoare triple {62006#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62006#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:02,971 INFO L273 TraceCheckUtils]: 116: Hoare triple {62006#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62006#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:02,972 INFO L273 TraceCheckUtils]: 117: Hoare triple {62006#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {62007#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:02,972 INFO L273 TraceCheckUtils]: 118: Hoare triple {62007#(<= main_~i~0 28)} assume true; {62007#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:02,973 INFO L273 TraceCheckUtils]: 119: Hoare triple {62007#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62007#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:02,973 INFO L273 TraceCheckUtils]: 120: Hoare triple {62007#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62007#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:02,974 INFO L273 TraceCheckUtils]: 121: Hoare triple {62007#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {62008#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:02,974 INFO L273 TraceCheckUtils]: 122: Hoare triple {62008#(<= main_~i~0 29)} assume true; {62008#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:02,975 INFO L273 TraceCheckUtils]: 123: Hoare triple {62008#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62008#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:02,975 INFO L273 TraceCheckUtils]: 124: Hoare triple {62008#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62008#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:02,976 INFO L273 TraceCheckUtils]: 125: Hoare triple {62008#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {62009#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:02,976 INFO L273 TraceCheckUtils]: 126: Hoare triple {62009#(<= main_~i~0 30)} assume true; {62009#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:02,977 INFO L273 TraceCheckUtils]: 127: Hoare triple {62009#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62009#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:02,977 INFO L273 TraceCheckUtils]: 128: Hoare triple {62009#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62009#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:02,978 INFO L273 TraceCheckUtils]: 129: Hoare triple {62009#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {62010#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:02,979 INFO L273 TraceCheckUtils]: 130: Hoare triple {62010#(<= main_~i~0 31)} assume true; {62010#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:02,979 INFO L273 TraceCheckUtils]: 131: Hoare triple {62010#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62010#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:02,980 INFO L273 TraceCheckUtils]: 132: Hoare triple {62010#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62010#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:02,980 INFO L273 TraceCheckUtils]: 133: Hoare triple {62010#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {62011#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:02,981 INFO L273 TraceCheckUtils]: 134: Hoare triple {62011#(<= main_~i~0 32)} assume true; {62011#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:02,981 INFO L273 TraceCheckUtils]: 135: Hoare triple {62011#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62011#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:02,982 INFO L273 TraceCheckUtils]: 136: Hoare triple {62011#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62011#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:02,983 INFO L273 TraceCheckUtils]: 137: Hoare triple {62011#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {62012#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:02,983 INFO L273 TraceCheckUtils]: 138: Hoare triple {62012#(<= main_~i~0 33)} assume true; {62012#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:02,984 INFO L273 TraceCheckUtils]: 139: Hoare triple {62012#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62012#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:02,984 INFO L273 TraceCheckUtils]: 140: Hoare triple {62012#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62012#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:02,985 INFO L273 TraceCheckUtils]: 141: Hoare triple {62012#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {62013#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:02,985 INFO L273 TraceCheckUtils]: 142: Hoare triple {62013#(<= main_~i~0 34)} assume true; {62013#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:02,986 INFO L273 TraceCheckUtils]: 143: Hoare triple {62013#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62013#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:02,986 INFO L273 TraceCheckUtils]: 144: Hoare triple {62013#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62013#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:02,987 INFO L273 TraceCheckUtils]: 145: Hoare triple {62013#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {62014#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:02,988 INFO L273 TraceCheckUtils]: 146: Hoare triple {62014#(<= main_~i~0 35)} assume true; {62014#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:02,988 INFO L273 TraceCheckUtils]: 147: Hoare triple {62014#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62014#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:02,989 INFO L273 TraceCheckUtils]: 148: Hoare triple {62014#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62014#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:02,989 INFO L273 TraceCheckUtils]: 149: Hoare triple {62014#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {62015#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:02,990 INFO L273 TraceCheckUtils]: 150: Hoare triple {62015#(<= main_~i~0 36)} assume true; {62015#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:02,990 INFO L273 TraceCheckUtils]: 151: Hoare triple {62015#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62015#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:02,991 INFO L273 TraceCheckUtils]: 152: Hoare triple {62015#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62015#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:02,992 INFO L273 TraceCheckUtils]: 153: Hoare triple {62015#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {62016#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:02,992 INFO L273 TraceCheckUtils]: 154: Hoare triple {62016#(<= main_~i~0 37)} assume true; {62016#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:02,992 INFO L273 TraceCheckUtils]: 155: Hoare triple {62016#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62016#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:02,993 INFO L273 TraceCheckUtils]: 156: Hoare triple {62016#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62016#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:02,994 INFO L273 TraceCheckUtils]: 157: Hoare triple {62016#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {62017#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:02,994 INFO L273 TraceCheckUtils]: 158: Hoare triple {62017#(<= main_~i~0 38)} assume true; {62017#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:02,995 INFO L273 TraceCheckUtils]: 159: Hoare triple {62017#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62017#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:02,995 INFO L273 TraceCheckUtils]: 160: Hoare triple {62017#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62017#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:02,996 INFO L273 TraceCheckUtils]: 161: Hoare triple {62017#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {62018#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:02,996 INFO L273 TraceCheckUtils]: 162: Hoare triple {62018#(<= main_~i~0 39)} assume true; {62018#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:02,997 INFO L273 TraceCheckUtils]: 163: Hoare triple {62018#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62018#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:02,997 INFO L273 TraceCheckUtils]: 164: Hoare triple {62018#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62018#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:02,998 INFO L273 TraceCheckUtils]: 165: Hoare triple {62018#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {62019#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:02,999 INFO L273 TraceCheckUtils]: 166: Hoare triple {62019#(<= main_~i~0 40)} assume true; {62019#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:02,999 INFO L273 TraceCheckUtils]: 167: Hoare triple {62019#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62019#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:03,000 INFO L273 TraceCheckUtils]: 168: Hoare triple {62019#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62019#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:03,000 INFO L273 TraceCheckUtils]: 169: Hoare triple {62019#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {62020#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:03,001 INFO L273 TraceCheckUtils]: 170: Hoare triple {62020#(<= main_~i~0 41)} assume true; {62020#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:03,001 INFO L273 TraceCheckUtils]: 171: Hoare triple {62020#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62020#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:03,002 INFO L273 TraceCheckUtils]: 172: Hoare triple {62020#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62020#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:03,003 INFO L273 TraceCheckUtils]: 173: Hoare triple {62020#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {62021#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:03,003 INFO L273 TraceCheckUtils]: 174: Hoare triple {62021#(<= main_~i~0 42)} assume true; {62021#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:03,004 INFO L273 TraceCheckUtils]: 175: Hoare triple {62021#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62021#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:03,004 INFO L273 TraceCheckUtils]: 176: Hoare triple {62021#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62021#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:03,005 INFO L273 TraceCheckUtils]: 177: Hoare triple {62021#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {62022#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:03,005 INFO L273 TraceCheckUtils]: 178: Hoare triple {62022#(<= main_~i~0 43)} assume true; {62022#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:03,006 INFO L273 TraceCheckUtils]: 179: Hoare triple {62022#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62022#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:03,006 INFO L273 TraceCheckUtils]: 180: Hoare triple {62022#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62022#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:03,007 INFO L273 TraceCheckUtils]: 181: Hoare triple {62022#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {62023#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:03,008 INFO L273 TraceCheckUtils]: 182: Hoare triple {62023#(<= main_~i~0 44)} assume true; {62023#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:03,008 INFO L273 TraceCheckUtils]: 183: Hoare triple {62023#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62023#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:03,009 INFO L273 TraceCheckUtils]: 184: Hoare triple {62023#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62023#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:03,009 INFO L273 TraceCheckUtils]: 185: Hoare triple {62023#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {62024#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:03,010 INFO L273 TraceCheckUtils]: 186: Hoare triple {62024#(<= main_~i~0 45)} assume true; {62024#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:03,010 INFO L273 TraceCheckUtils]: 187: Hoare triple {62024#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62024#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:03,011 INFO L273 TraceCheckUtils]: 188: Hoare triple {62024#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62024#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:03,012 INFO L273 TraceCheckUtils]: 189: Hoare triple {62024#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {62025#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:03,012 INFO L273 TraceCheckUtils]: 190: Hoare triple {62025#(<= main_~i~0 46)} assume true; {62025#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:03,013 INFO L273 TraceCheckUtils]: 191: Hoare triple {62025#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62025#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:03,013 INFO L273 TraceCheckUtils]: 192: Hoare triple {62025#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62025#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:03,014 INFO L273 TraceCheckUtils]: 193: Hoare triple {62025#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {62026#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:03,014 INFO L273 TraceCheckUtils]: 194: Hoare triple {62026#(<= main_~i~0 47)} assume true; {62026#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:03,015 INFO L273 TraceCheckUtils]: 195: Hoare triple {62026#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62026#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:03,015 INFO L273 TraceCheckUtils]: 196: Hoare triple {62026#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62026#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:03,016 INFO L273 TraceCheckUtils]: 197: Hoare triple {62026#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {62027#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:03,016 INFO L273 TraceCheckUtils]: 198: Hoare triple {62027#(<= main_~i~0 48)} assume true; {62027#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:03,017 INFO L273 TraceCheckUtils]: 199: Hoare triple {62027#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62027#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:03,017 INFO L273 TraceCheckUtils]: 200: Hoare triple {62027#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62027#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:03,018 INFO L273 TraceCheckUtils]: 201: Hoare triple {62027#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {62028#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:03,019 INFO L273 TraceCheckUtils]: 202: Hoare triple {62028#(<= main_~i~0 49)} assume true; {62028#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:03,019 INFO L273 TraceCheckUtils]: 203: Hoare triple {62028#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62028#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:03,020 INFO L273 TraceCheckUtils]: 204: Hoare triple {62028#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62028#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:03,020 INFO L273 TraceCheckUtils]: 205: Hoare triple {62028#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {62029#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:03,021 INFO L273 TraceCheckUtils]: 206: Hoare triple {62029#(<= main_~i~0 50)} assume true; {62029#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:03,021 INFO L273 TraceCheckUtils]: 207: Hoare triple {62029#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62029#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:03,022 INFO L273 TraceCheckUtils]: 208: Hoare triple {62029#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62029#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:03,023 INFO L273 TraceCheckUtils]: 209: Hoare triple {62029#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {62030#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:03,023 INFO L273 TraceCheckUtils]: 210: Hoare triple {62030#(<= main_~i~0 51)} assume true; {62030#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:03,024 INFO L273 TraceCheckUtils]: 211: Hoare triple {62030#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62030#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:03,024 INFO L273 TraceCheckUtils]: 212: Hoare triple {62030#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62030#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:03,025 INFO L273 TraceCheckUtils]: 213: Hoare triple {62030#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {62031#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:03,025 INFO L273 TraceCheckUtils]: 214: Hoare triple {62031#(<= main_~i~0 52)} assume true; {62031#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:03,026 INFO L273 TraceCheckUtils]: 215: Hoare triple {62031#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62031#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:03,026 INFO L273 TraceCheckUtils]: 216: Hoare triple {62031#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62031#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:03,027 INFO L273 TraceCheckUtils]: 217: Hoare triple {62031#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {62032#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:03,028 INFO L273 TraceCheckUtils]: 218: Hoare triple {62032#(<= main_~i~0 53)} assume true; {62032#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:03,028 INFO L273 TraceCheckUtils]: 219: Hoare triple {62032#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62032#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:03,029 INFO L273 TraceCheckUtils]: 220: Hoare triple {62032#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62032#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:03,029 INFO L273 TraceCheckUtils]: 221: Hoare triple {62032#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {62033#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:03,030 INFO L273 TraceCheckUtils]: 222: Hoare triple {62033#(<= main_~i~0 54)} assume true; {62033#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:03,030 INFO L273 TraceCheckUtils]: 223: Hoare triple {62033#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62033#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:03,031 INFO L273 TraceCheckUtils]: 224: Hoare triple {62033#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62033#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:03,031 INFO L273 TraceCheckUtils]: 225: Hoare triple {62033#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {62034#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:03,032 INFO L273 TraceCheckUtils]: 226: Hoare triple {62034#(<= main_~i~0 55)} assume true; {62034#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:03,032 INFO L273 TraceCheckUtils]: 227: Hoare triple {62034#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62034#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:03,033 INFO L273 TraceCheckUtils]: 228: Hoare triple {62034#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62034#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:03,034 INFO L273 TraceCheckUtils]: 229: Hoare triple {62034#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {62035#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:03,034 INFO L273 TraceCheckUtils]: 230: Hoare triple {62035#(<= main_~i~0 56)} assume true; {62035#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:03,035 INFO L273 TraceCheckUtils]: 231: Hoare triple {62035#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62035#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:03,035 INFO L273 TraceCheckUtils]: 232: Hoare triple {62035#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62035#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:03,036 INFO L273 TraceCheckUtils]: 233: Hoare triple {62035#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {62036#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:03,036 INFO L273 TraceCheckUtils]: 234: Hoare triple {62036#(<= main_~i~0 57)} assume true; {62036#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:03,037 INFO L273 TraceCheckUtils]: 235: Hoare triple {62036#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62036#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:03,037 INFO L273 TraceCheckUtils]: 236: Hoare triple {62036#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62036#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:03,038 INFO L273 TraceCheckUtils]: 237: Hoare triple {62036#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {62037#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:03,039 INFO L273 TraceCheckUtils]: 238: Hoare triple {62037#(<= main_~i~0 58)} assume true; {62037#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:03,039 INFO L273 TraceCheckUtils]: 239: Hoare triple {62037#(<= main_~i~0 58)} assume !(~i~0 < 100000); {61978#false} is VALID [2018-11-18 22:59:03,039 INFO L273 TraceCheckUtils]: 240: Hoare triple {61978#false} havoc ~x~0;~x~0 := 0; {61978#false} is VALID [2018-11-18 22:59:03,040 INFO L273 TraceCheckUtils]: 241: Hoare triple {61978#false} assume true; {61978#false} is VALID [2018-11-18 22:59:03,040 INFO L273 TraceCheckUtils]: 242: Hoare triple {61978#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {61978#false} is VALID [2018-11-18 22:59:03,040 INFO L256 TraceCheckUtils]: 243: Hoare triple {61978#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {61978#false} is VALID [2018-11-18 22:59:03,040 INFO L273 TraceCheckUtils]: 244: Hoare triple {61978#false} ~cond := #in~cond; {61978#false} is VALID [2018-11-18 22:59:03,040 INFO L273 TraceCheckUtils]: 245: Hoare triple {61978#false} assume 0 == ~cond; {61978#false} is VALID [2018-11-18 22:59:03,041 INFO L273 TraceCheckUtils]: 246: Hoare triple {61978#false} assume !false; {61978#false} is VALID [2018-11-18 22:59:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:03,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:59:03,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:59:03,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:59:03,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:59:03,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:59:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:03,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:59:03,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {61977#true} call ULTIMATE.init(); {61977#true} is VALID [2018-11-18 22:59:03,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {61977#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {61977#true} is VALID [2018-11-18 22:59:03,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {61977#true} assume true; {61977#true} is VALID [2018-11-18 22:59:03,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {61977#true} {61977#true} #57#return; {61977#true} is VALID [2018-11-18 22:59:03,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {61977#true} call #t~ret4 := main(); {61977#true} is VALID [2018-11-18 22:59:03,784 INFO L273 TraceCheckUtils]: 5: Hoare triple {61977#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {62056#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:03,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {62056#(<= main_~i~0 0)} assume true; {62056#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:03,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {62056#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62056#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:03,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {62056#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62056#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:03,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {62056#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {61980#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:03,786 INFO L273 TraceCheckUtils]: 10: Hoare triple {61980#(<= main_~i~0 1)} assume true; {61980#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:03,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {61980#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61980#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:03,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {61980#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61980#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:03,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {61980#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {61981#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:03,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {61981#(<= main_~i~0 2)} assume true; {61981#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:03,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {61981#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61981#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:03,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {61981#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61981#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:03,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {61981#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {61982#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:03,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {61982#(<= main_~i~0 3)} assume true; {61982#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:03,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {61982#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61982#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:03,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {61982#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61982#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:03,792 INFO L273 TraceCheckUtils]: 21: Hoare triple {61982#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {61983#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:03,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {61983#(<= main_~i~0 4)} assume true; {61983#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:03,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {61983#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61983#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:03,793 INFO L273 TraceCheckUtils]: 24: Hoare triple {61983#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61983#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:03,794 INFO L273 TraceCheckUtils]: 25: Hoare triple {61983#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {61984#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:03,794 INFO L273 TraceCheckUtils]: 26: Hoare triple {61984#(<= main_~i~0 5)} assume true; {61984#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:03,795 INFO L273 TraceCheckUtils]: 27: Hoare triple {61984#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61984#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:03,795 INFO L273 TraceCheckUtils]: 28: Hoare triple {61984#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61984#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:03,796 INFO L273 TraceCheckUtils]: 29: Hoare triple {61984#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {61985#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:03,796 INFO L273 TraceCheckUtils]: 30: Hoare triple {61985#(<= main_~i~0 6)} assume true; {61985#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:03,797 INFO L273 TraceCheckUtils]: 31: Hoare triple {61985#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61985#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:03,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {61985#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61985#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:03,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {61985#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {61986#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:03,799 INFO L273 TraceCheckUtils]: 34: Hoare triple {61986#(<= main_~i~0 7)} assume true; {61986#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:03,799 INFO L273 TraceCheckUtils]: 35: Hoare triple {61986#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61986#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:03,800 INFO L273 TraceCheckUtils]: 36: Hoare triple {61986#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61986#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:03,800 INFO L273 TraceCheckUtils]: 37: Hoare triple {61986#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {61987#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:03,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {61987#(<= main_~i~0 8)} assume true; {61987#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:03,801 INFO L273 TraceCheckUtils]: 39: Hoare triple {61987#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61987#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:03,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {61987#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61987#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:03,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {61987#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {61988#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:03,803 INFO L273 TraceCheckUtils]: 42: Hoare triple {61988#(<= main_~i~0 9)} assume true; {61988#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:03,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {61988#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61988#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:03,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {61988#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61988#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:03,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {61988#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {61989#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:03,805 INFO L273 TraceCheckUtils]: 46: Hoare triple {61989#(<= main_~i~0 10)} assume true; {61989#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:03,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {61989#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61989#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:03,806 INFO L273 TraceCheckUtils]: 48: Hoare triple {61989#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61989#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:03,807 INFO L273 TraceCheckUtils]: 49: Hoare triple {61989#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {61990#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:03,808 INFO L273 TraceCheckUtils]: 50: Hoare triple {61990#(<= main_~i~0 11)} assume true; {61990#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:03,808 INFO L273 TraceCheckUtils]: 51: Hoare triple {61990#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61990#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:03,809 INFO L273 TraceCheckUtils]: 52: Hoare triple {61990#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61990#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:03,809 INFO L273 TraceCheckUtils]: 53: Hoare triple {61990#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {61991#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:03,810 INFO L273 TraceCheckUtils]: 54: Hoare triple {61991#(<= main_~i~0 12)} assume true; {61991#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:03,810 INFO L273 TraceCheckUtils]: 55: Hoare triple {61991#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61991#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:03,811 INFO L273 TraceCheckUtils]: 56: Hoare triple {61991#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61991#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:03,811 INFO L273 TraceCheckUtils]: 57: Hoare triple {61991#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {61992#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:03,812 INFO L273 TraceCheckUtils]: 58: Hoare triple {61992#(<= main_~i~0 13)} assume true; {61992#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:03,812 INFO L273 TraceCheckUtils]: 59: Hoare triple {61992#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61992#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:03,813 INFO L273 TraceCheckUtils]: 60: Hoare triple {61992#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61992#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:03,814 INFO L273 TraceCheckUtils]: 61: Hoare triple {61992#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {61993#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:03,814 INFO L273 TraceCheckUtils]: 62: Hoare triple {61993#(<= main_~i~0 14)} assume true; {61993#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:03,815 INFO L273 TraceCheckUtils]: 63: Hoare triple {61993#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61993#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:03,815 INFO L273 TraceCheckUtils]: 64: Hoare triple {61993#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61993#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:03,816 INFO L273 TraceCheckUtils]: 65: Hoare triple {61993#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {61994#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:03,816 INFO L273 TraceCheckUtils]: 66: Hoare triple {61994#(<= main_~i~0 15)} assume true; {61994#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:03,817 INFO L273 TraceCheckUtils]: 67: Hoare triple {61994#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61994#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:03,817 INFO L273 TraceCheckUtils]: 68: Hoare triple {61994#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61994#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:03,818 INFO L273 TraceCheckUtils]: 69: Hoare triple {61994#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {61995#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:03,819 INFO L273 TraceCheckUtils]: 70: Hoare triple {61995#(<= main_~i~0 16)} assume true; {61995#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:03,819 INFO L273 TraceCheckUtils]: 71: Hoare triple {61995#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61995#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:03,820 INFO L273 TraceCheckUtils]: 72: Hoare triple {61995#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61995#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:03,820 INFO L273 TraceCheckUtils]: 73: Hoare triple {61995#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {61996#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:03,821 INFO L273 TraceCheckUtils]: 74: Hoare triple {61996#(<= main_~i~0 17)} assume true; {61996#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:03,821 INFO L273 TraceCheckUtils]: 75: Hoare triple {61996#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61996#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:03,822 INFO L273 TraceCheckUtils]: 76: Hoare triple {61996#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61996#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:03,823 INFO L273 TraceCheckUtils]: 77: Hoare triple {61996#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {61997#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:03,823 INFO L273 TraceCheckUtils]: 78: Hoare triple {61997#(<= main_~i~0 18)} assume true; {61997#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:03,823 INFO L273 TraceCheckUtils]: 79: Hoare triple {61997#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61997#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:03,824 INFO L273 TraceCheckUtils]: 80: Hoare triple {61997#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61997#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:03,825 INFO L273 TraceCheckUtils]: 81: Hoare triple {61997#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {61998#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:03,825 INFO L273 TraceCheckUtils]: 82: Hoare triple {61998#(<= main_~i~0 19)} assume true; {61998#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:03,826 INFO L273 TraceCheckUtils]: 83: Hoare triple {61998#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61998#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:03,826 INFO L273 TraceCheckUtils]: 84: Hoare triple {61998#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61998#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:03,827 INFO L273 TraceCheckUtils]: 85: Hoare triple {61998#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {61999#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:03,827 INFO L273 TraceCheckUtils]: 86: Hoare triple {61999#(<= main_~i~0 20)} assume true; {61999#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:03,828 INFO L273 TraceCheckUtils]: 87: Hoare triple {61999#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61999#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:03,828 INFO L273 TraceCheckUtils]: 88: Hoare triple {61999#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {61999#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:03,829 INFO L273 TraceCheckUtils]: 89: Hoare triple {61999#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {62000#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:03,830 INFO L273 TraceCheckUtils]: 90: Hoare triple {62000#(<= main_~i~0 21)} assume true; {62000#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:03,830 INFO L273 TraceCheckUtils]: 91: Hoare triple {62000#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62000#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:03,831 INFO L273 TraceCheckUtils]: 92: Hoare triple {62000#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62000#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:03,831 INFO L273 TraceCheckUtils]: 93: Hoare triple {62000#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {62001#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:03,832 INFO L273 TraceCheckUtils]: 94: Hoare triple {62001#(<= main_~i~0 22)} assume true; {62001#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:03,832 INFO L273 TraceCheckUtils]: 95: Hoare triple {62001#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62001#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:03,833 INFO L273 TraceCheckUtils]: 96: Hoare triple {62001#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62001#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:03,834 INFO L273 TraceCheckUtils]: 97: Hoare triple {62001#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {62002#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:03,834 INFO L273 TraceCheckUtils]: 98: Hoare triple {62002#(<= main_~i~0 23)} assume true; {62002#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:03,835 INFO L273 TraceCheckUtils]: 99: Hoare triple {62002#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62002#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:03,835 INFO L273 TraceCheckUtils]: 100: Hoare triple {62002#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62002#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:03,836 INFO L273 TraceCheckUtils]: 101: Hoare triple {62002#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {62003#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:03,836 INFO L273 TraceCheckUtils]: 102: Hoare triple {62003#(<= main_~i~0 24)} assume true; {62003#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:03,837 INFO L273 TraceCheckUtils]: 103: Hoare triple {62003#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62003#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:03,837 INFO L273 TraceCheckUtils]: 104: Hoare triple {62003#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62003#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:03,838 INFO L273 TraceCheckUtils]: 105: Hoare triple {62003#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {62004#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:03,839 INFO L273 TraceCheckUtils]: 106: Hoare triple {62004#(<= main_~i~0 25)} assume true; {62004#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:03,840 INFO L273 TraceCheckUtils]: 107: Hoare triple {62004#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62004#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:03,840 INFO L273 TraceCheckUtils]: 108: Hoare triple {62004#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62004#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:03,841 INFO L273 TraceCheckUtils]: 109: Hoare triple {62004#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {62005#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:03,842 INFO L273 TraceCheckUtils]: 110: Hoare triple {62005#(<= main_~i~0 26)} assume true; {62005#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:03,842 INFO L273 TraceCheckUtils]: 111: Hoare triple {62005#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62005#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:03,844 INFO L273 TraceCheckUtils]: 112: Hoare triple {62005#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62005#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:03,844 INFO L273 TraceCheckUtils]: 113: Hoare triple {62005#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {62006#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:03,846 INFO L273 TraceCheckUtils]: 114: Hoare triple {62006#(<= main_~i~0 27)} assume true; {62006#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:03,846 INFO L273 TraceCheckUtils]: 115: Hoare triple {62006#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62006#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:03,848 INFO L273 TraceCheckUtils]: 116: Hoare triple {62006#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62006#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:03,848 INFO L273 TraceCheckUtils]: 117: Hoare triple {62006#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {62007#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:03,850 INFO L273 TraceCheckUtils]: 118: Hoare triple {62007#(<= main_~i~0 28)} assume true; {62007#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:03,850 INFO L273 TraceCheckUtils]: 119: Hoare triple {62007#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62007#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:03,850 INFO L273 TraceCheckUtils]: 120: Hoare triple {62007#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62007#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:03,851 INFO L273 TraceCheckUtils]: 121: Hoare triple {62007#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {62008#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:03,851 INFO L273 TraceCheckUtils]: 122: Hoare triple {62008#(<= main_~i~0 29)} assume true; {62008#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:03,851 INFO L273 TraceCheckUtils]: 123: Hoare triple {62008#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62008#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:03,852 INFO L273 TraceCheckUtils]: 124: Hoare triple {62008#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62008#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:03,852 INFO L273 TraceCheckUtils]: 125: Hoare triple {62008#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {62009#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:03,853 INFO L273 TraceCheckUtils]: 126: Hoare triple {62009#(<= main_~i~0 30)} assume true; {62009#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:03,853 INFO L273 TraceCheckUtils]: 127: Hoare triple {62009#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62009#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:03,854 INFO L273 TraceCheckUtils]: 128: Hoare triple {62009#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62009#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:03,854 INFO L273 TraceCheckUtils]: 129: Hoare triple {62009#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {62010#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:03,855 INFO L273 TraceCheckUtils]: 130: Hoare triple {62010#(<= main_~i~0 31)} assume true; {62010#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:03,855 INFO L273 TraceCheckUtils]: 131: Hoare triple {62010#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62010#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:03,856 INFO L273 TraceCheckUtils]: 132: Hoare triple {62010#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62010#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:03,857 INFO L273 TraceCheckUtils]: 133: Hoare triple {62010#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {62011#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:03,857 INFO L273 TraceCheckUtils]: 134: Hoare triple {62011#(<= main_~i~0 32)} assume true; {62011#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:03,858 INFO L273 TraceCheckUtils]: 135: Hoare triple {62011#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62011#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:03,858 INFO L273 TraceCheckUtils]: 136: Hoare triple {62011#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62011#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:03,859 INFO L273 TraceCheckUtils]: 137: Hoare triple {62011#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {62012#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:03,859 INFO L273 TraceCheckUtils]: 138: Hoare triple {62012#(<= main_~i~0 33)} assume true; {62012#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:03,860 INFO L273 TraceCheckUtils]: 139: Hoare triple {62012#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62012#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:03,860 INFO L273 TraceCheckUtils]: 140: Hoare triple {62012#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62012#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:03,861 INFO L273 TraceCheckUtils]: 141: Hoare triple {62012#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {62013#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:03,862 INFO L273 TraceCheckUtils]: 142: Hoare triple {62013#(<= main_~i~0 34)} assume true; {62013#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:03,862 INFO L273 TraceCheckUtils]: 143: Hoare triple {62013#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62013#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:03,863 INFO L273 TraceCheckUtils]: 144: Hoare triple {62013#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62013#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:03,863 INFO L273 TraceCheckUtils]: 145: Hoare triple {62013#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {62014#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:03,864 INFO L273 TraceCheckUtils]: 146: Hoare triple {62014#(<= main_~i~0 35)} assume true; {62014#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:03,864 INFO L273 TraceCheckUtils]: 147: Hoare triple {62014#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62014#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:03,865 INFO L273 TraceCheckUtils]: 148: Hoare triple {62014#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62014#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:03,866 INFO L273 TraceCheckUtils]: 149: Hoare triple {62014#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {62015#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:03,866 INFO L273 TraceCheckUtils]: 150: Hoare triple {62015#(<= main_~i~0 36)} assume true; {62015#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:03,867 INFO L273 TraceCheckUtils]: 151: Hoare triple {62015#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62015#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:03,867 INFO L273 TraceCheckUtils]: 152: Hoare triple {62015#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62015#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:03,868 INFO L273 TraceCheckUtils]: 153: Hoare triple {62015#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {62016#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:03,868 INFO L273 TraceCheckUtils]: 154: Hoare triple {62016#(<= main_~i~0 37)} assume true; {62016#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:03,869 INFO L273 TraceCheckUtils]: 155: Hoare triple {62016#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62016#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:03,869 INFO L273 TraceCheckUtils]: 156: Hoare triple {62016#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62016#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:03,870 INFO L273 TraceCheckUtils]: 157: Hoare triple {62016#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {62017#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:03,870 INFO L273 TraceCheckUtils]: 158: Hoare triple {62017#(<= main_~i~0 38)} assume true; {62017#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:03,871 INFO L273 TraceCheckUtils]: 159: Hoare triple {62017#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62017#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:03,871 INFO L273 TraceCheckUtils]: 160: Hoare triple {62017#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62017#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:03,872 INFO L273 TraceCheckUtils]: 161: Hoare triple {62017#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {62018#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:03,873 INFO L273 TraceCheckUtils]: 162: Hoare triple {62018#(<= main_~i~0 39)} assume true; {62018#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:03,873 INFO L273 TraceCheckUtils]: 163: Hoare triple {62018#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62018#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:03,874 INFO L273 TraceCheckUtils]: 164: Hoare triple {62018#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62018#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:03,874 INFO L273 TraceCheckUtils]: 165: Hoare triple {62018#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {62019#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:03,875 INFO L273 TraceCheckUtils]: 166: Hoare triple {62019#(<= main_~i~0 40)} assume true; {62019#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:03,875 INFO L273 TraceCheckUtils]: 167: Hoare triple {62019#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62019#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:03,876 INFO L273 TraceCheckUtils]: 168: Hoare triple {62019#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62019#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:03,877 INFO L273 TraceCheckUtils]: 169: Hoare triple {62019#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {62020#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:03,877 INFO L273 TraceCheckUtils]: 170: Hoare triple {62020#(<= main_~i~0 41)} assume true; {62020#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:03,878 INFO L273 TraceCheckUtils]: 171: Hoare triple {62020#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62020#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:03,878 INFO L273 TraceCheckUtils]: 172: Hoare triple {62020#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62020#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:03,879 INFO L273 TraceCheckUtils]: 173: Hoare triple {62020#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {62021#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:03,879 INFO L273 TraceCheckUtils]: 174: Hoare triple {62021#(<= main_~i~0 42)} assume true; {62021#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:03,880 INFO L273 TraceCheckUtils]: 175: Hoare triple {62021#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62021#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:03,880 INFO L273 TraceCheckUtils]: 176: Hoare triple {62021#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62021#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:03,881 INFO L273 TraceCheckUtils]: 177: Hoare triple {62021#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {62022#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:03,882 INFO L273 TraceCheckUtils]: 178: Hoare triple {62022#(<= main_~i~0 43)} assume true; {62022#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:03,882 INFO L273 TraceCheckUtils]: 179: Hoare triple {62022#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62022#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:03,882 INFO L273 TraceCheckUtils]: 180: Hoare triple {62022#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62022#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:03,883 INFO L273 TraceCheckUtils]: 181: Hoare triple {62022#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {62023#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:03,884 INFO L273 TraceCheckUtils]: 182: Hoare triple {62023#(<= main_~i~0 44)} assume true; {62023#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:03,884 INFO L273 TraceCheckUtils]: 183: Hoare triple {62023#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62023#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:03,885 INFO L273 TraceCheckUtils]: 184: Hoare triple {62023#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62023#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:03,885 INFO L273 TraceCheckUtils]: 185: Hoare triple {62023#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {62024#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:03,886 INFO L273 TraceCheckUtils]: 186: Hoare triple {62024#(<= main_~i~0 45)} assume true; {62024#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:03,886 INFO L273 TraceCheckUtils]: 187: Hoare triple {62024#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62024#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:03,887 INFO L273 TraceCheckUtils]: 188: Hoare triple {62024#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62024#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:03,888 INFO L273 TraceCheckUtils]: 189: Hoare triple {62024#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {62025#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:03,888 INFO L273 TraceCheckUtils]: 190: Hoare triple {62025#(<= main_~i~0 46)} assume true; {62025#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:03,889 INFO L273 TraceCheckUtils]: 191: Hoare triple {62025#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62025#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:03,889 INFO L273 TraceCheckUtils]: 192: Hoare triple {62025#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62025#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:03,890 INFO L273 TraceCheckUtils]: 193: Hoare triple {62025#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {62026#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:03,890 INFO L273 TraceCheckUtils]: 194: Hoare triple {62026#(<= main_~i~0 47)} assume true; {62026#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:03,891 INFO L273 TraceCheckUtils]: 195: Hoare triple {62026#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62026#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:03,891 INFO L273 TraceCheckUtils]: 196: Hoare triple {62026#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62026#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:03,892 INFO L273 TraceCheckUtils]: 197: Hoare triple {62026#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {62027#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:03,893 INFO L273 TraceCheckUtils]: 198: Hoare triple {62027#(<= main_~i~0 48)} assume true; {62027#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:03,893 INFO L273 TraceCheckUtils]: 199: Hoare triple {62027#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62027#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:03,894 INFO L273 TraceCheckUtils]: 200: Hoare triple {62027#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62027#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:03,894 INFO L273 TraceCheckUtils]: 201: Hoare triple {62027#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {62028#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:03,895 INFO L273 TraceCheckUtils]: 202: Hoare triple {62028#(<= main_~i~0 49)} assume true; {62028#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:03,895 INFO L273 TraceCheckUtils]: 203: Hoare triple {62028#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62028#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:03,896 INFO L273 TraceCheckUtils]: 204: Hoare triple {62028#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62028#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:03,896 INFO L273 TraceCheckUtils]: 205: Hoare triple {62028#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {62029#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:03,897 INFO L273 TraceCheckUtils]: 206: Hoare triple {62029#(<= main_~i~0 50)} assume true; {62029#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:03,897 INFO L273 TraceCheckUtils]: 207: Hoare triple {62029#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62029#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:03,898 INFO L273 TraceCheckUtils]: 208: Hoare triple {62029#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62029#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:03,899 INFO L273 TraceCheckUtils]: 209: Hoare triple {62029#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {62030#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:03,899 INFO L273 TraceCheckUtils]: 210: Hoare triple {62030#(<= main_~i~0 51)} assume true; {62030#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:03,900 INFO L273 TraceCheckUtils]: 211: Hoare triple {62030#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62030#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:03,900 INFO L273 TraceCheckUtils]: 212: Hoare triple {62030#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62030#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:03,901 INFO L273 TraceCheckUtils]: 213: Hoare triple {62030#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {62031#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:03,901 INFO L273 TraceCheckUtils]: 214: Hoare triple {62031#(<= main_~i~0 52)} assume true; {62031#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:03,902 INFO L273 TraceCheckUtils]: 215: Hoare triple {62031#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62031#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:03,902 INFO L273 TraceCheckUtils]: 216: Hoare triple {62031#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62031#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:03,903 INFO L273 TraceCheckUtils]: 217: Hoare triple {62031#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {62032#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:03,904 INFO L273 TraceCheckUtils]: 218: Hoare triple {62032#(<= main_~i~0 53)} assume true; {62032#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:03,904 INFO L273 TraceCheckUtils]: 219: Hoare triple {62032#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62032#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:03,905 INFO L273 TraceCheckUtils]: 220: Hoare triple {62032#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62032#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:03,905 INFO L273 TraceCheckUtils]: 221: Hoare triple {62032#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {62033#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:03,906 INFO L273 TraceCheckUtils]: 222: Hoare triple {62033#(<= main_~i~0 54)} assume true; {62033#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:03,906 INFO L273 TraceCheckUtils]: 223: Hoare triple {62033#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62033#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:03,907 INFO L273 TraceCheckUtils]: 224: Hoare triple {62033#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62033#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:03,908 INFO L273 TraceCheckUtils]: 225: Hoare triple {62033#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {62034#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:03,908 INFO L273 TraceCheckUtils]: 226: Hoare triple {62034#(<= main_~i~0 55)} assume true; {62034#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:03,909 INFO L273 TraceCheckUtils]: 227: Hoare triple {62034#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62034#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:03,909 INFO L273 TraceCheckUtils]: 228: Hoare triple {62034#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62034#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:03,910 INFO L273 TraceCheckUtils]: 229: Hoare triple {62034#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {62035#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:03,910 INFO L273 TraceCheckUtils]: 230: Hoare triple {62035#(<= main_~i~0 56)} assume true; {62035#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:03,911 INFO L273 TraceCheckUtils]: 231: Hoare triple {62035#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62035#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:03,911 INFO L273 TraceCheckUtils]: 232: Hoare triple {62035#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62035#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:03,912 INFO L273 TraceCheckUtils]: 233: Hoare triple {62035#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {62036#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:03,912 INFO L273 TraceCheckUtils]: 234: Hoare triple {62036#(<= main_~i~0 57)} assume true; {62036#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:03,913 INFO L273 TraceCheckUtils]: 235: Hoare triple {62036#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62036#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:03,913 INFO L273 TraceCheckUtils]: 236: Hoare triple {62036#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {62036#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:03,914 INFO L273 TraceCheckUtils]: 237: Hoare triple {62036#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {62037#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:03,915 INFO L273 TraceCheckUtils]: 238: Hoare triple {62037#(<= main_~i~0 58)} assume true; {62037#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:03,915 INFO L273 TraceCheckUtils]: 239: Hoare triple {62037#(<= main_~i~0 58)} assume !(~i~0 < 100000); {61978#false} is VALID [2018-11-18 22:59:03,916 INFO L273 TraceCheckUtils]: 240: Hoare triple {61978#false} havoc ~x~0;~x~0 := 0; {61978#false} is VALID [2018-11-18 22:59:03,916 INFO L273 TraceCheckUtils]: 241: Hoare triple {61978#false} assume true; {61978#false} is VALID [2018-11-18 22:59:03,916 INFO L273 TraceCheckUtils]: 242: Hoare triple {61978#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {61978#false} is VALID [2018-11-18 22:59:03,916 INFO L256 TraceCheckUtils]: 243: Hoare triple {61978#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {61978#false} is VALID [2018-11-18 22:59:03,916 INFO L273 TraceCheckUtils]: 244: Hoare triple {61978#false} ~cond := #in~cond; {61978#false} is VALID [2018-11-18 22:59:03,916 INFO L273 TraceCheckUtils]: 245: Hoare triple {61978#false} assume 0 == ~cond; {61978#false} is VALID [2018-11-18 22:59:03,917 INFO L273 TraceCheckUtils]: 246: Hoare triple {61978#false} assume !false; {61978#false} is VALID [2018-11-18 22:59:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:03,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:59:03,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2018-11-18 22:59:03,977 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 247 [2018-11-18 22:59:03,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:59:03,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2018-11-18 22:59:04,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:04,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-18 22:59:04,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-18 22:59:04,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-18 22:59:04,216 INFO L87 Difference]: Start difference. First operand 252 states and 311 transitions. Second operand 62 states. [2018-11-18 22:59:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:05,623 INFO L93 Difference]: Finished difference Result 270 states and 332 transitions. [2018-11-18 22:59:05,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-18 22:59:05,623 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 247 [2018-11-18 22:59:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:59:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 22:59:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 332 transitions. [2018-11-18 22:59:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 22:59:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 332 transitions. [2018-11-18 22:59:05,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 332 transitions. [2018-11-18 22:59:05,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:05,930 INFO L225 Difference]: With dead ends: 270 [2018-11-18 22:59:05,930 INFO L226 Difference]: Without dead ends: 258 [2018-11-18 22:59:05,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-18 22:59:05,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-18 22:59:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-18 22:59:05,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:59:05,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2018-11-18 22:59:05,983 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2018-11-18 22:59:05,983 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2018-11-18 22:59:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:05,989 INFO L93 Difference]: Finished difference Result 258 states and 319 transitions. [2018-11-18 22:59:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 319 transitions. [2018-11-18 22:59:05,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:05,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:05,989 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2018-11-18 22:59:05,989 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2018-11-18 22:59:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:05,993 INFO L93 Difference]: Finished difference Result 258 states and 319 transitions. [2018-11-18 22:59:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 319 transitions. [2018-11-18 22:59:05,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:05,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:05,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:59:05,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:59:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-18 22:59:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 316 transitions. [2018-11-18 22:59:05,998 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 316 transitions. Word has length 247 [2018-11-18 22:59:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:59:05,998 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 316 transitions. [2018-11-18 22:59:05,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-18 22:59:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 316 transitions. [2018-11-18 22:59:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-18 22:59:05,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:59:05,999 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:59:05,999 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:59:05,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:59:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash 582718292, now seen corresponding path program 59 times [2018-11-18 22:59:06,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:59:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:59:06,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:06,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:59:06,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:07,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {63958#true} call ULTIMATE.init(); {63958#true} is VALID [2018-11-18 22:59:07,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {63958#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {63958#true} is VALID [2018-11-18 22:59:07,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {63958#true} assume true; {63958#true} is VALID [2018-11-18 22:59:07,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {63958#true} {63958#true} #57#return; {63958#true} is VALID [2018-11-18 22:59:07,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {63958#true} call #t~ret4 := main(); {63958#true} is VALID [2018-11-18 22:59:07,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {63958#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {63960#(= main_~i~0 0)} is VALID [2018-11-18 22:59:07,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {63960#(= main_~i~0 0)} assume true; {63960#(= main_~i~0 0)} is VALID [2018-11-18 22:59:07,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {63960#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63960#(= main_~i~0 0)} is VALID [2018-11-18 22:59:07,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {63960#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63960#(= main_~i~0 0)} is VALID [2018-11-18 22:59:07,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {63960#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {63961#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:07,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {63961#(<= main_~i~0 1)} assume true; {63961#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:07,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {63961#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63961#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:07,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {63961#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63961#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:07,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {63961#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {63962#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:07,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {63962#(<= main_~i~0 2)} assume true; {63962#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:07,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {63962#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63962#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:07,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {63962#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63962#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:07,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {63962#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {63963#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:07,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {63963#(<= main_~i~0 3)} assume true; {63963#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:07,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {63963#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63963#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:07,614 INFO L273 TraceCheckUtils]: 20: Hoare triple {63963#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63963#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:07,614 INFO L273 TraceCheckUtils]: 21: Hoare triple {63963#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {63964#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:07,615 INFO L273 TraceCheckUtils]: 22: Hoare triple {63964#(<= main_~i~0 4)} assume true; {63964#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:07,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {63964#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63964#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:07,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {63964#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63964#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:07,617 INFO L273 TraceCheckUtils]: 25: Hoare triple {63964#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {63965#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:07,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {63965#(<= main_~i~0 5)} assume true; {63965#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:07,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {63965#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63965#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:07,618 INFO L273 TraceCheckUtils]: 28: Hoare triple {63965#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63965#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:07,619 INFO L273 TraceCheckUtils]: 29: Hoare triple {63965#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {63966#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:07,619 INFO L273 TraceCheckUtils]: 30: Hoare triple {63966#(<= main_~i~0 6)} assume true; {63966#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:07,619 INFO L273 TraceCheckUtils]: 31: Hoare triple {63966#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63966#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:07,620 INFO L273 TraceCheckUtils]: 32: Hoare triple {63966#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63966#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:07,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {63966#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {63967#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:07,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {63967#(<= main_~i~0 7)} assume true; {63967#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:07,622 INFO L273 TraceCheckUtils]: 35: Hoare triple {63967#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63967#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:07,622 INFO L273 TraceCheckUtils]: 36: Hoare triple {63967#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63967#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:07,623 INFO L273 TraceCheckUtils]: 37: Hoare triple {63967#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {63968#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:07,623 INFO L273 TraceCheckUtils]: 38: Hoare triple {63968#(<= main_~i~0 8)} assume true; {63968#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:07,624 INFO L273 TraceCheckUtils]: 39: Hoare triple {63968#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63968#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:07,624 INFO L273 TraceCheckUtils]: 40: Hoare triple {63968#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63968#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:07,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {63968#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {63969#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:07,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {63969#(<= main_~i~0 9)} assume true; {63969#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:07,626 INFO L273 TraceCheckUtils]: 43: Hoare triple {63969#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63969#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:07,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {63969#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63969#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:07,627 INFO L273 TraceCheckUtils]: 45: Hoare triple {63969#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {63970#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:07,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {63970#(<= main_~i~0 10)} assume true; {63970#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:07,628 INFO L273 TraceCheckUtils]: 47: Hoare triple {63970#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63970#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:07,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {63970#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63970#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:07,629 INFO L273 TraceCheckUtils]: 49: Hoare triple {63970#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {63971#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:07,629 INFO L273 TraceCheckUtils]: 50: Hoare triple {63971#(<= main_~i~0 11)} assume true; {63971#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:07,630 INFO L273 TraceCheckUtils]: 51: Hoare triple {63971#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63971#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:07,630 INFO L273 TraceCheckUtils]: 52: Hoare triple {63971#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63971#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:07,631 INFO L273 TraceCheckUtils]: 53: Hoare triple {63971#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {63972#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:07,631 INFO L273 TraceCheckUtils]: 54: Hoare triple {63972#(<= main_~i~0 12)} assume true; {63972#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:07,632 INFO L273 TraceCheckUtils]: 55: Hoare triple {63972#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63972#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:07,632 INFO L273 TraceCheckUtils]: 56: Hoare triple {63972#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63972#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:07,633 INFO L273 TraceCheckUtils]: 57: Hoare triple {63972#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {63973#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:07,633 INFO L273 TraceCheckUtils]: 58: Hoare triple {63973#(<= main_~i~0 13)} assume true; {63973#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:07,634 INFO L273 TraceCheckUtils]: 59: Hoare triple {63973#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63973#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:07,634 INFO L273 TraceCheckUtils]: 60: Hoare triple {63973#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63973#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:07,635 INFO L273 TraceCheckUtils]: 61: Hoare triple {63973#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {63974#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:07,636 INFO L273 TraceCheckUtils]: 62: Hoare triple {63974#(<= main_~i~0 14)} assume true; {63974#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:07,636 INFO L273 TraceCheckUtils]: 63: Hoare triple {63974#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63974#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:07,637 INFO L273 TraceCheckUtils]: 64: Hoare triple {63974#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63974#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:07,637 INFO L273 TraceCheckUtils]: 65: Hoare triple {63974#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {63975#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:07,638 INFO L273 TraceCheckUtils]: 66: Hoare triple {63975#(<= main_~i~0 15)} assume true; {63975#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:07,638 INFO L273 TraceCheckUtils]: 67: Hoare triple {63975#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63975#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:07,639 INFO L273 TraceCheckUtils]: 68: Hoare triple {63975#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63975#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:07,639 INFO L273 TraceCheckUtils]: 69: Hoare triple {63975#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {63976#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:07,640 INFO L273 TraceCheckUtils]: 70: Hoare triple {63976#(<= main_~i~0 16)} assume true; {63976#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:07,640 INFO L273 TraceCheckUtils]: 71: Hoare triple {63976#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63976#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:07,641 INFO L273 TraceCheckUtils]: 72: Hoare triple {63976#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63976#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:07,641 INFO L273 TraceCheckUtils]: 73: Hoare triple {63976#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {63977#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:07,642 INFO L273 TraceCheckUtils]: 74: Hoare triple {63977#(<= main_~i~0 17)} assume true; {63977#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:07,642 INFO L273 TraceCheckUtils]: 75: Hoare triple {63977#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63977#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:07,643 INFO L273 TraceCheckUtils]: 76: Hoare triple {63977#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63977#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:07,643 INFO L273 TraceCheckUtils]: 77: Hoare triple {63977#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {63978#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:07,644 INFO L273 TraceCheckUtils]: 78: Hoare triple {63978#(<= main_~i~0 18)} assume true; {63978#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:07,644 INFO L273 TraceCheckUtils]: 79: Hoare triple {63978#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63978#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:07,645 INFO L273 TraceCheckUtils]: 80: Hoare triple {63978#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63978#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:07,646 INFO L273 TraceCheckUtils]: 81: Hoare triple {63978#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {63979#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:07,646 INFO L273 TraceCheckUtils]: 82: Hoare triple {63979#(<= main_~i~0 19)} assume true; {63979#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:07,646 INFO L273 TraceCheckUtils]: 83: Hoare triple {63979#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63979#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:07,647 INFO L273 TraceCheckUtils]: 84: Hoare triple {63979#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63979#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:07,648 INFO L273 TraceCheckUtils]: 85: Hoare triple {63979#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {63980#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:07,648 INFO L273 TraceCheckUtils]: 86: Hoare triple {63980#(<= main_~i~0 20)} assume true; {63980#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:07,648 INFO L273 TraceCheckUtils]: 87: Hoare triple {63980#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63980#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:07,649 INFO L273 TraceCheckUtils]: 88: Hoare triple {63980#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63980#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:07,650 INFO L273 TraceCheckUtils]: 89: Hoare triple {63980#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {63981#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:07,650 INFO L273 TraceCheckUtils]: 90: Hoare triple {63981#(<= main_~i~0 21)} assume true; {63981#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:07,651 INFO L273 TraceCheckUtils]: 91: Hoare triple {63981#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63981#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:07,651 INFO L273 TraceCheckUtils]: 92: Hoare triple {63981#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63981#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:07,652 INFO L273 TraceCheckUtils]: 93: Hoare triple {63981#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {63982#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:07,652 INFO L273 TraceCheckUtils]: 94: Hoare triple {63982#(<= main_~i~0 22)} assume true; {63982#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:07,653 INFO L273 TraceCheckUtils]: 95: Hoare triple {63982#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63982#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:07,653 INFO L273 TraceCheckUtils]: 96: Hoare triple {63982#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63982#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:07,654 INFO L273 TraceCheckUtils]: 97: Hoare triple {63982#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {63983#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:07,654 INFO L273 TraceCheckUtils]: 98: Hoare triple {63983#(<= main_~i~0 23)} assume true; {63983#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:07,655 INFO L273 TraceCheckUtils]: 99: Hoare triple {63983#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63983#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:07,655 INFO L273 TraceCheckUtils]: 100: Hoare triple {63983#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63983#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:07,656 INFO L273 TraceCheckUtils]: 101: Hoare triple {63983#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {63984#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:07,656 INFO L273 TraceCheckUtils]: 102: Hoare triple {63984#(<= main_~i~0 24)} assume true; {63984#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:07,657 INFO L273 TraceCheckUtils]: 103: Hoare triple {63984#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63984#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:07,657 INFO L273 TraceCheckUtils]: 104: Hoare triple {63984#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63984#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:07,658 INFO L273 TraceCheckUtils]: 105: Hoare triple {63984#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {63985#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:07,658 INFO L273 TraceCheckUtils]: 106: Hoare triple {63985#(<= main_~i~0 25)} assume true; {63985#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:07,659 INFO L273 TraceCheckUtils]: 107: Hoare triple {63985#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63985#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:07,659 INFO L273 TraceCheckUtils]: 108: Hoare triple {63985#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63985#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:07,660 INFO L273 TraceCheckUtils]: 109: Hoare triple {63985#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {63986#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:07,660 INFO L273 TraceCheckUtils]: 110: Hoare triple {63986#(<= main_~i~0 26)} assume true; {63986#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:07,661 INFO L273 TraceCheckUtils]: 111: Hoare triple {63986#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63986#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:07,661 INFO L273 TraceCheckUtils]: 112: Hoare triple {63986#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63986#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:07,662 INFO L273 TraceCheckUtils]: 113: Hoare triple {63986#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {63987#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:07,662 INFO L273 TraceCheckUtils]: 114: Hoare triple {63987#(<= main_~i~0 27)} assume true; {63987#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:07,663 INFO L273 TraceCheckUtils]: 115: Hoare triple {63987#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63987#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:07,663 INFO L273 TraceCheckUtils]: 116: Hoare triple {63987#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63987#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:07,664 INFO L273 TraceCheckUtils]: 117: Hoare triple {63987#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {63988#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:07,664 INFO L273 TraceCheckUtils]: 118: Hoare triple {63988#(<= main_~i~0 28)} assume true; {63988#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:07,665 INFO L273 TraceCheckUtils]: 119: Hoare triple {63988#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63988#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:07,665 INFO L273 TraceCheckUtils]: 120: Hoare triple {63988#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63988#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:07,666 INFO L273 TraceCheckUtils]: 121: Hoare triple {63988#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {63989#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:07,666 INFO L273 TraceCheckUtils]: 122: Hoare triple {63989#(<= main_~i~0 29)} assume true; {63989#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:07,667 INFO L273 TraceCheckUtils]: 123: Hoare triple {63989#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63989#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:07,667 INFO L273 TraceCheckUtils]: 124: Hoare triple {63989#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63989#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:07,668 INFO L273 TraceCheckUtils]: 125: Hoare triple {63989#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {63990#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:07,668 INFO L273 TraceCheckUtils]: 126: Hoare triple {63990#(<= main_~i~0 30)} assume true; {63990#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:07,669 INFO L273 TraceCheckUtils]: 127: Hoare triple {63990#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63990#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:07,669 INFO L273 TraceCheckUtils]: 128: Hoare triple {63990#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63990#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:07,670 INFO L273 TraceCheckUtils]: 129: Hoare triple {63990#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {63991#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:07,671 INFO L273 TraceCheckUtils]: 130: Hoare triple {63991#(<= main_~i~0 31)} assume true; {63991#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:07,671 INFO L273 TraceCheckUtils]: 131: Hoare triple {63991#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63991#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:07,671 INFO L273 TraceCheckUtils]: 132: Hoare triple {63991#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63991#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:07,672 INFO L273 TraceCheckUtils]: 133: Hoare triple {63991#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {63992#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:07,673 INFO L273 TraceCheckUtils]: 134: Hoare triple {63992#(<= main_~i~0 32)} assume true; {63992#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:07,673 INFO L273 TraceCheckUtils]: 135: Hoare triple {63992#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63992#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:07,673 INFO L273 TraceCheckUtils]: 136: Hoare triple {63992#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63992#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:07,674 INFO L273 TraceCheckUtils]: 137: Hoare triple {63992#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {63993#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:07,675 INFO L273 TraceCheckUtils]: 138: Hoare triple {63993#(<= main_~i~0 33)} assume true; {63993#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:07,675 INFO L273 TraceCheckUtils]: 139: Hoare triple {63993#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63993#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:07,676 INFO L273 TraceCheckUtils]: 140: Hoare triple {63993#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63993#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:07,676 INFO L273 TraceCheckUtils]: 141: Hoare triple {63993#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {63994#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:07,677 INFO L273 TraceCheckUtils]: 142: Hoare triple {63994#(<= main_~i~0 34)} assume true; {63994#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:07,677 INFO L273 TraceCheckUtils]: 143: Hoare triple {63994#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63994#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:07,678 INFO L273 TraceCheckUtils]: 144: Hoare triple {63994#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63994#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:07,678 INFO L273 TraceCheckUtils]: 145: Hoare triple {63994#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {63995#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:07,679 INFO L273 TraceCheckUtils]: 146: Hoare triple {63995#(<= main_~i~0 35)} assume true; {63995#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:07,679 INFO L273 TraceCheckUtils]: 147: Hoare triple {63995#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63995#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:07,680 INFO L273 TraceCheckUtils]: 148: Hoare triple {63995#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63995#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:07,680 INFO L273 TraceCheckUtils]: 149: Hoare triple {63995#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {63996#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:07,681 INFO L273 TraceCheckUtils]: 150: Hoare triple {63996#(<= main_~i~0 36)} assume true; {63996#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:07,681 INFO L273 TraceCheckUtils]: 151: Hoare triple {63996#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63996#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:07,682 INFO L273 TraceCheckUtils]: 152: Hoare triple {63996#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63996#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:07,682 INFO L273 TraceCheckUtils]: 153: Hoare triple {63996#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {63997#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:07,683 INFO L273 TraceCheckUtils]: 154: Hoare triple {63997#(<= main_~i~0 37)} assume true; {63997#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:07,683 INFO L273 TraceCheckUtils]: 155: Hoare triple {63997#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63997#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:07,684 INFO L273 TraceCheckUtils]: 156: Hoare triple {63997#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63997#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:07,684 INFO L273 TraceCheckUtils]: 157: Hoare triple {63997#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {63998#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:07,685 INFO L273 TraceCheckUtils]: 158: Hoare triple {63998#(<= main_~i~0 38)} assume true; {63998#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:07,685 INFO L273 TraceCheckUtils]: 159: Hoare triple {63998#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63998#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:07,686 INFO L273 TraceCheckUtils]: 160: Hoare triple {63998#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63998#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:07,686 INFO L273 TraceCheckUtils]: 161: Hoare triple {63998#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {63999#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:07,687 INFO L273 TraceCheckUtils]: 162: Hoare triple {63999#(<= main_~i~0 39)} assume true; {63999#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:07,687 INFO L273 TraceCheckUtils]: 163: Hoare triple {63999#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63999#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:07,688 INFO L273 TraceCheckUtils]: 164: Hoare triple {63999#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63999#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:07,688 INFO L273 TraceCheckUtils]: 165: Hoare triple {63999#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {64000#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:07,689 INFO L273 TraceCheckUtils]: 166: Hoare triple {64000#(<= main_~i~0 40)} assume true; {64000#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:07,689 INFO L273 TraceCheckUtils]: 167: Hoare triple {64000#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64000#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:07,690 INFO L273 TraceCheckUtils]: 168: Hoare triple {64000#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64000#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:07,691 INFO L273 TraceCheckUtils]: 169: Hoare triple {64000#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {64001#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:07,691 INFO L273 TraceCheckUtils]: 170: Hoare triple {64001#(<= main_~i~0 41)} assume true; {64001#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:07,691 INFO L273 TraceCheckUtils]: 171: Hoare triple {64001#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64001#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:07,692 INFO L273 TraceCheckUtils]: 172: Hoare triple {64001#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64001#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:07,693 INFO L273 TraceCheckUtils]: 173: Hoare triple {64001#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {64002#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:07,693 INFO L273 TraceCheckUtils]: 174: Hoare triple {64002#(<= main_~i~0 42)} assume true; {64002#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:07,693 INFO L273 TraceCheckUtils]: 175: Hoare triple {64002#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64002#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:07,694 INFO L273 TraceCheckUtils]: 176: Hoare triple {64002#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64002#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:07,695 INFO L273 TraceCheckUtils]: 177: Hoare triple {64002#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {64003#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:07,695 INFO L273 TraceCheckUtils]: 178: Hoare triple {64003#(<= main_~i~0 43)} assume true; {64003#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:07,696 INFO L273 TraceCheckUtils]: 179: Hoare triple {64003#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64003#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:07,696 INFO L273 TraceCheckUtils]: 180: Hoare triple {64003#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64003#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:07,697 INFO L273 TraceCheckUtils]: 181: Hoare triple {64003#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {64004#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:07,697 INFO L273 TraceCheckUtils]: 182: Hoare triple {64004#(<= main_~i~0 44)} assume true; {64004#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:07,698 INFO L273 TraceCheckUtils]: 183: Hoare triple {64004#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64004#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:07,698 INFO L273 TraceCheckUtils]: 184: Hoare triple {64004#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64004#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:07,699 INFO L273 TraceCheckUtils]: 185: Hoare triple {64004#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {64005#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:07,699 INFO L273 TraceCheckUtils]: 186: Hoare triple {64005#(<= main_~i~0 45)} assume true; {64005#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:07,700 INFO L273 TraceCheckUtils]: 187: Hoare triple {64005#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64005#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:07,700 INFO L273 TraceCheckUtils]: 188: Hoare triple {64005#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64005#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:07,701 INFO L273 TraceCheckUtils]: 189: Hoare triple {64005#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {64006#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:07,701 INFO L273 TraceCheckUtils]: 190: Hoare triple {64006#(<= main_~i~0 46)} assume true; {64006#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:07,702 INFO L273 TraceCheckUtils]: 191: Hoare triple {64006#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64006#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:07,702 INFO L273 TraceCheckUtils]: 192: Hoare triple {64006#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64006#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:07,703 INFO L273 TraceCheckUtils]: 193: Hoare triple {64006#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {64007#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:07,703 INFO L273 TraceCheckUtils]: 194: Hoare triple {64007#(<= main_~i~0 47)} assume true; {64007#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:07,704 INFO L273 TraceCheckUtils]: 195: Hoare triple {64007#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64007#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:07,704 INFO L273 TraceCheckUtils]: 196: Hoare triple {64007#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64007#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:07,705 INFO L273 TraceCheckUtils]: 197: Hoare triple {64007#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {64008#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:07,705 INFO L273 TraceCheckUtils]: 198: Hoare triple {64008#(<= main_~i~0 48)} assume true; {64008#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:07,706 INFO L273 TraceCheckUtils]: 199: Hoare triple {64008#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64008#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:07,706 INFO L273 TraceCheckUtils]: 200: Hoare triple {64008#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64008#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:07,707 INFO L273 TraceCheckUtils]: 201: Hoare triple {64008#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {64009#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:07,707 INFO L273 TraceCheckUtils]: 202: Hoare triple {64009#(<= main_~i~0 49)} assume true; {64009#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:07,708 INFO L273 TraceCheckUtils]: 203: Hoare triple {64009#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64009#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:07,708 INFO L273 TraceCheckUtils]: 204: Hoare triple {64009#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64009#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:07,709 INFO L273 TraceCheckUtils]: 205: Hoare triple {64009#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {64010#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:07,709 INFO L273 TraceCheckUtils]: 206: Hoare triple {64010#(<= main_~i~0 50)} assume true; {64010#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:07,710 INFO L273 TraceCheckUtils]: 207: Hoare triple {64010#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64010#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:07,710 INFO L273 TraceCheckUtils]: 208: Hoare triple {64010#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64010#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:07,711 INFO L273 TraceCheckUtils]: 209: Hoare triple {64010#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {64011#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:07,711 INFO L273 TraceCheckUtils]: 210: Hoare triple {64011#(<= main_~i~0 51)} assume true; {64011#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:07,712 INFO L273 TraceCheckUtils]: 211: Hoare triple {64011#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64011#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:07,712 INFO L273 TraceCheckUtils]: 212: Hoare triple {64011#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64011#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:07,713 INFO L273 TraceCheckUtils]: 213: Hoare triple {64011#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {64012#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:07,713 INFO L273 TraceCheckUtils]: 214: Hoare triple {64012#(<= main_~i~0 52)} assume true; {64012#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:07,714 INFO L273 TraceCheckUtils]: 215: Hoare triple {64012#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64012#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:07,714 INFO L273 TraceCheckUtils]: 216: Hoare triple {64012#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64012#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:07,715 INFO L273 TraceCheckUtils]: 217: Hoare triple {64012#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {64013#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:07,716 INFO L273 TraceCheckUtils]: 218: Hoare triple {64013#(<= main_~i~0 53)} assume true; {64013#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:07,716 INFO L273 TraceCheckUtils]: 219: Hoare triple {64013#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64013#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:07,716 INFO L273 TraceCheckUtils]: 220: Hoare triple {64013#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64013#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:07,717 INFO L273 TraceCheckUtils]: 221: Hoare triple {64013#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {64014#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:07,718 INFO L273 TraceCheckUtils]: 222: Hoare triple {64014#(<= main_~i~0 54)} assume true; {64014#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:07,718 INFO L273 TraceCheckUtils]: 223: Hoare triple {64014#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64014#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:07,719 INFO L273 TraceCheckUtils]: 224: Hoare triple {64014#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64014#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:07,719 INFO L273 TraceCheckUtils]: 225: Hoare triple {64014#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {64015#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:07,720 INFO L273 TraceCheckUtils]: 226: Hoare triple {64015#(<= main_~i~0 55)} assume true; {64015#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:07,720 INFO L273 TraceCheckUtils]: 227: Hoare triple {64015#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64015#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:07,721 INFO L273 TraceCheckUtils]: 228: Hoare triple {64015#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64015#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:07,721 INFO L273 TraceCheckUtils]: 229: Hoare triple {64015#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {64016#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:07,722 INFO L273 TraceCheckUtils]: 230: Hoare triple {64016#(<= main_~i~0 56)} assume true; {64016#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:07,722 INFO L273 TraceCheckUtils]: 231: Hoare triple {64016#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64016#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:07,723 INFO L273 TraceCheckUtils]: 232: Hoare triple {64016#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64016#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:07,723 INFO L273 TraceCheckUtils]: 233: Hoare triple {64016#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {64017#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:07,724 INFO L273 TraceCheckUtils]: 234: Hoare triple {64017#(<= main_~i~0 57)} assume true; {64017#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:07,724 INFO L273 TraceCheckUtils]: 235: Hoare triple {64017#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64017#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:07,725 INFO L273 TraceCheckUtils]: 236: Hoare triple {64017#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64017#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:07,725 INFO L273 TraceCheckUtils]: 237: Hoare triple {64017#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {64018#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:07,726 INFO L273 TraceCheckUtils]: 238: Hoare triple {64018#(<= main_~i~0 58)} assume true; {64018#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:07,726 INFO L273 TraceCheckUtils]: 239: Hoare triple {64018#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64018#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:07,727 INFO L273 TraceCheckUtils]: 240: Hoare triple {64018#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64018#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:07,727 INFO L273 TraceCheckUtils]: 241: Hoare triple {64018#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {64019#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:07,728 INFO L273 TraceCheckUtils]: 242: Hoare triple {64019#(<= main_~i~0 59)} assume true; {64019#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:07,728 INFO L273 TraceCheckUtils]: 243: Hoare triple {64019#(<= main_~i~0 59)} assume !(~i~0 < 100000); {63959#false} is VALID [2018-11-18 22:59:07,729 INFO L273 TraceCheckUtils]: 244: Hoare triple {63959#false} havoc ~x~0;~x~0 := 0; {63959#false} is VALID [2018-11-18 22:59:07,729 INFO L273 TraceCheckUtils]: 245: Hoare triple {63959#false} assume true; {63959#false} is VALID [2018-11-18 22:59:07,729 INFO L273 TraceCheckUtils]: 246: Hoare triple {63959#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {63959#false} is VALID [2018-11-18 22:59:07,729 INFO L256 TraceCheckUtils]: 247: Hoare triple {63959#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {63959#false} is VALID [2018-11-18 22:59:07,729 INFO L273 TraceCheckUtils]: 248: Hoare triple {63959#false} ~cond := #in~cond; {63959#false} is VALID [2018-11-18 22:59:07,729 INFO L273 TraceCheckUtils]: 249: Hoare triple {63959#false} assume 0 == ~cond; {63959#false} is VALID [2018-11-18 22:59:07,730 INFO L273 TraceCheckUtils]: 250: Hoare triple {63959#false} assume !false; {63959#false} is VALID [2018-11-18 22:59:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:07,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:59:07,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:59:07,784 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:59:07,962 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-11-18 22:59:07,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:59:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:08,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:59:08,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {63958#true} call ULTIMATE.init(); {63958#true} is VALID [2018-11-18 22:59:08,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {63958#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {63958#true} is VALID [2018-11-18 22:59:08,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {63958#true} assume true; {63958#true} is VALID [2018-11-18 22:59:08,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {63958#true} {63958#true} #57#return; {63958#true} is VALID [2018-11-18 22:59:08,439 INFO L256 TraceCheckUtils]: 4: Hoare triple {63958#true} call #t~ret4 := main(); {63958#true} is VALID [2018-11-18 22:59:08,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {63958#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {64038#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:08,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {64038#(<= main_~i~0 0)} assume true; {64038#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:08,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {64038#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64038#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:08,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {64038#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64038#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:08,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {64038#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {63961#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:08,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {63961#(<= main_~i~0 1)} assume true; {63961#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:08,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {63961#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63961#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:08,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {63961#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63961#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:08,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {63961#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {63962#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:08,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {63962#(<= main_~i~0 2)} assume true; {63962#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:08,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {63962#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63962#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:08,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {63962#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63962#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:08,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {63962#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {63963#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:08,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {63963#(<= main_~i~0 3)} assume true; {63963#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:08,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {63963#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63963#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:08,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {63963#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63963#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:08,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {63963#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {63964#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:08,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {63964#(<= main_~i~0 4)} assume true; {63964#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:08,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {63964#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63964#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:08,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {63964#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63964#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:08,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {63964#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {63965#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:08,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {63965#(<= main_~i~0 5)} assume true; {63965#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:08,450 INFO L273 TraceCheckUtils]: 27: Hoare triple {63965#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63965#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:08,451 INFO L273 TraceCheckUtils]: 28: Hoare triple {63965#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63965#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:08,451 INFO L273 TraceCheckUtils]: 29: Hoare triple {63965#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {63966#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:08,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {63966#(<= main_~i~0 6)} assume true; {63966#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:08,452 INFO L273 TraceCheckUtils]: 31: Hoare triple {63966#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63966#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:08,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {63966#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63966#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:08,453 INFO L273 TraceCheckUtils]: 33: Hoare triple {63966#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {63967#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:08,454 INFO L273 TraceCheckUtils]: 34: Hoare triple {63967#(<= main_~i~0 7)} assume true; {63967#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:08,454 INFO L273 TraceCheckUtils]: 35: Hoare triple {63967#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63967#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:08,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {63967#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63967#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:08,455 INFO L273 TraceCheckUtils]: 37: Hoare triple {63967#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {63968#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:08,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {63968#(<= main_~i~0 8)} assume true; {63968#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:08,456 INFO L273 TraceCheckUtils]: 39: Hoare triple {63968#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63968#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:08,457 INFO L273 TraceCheckUtils]: 40: Hoare triple {63968#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63968#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:08,457 INFO L273 TraceCheckUtils]: 41: Hoare triple {63968#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {63969#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:08,458 INFO L273 TraceCheckUtils]: 42: Hoare triple {63969#(<= main_~i~0 9)} assume true; {63969#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:08,458 INFO L273 TraceCheckUtils]: 43: Hoare triple {63969#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63969#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:08,459 INFO L273 TraceCheckUtils]: 44: Hoare triple {63969#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63969#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:08,460 INFO L273 TraceCheckUtils]: 45: Hoare triple {63969#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {63970#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:08,460 INFO L273 TraceCheckUtils]: 46: Hoare triple {63970#(<= main_~i~0 10)} assume true; {63970#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:08,461 INFO L273 TraceCheckUtils]: 47: Hoare triple {63970#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63970#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:08,461 INFO L273 TraceCheckUtils]: 48: Hoare triple {63970#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63970#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:08,462 INFO L273 TraceCheckUtils]: 49: Hoare triple {63970#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {63971#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:08,462 INFO L273 TraceCheckUtils]: 50: Hoare triple {63971#(<= main_~i~0 11)} assume true; {63971#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:08,463 INFO L273 TraceCheckUtils]: 51: Hoare triple {63971#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63971#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:08,463 INFO L273 TraceCheckUtils]: 52: Hoare triple {63971#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63971#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:08,464 INFO L273 TraceCheckUtils]: 53: Hoare triple {63971#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {63972#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:08,465 INFO L273 TraceCheckUtils]: 54: Hoare triple {63972#(<= main_~i~0 12)} assume true; {63972#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:08,465 INFO L273 TraceCheckUtils]: 55: Hoare triple {63972#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63972#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:08,466 INFO L273 TraceCheckUtils]: 56: Hoare triple {63972#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63972#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:08,466 INFO L273 TraceCheckUtils]: 57: Hoare triple {63972#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {63973#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:08,467 INFO L273 TraceCheckUtils]: 58: Hoare triple {63973#(<= main_~i~0 13)} assume true; {63973#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:08,467 INFO L273 TraceCheckUtils]: 59: Hoare triple {63973#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63973#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:08,468 INFO L273 TraceCheckUtils]: 60: Hoare triple {63973#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63973#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:08,468 INFO L273 TraceCheckUtils]: 61: Hoare triple {63973#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {63974#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:08,469 INFO L273 TraceCheckUtils]: 62: Hoare triple {63974#(<= main_~i~0 14)} assume true; {63974#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:08,469 INFO L273 TraceCheckUtils]: 63: Hoare triple {63974#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63974#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:08,470 INFO L273 TraceCheckUtils]: 64: Hoare triple {63974#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63974#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:08,470 INFO L273 TraceCheckUtils]: 65: Hoare triple {63974#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {63975#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:08,471 INFO L273 TraceCheckUtils]: 66: Hoare triple {63975#(<= main_~i~0 15)} assume true; {63975#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:08,471 INFO L273 TraceCheckUtils]: 67: Hoare triple {63975#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63975#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:08,472 INFO L273 TraceCheckUtils]: 68: Hoare triple {63975#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63975#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:08,473 INFO L273 TraceCheckUtils]: 69: Hoare triple {63975#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {63976#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:08,473 INFO L273 TraceCheckUtils]: 70: Hoare triple {63976#(<= main_~i~0 16)} assume true; {63976#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:08,474 INFO L273 TraceCheckUtils]: 71: Hoare triple {63976#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63976#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:08,474 INFO L273 TraceCheckUtils]: 72: Hoare triple {63976#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63976#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:08,475 INFO L273 TraceCheckUtils]: 73: Hoare triple {63976#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {63977#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:08,475 INFO L273 TraceCheckUtils]: 74: Hoare triple {63977#(<= main_~i~0 17)} assume true; {63977#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:08,476 INFO L273 TraceCheckUtils]: 75: Hoare triple {63977#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63977#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:08,476 INFO L273 TraceCheckUtils]: 76: Hoare triple {63977#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63977#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:08,477 INFO L273 TraceCheckUtils]: 77: Hoare triple {63977#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {63978#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:08,477 INFO L273 TraceCheckUtils]: 78: Hoare triple {63978#(<= main_~i~0 18)} assume true; {63978#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:08,478 INFO L273 TraceCheckUtils]: 79: Hoare triple {63978#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63978#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:08,478 INFO L273 TraceCheckUtils]: 80: Hoare triple {63978#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63978#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:08,479 INFO L273 TraceCheckUtils]: 81: Hoare triple {63978#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {63979#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:08,479 INFO L273 TraceCheckUtils]: 82: Hoare triple {63979#(<= main_~i~0 19)} assume true; {63979#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:08,480 INFO L273 TraceCheckUtils]: 83: Hoare triple {63979#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63979#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:08,480 INFO L273 TraceCheckUtils]: 84: Hoare triple {63979#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63979#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:08,481 INFO L273 TraceCheckUtils]: 85: Hoare triple {63979#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {63980#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:08,481 INFO L273 TraceCheckUtils]: 86: Hoare triple {63980#(<= main_~i~0 20)} assume true; {63980#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:08,482 INFO L273 TraceCheckUtils]: 87: Hoare triple {63980#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63980#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:08,482 INFO L273 TraceCheckUtils]: 88: Hoare triple {63980#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63980#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:08,483 INFO L273 TraceCheckUtils]: 89: Hoare triple {63980#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {63981#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:08,484 INFO L273 TraceCheckUtils]: 90: Hoare triple {63981#(<= main_~i~0 21)} assume true; {63981#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:08,484 INFO L273 TraceCheckUtils]: 91: Hoare triple {63981#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63981#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:08,485 INFO L273 TraceCheckUtils]: 92: Hoare triple {63981#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63981#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:08,485 INFO L273 TraceCheckUtils]: 93: Hoare triple {63981#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {63982#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:08,486 INFO L273 TraceCheckUtils]: 94: Hoare triple {63982#(<= main_~i~0 22)} assume true; {63982#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:08,486 INFO L273 TraceCheckUtils]: 95: Hoare triple {63982#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63982#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:08,487 INFO L273 TraceCheckUtils]: 96: Hoare triple {63982#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63982#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:08,487 INFO L273 TraceCheckUtils]: 97: Hoare triple {63982#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {63983#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:08,488 INFO L273 TraceCheckUtils]: 98: Hoare triple {63983#(<= main_~i~0 23)} assume true; {63983#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:08,488 INFO L273 TraceCheckUtils]: 99: Hoare triple {63983#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63983#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:08,489 INFO L273 TraceCheckUtils]: 100: Hoare triple {63983#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63983#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:08,489 INFO L273 TraceCheckUtils]: 101: Hoare triple {63983#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {63984#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:08,490 INFO L273 TraceCheckUtils]: 102: Hoare triple {63984#(<= main_~i~0 24)} assume true; {63984#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:08,490 INFO L273 TraceCheckUtils]: 103: Hoare triple {63984#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63984#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:08,491 INFO L273 TraceCheckUtils]: 104: Hoare triple {63984#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63984#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:08,491 INFO L273 TraceCheckUtils]: 105: Hoare triple {63984#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {63985#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:08,492 INFO L273 TraceCheckUtils]: 106: Hoare triple {63985#(<= main_~i~0 25)} assume true; {63985#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:08,492 INFO L273 TraceCheckUtils]: 107: Hoare triple {63985#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63985#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:08,493 INFO L273 TraceCheckUtils]: 108: Hoare triple {63985#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63985#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:08,494 INFO L273 TraceCheckUtils]: 109: Hoare triple {63985#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {63986#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:08,494 INFO L273 TraceCheckUtils]: 110: Hoare triple {63986#(<= main_~i~0 26)} assume true; {63986#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:08,495 INFO L273 TraceCheckUtils]: 111: Hoare triple {63986#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63986#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:08,495 INFO L273 TraceCheckUtils]: 112: Hoare triple {63986#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63986#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:08,496 INFO L273 TraceCheckUtils]: 113: Hoare triple {63986#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {63987#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:08,496 INFO L273 TraceCheckUtils]: 114: Hoare triple {63987#(<= main_~i~0 27)} assume true; {63987#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:08,497 INFO L273 TraceCheckUtils]: 115: Hoare triple {63987#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63987#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:08,497 INFO L273 TraceCheckUtils]: 116: Hoare triple {63987#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63987#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:08,498 INFO L273 TraceCheckUtils]: 117: Hoare triple {63987#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {63988#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:08,498 INFO L273 TraceCheckUtils]: 118: Hoare triple {63988#(<= main_~i~0 28)} assume true; {63988#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:08,499 INFO L273 TraceCheckUtils]: 119: Hoare triple {63988#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63988#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:08,499 INFO L273 TraceCheckUtils]: 120: Hoare triple {63988#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63988#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:08,500 INFO L273 TraceCheckUtils]: 121: Hoare triple {63988#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {63989#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:08,500 INFO L273 TraceCheckUtils]: 122: Hoare triple {63989#(<= main_~i~0 29)} assume true; {63989#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:08,501 INFO L273 TraceCheckUtils]: 123: Hoare triple {63989#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63989#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:08,501 INFO L273 TraceCheckUtils]: 124: Hoare triple {63989#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63989#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:08,502 INFO L273 TraceCheckUtils]: 125: Hoare triple {63989#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {63990#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:08,503 INFO L273 TraceCheckUtils]: 126: Hoare triple {63990#(<= main_~i~0 30)} assume true; {63990#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:08,503 INFO L273 TraceCheckUtils]: 127: Hoare triple {63990#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63990#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:08,504 INFO L273 TraceCheckUtils]: 128: Hoare triple {63990#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63990#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:08,504 INFO L273 TraceCheckUtils]: 129: Hoare triple {63990#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {63991#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:08,505 INFO L273 TraceCheckUtils]: 130: Hoare triple {63991#(<= main_~i~0 31)} assume true; {63991#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:08,505 INFO L273 TraceCheckUtils]: 131: Hoare triple {63991#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63991#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:08,506 INFO L273 TraceCheckUtils]: 132: Hoare triple {63991#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63991#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:08,506 INFO L273 TraceCheckUtils]: 133: Hoare triple {63991#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {63992#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:08,507 INFO L273 TraceCheckUtils]: 134: Hoare triple {63992#(<= main_~i~0 32)} assume true; {63992#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:08,507 INFO L273 TraceCheckUtils]: 135: Hoare triple {63992#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63992#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:08,508 INFO L273 TraceCheckUtils]: 136: Hoare triple {63992#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63992#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:08,508 INFO L273 TraceCheckUtils]: 137: Hoare triple {63992#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {63993#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:08,509 INFO L273 TraceCheckUtils]: 138: Hoare triple {63993#(<= main_~i~0 33)} assume true; {63993#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:08,509 INFO L273 TraceCheckUtils]: 139: Hoare triple {63993#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63993#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:08,510 INFO L273 TraceCheckUtils]: 140: Hoare triple {63993#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63993#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:08,511 INFO L273 TraceCheckUtils]: 141: Hoare triple {63993#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {63994#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:08,511 INFO L273 TraceCheckUtils]: 142: Hoare triple {63994#(<= main_~i~0 34)} assume true; {63994#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:08,512 INFO L273 TraceCheckUtils]: 143: Hoare triple {63994#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63994#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:08,513 INFO L273 TraceCheckUtils]: 144: Hoare triple {63994#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63994#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:08,514 INFO L273 TraceCheckUtils]: 145: Hoare triple {63994#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {63995#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:08,518 INFO L273 TraceCheckUtils]: 146: Hoare triple {63995#(<= main_~i~0 35)} assume true; {63995#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:08,518 INFO L273 TraceCheckUtils]: 147: Hoare triple {63995#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63995#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:08,520 INFO L273 TraceCheckUtils]: 148: Hoare triple {63995#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63995#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:08,520 INFO L273 TraceCheckUtils]: 149: Hoare triple {63995#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {63996#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:08,523 INFO L273 TraceCheckUtils]: 150: Hoare triple {63996#(<= main_~i~0 36)} assume true; {63996#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:08,523 INFO L273 TraceCheckUtils]: 151: Hoare triple {63996#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63996#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:08,526 INFO L273 TraceCheckUtils]: 152: Hoare triple {63996#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63996#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:08,526 INFO L273 TraceCheckUtils]: 153: Hoare triple {63996#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {63997#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:08,528 INFO L273 TraceCheckUtils]: 154: Hoare triple {63997#(<= main_~i~0 37)} assume true; {63997#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:08,528 INFO L273 TraceCheckUtils]: 155: Hoare triple {63997#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63997#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:08,531 INFO L273 TraceCheckUtils]: 156: Hoare triple {63997#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63997#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:08,531 INFO L273 TraceCheckUtils]: 157: Hoare triple {63997#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {63998#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:08,533 INFO L273 TraceCheckUtils]: 158: Hoare triple {63998#(<= main_~i~0 38)} assume true; {63998#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:08,533 INFO L273 TraceCheckUtils]: 159: Hoare triple {63998#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63998#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:08,535 INFO L273 TraceCheckUtils]: 160: Hoare triple {63998#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63998#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:08,535 INFO L273 TraceCheckUtils]: 161: Hoare triple {63998#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {63999#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:08,537 INFO L273 TraceCheckUtils]: 162: Hoare triple {63999#(<= main_~i~0 39)} assume true; {63999#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:08,537 INFO L273 TraceCheckUtils]: 163: Hoare triple {63999#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {63999#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:08,539 INFO L273 TraceCheckUtils]: 164: Hoare triple {63999#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {63999#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:08,539 INFO L273 TraceCheckUtils]: 165: Hoare triple {63999#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {64000#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:08,541 INFO L273 TraceCheckUtils]: 166: Hoare triple {64000#(<= main_~i~0 40)} assume true; {64000#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:08,541 INFO L273 TraceCheckUtils]: 167: Hoare triple {64000#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64000#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:08,543 INFO L273 TraceCheckUtils]: 168: Hoare triple {64000#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64000#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:08,543 INFO L273 TraceCheckUtils]: 169: Hoare triple {64000#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {64001#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:08,545 INFO L273 TraceCheckUtils]: 170: Hoare triple {64001#(<= main_~i~0 41)} assume true; {64001#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:08,545 INFO L273 TraceCheckUtils]: 171: Hoare triple {64001#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64001#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:08,547 INFO L273 TraceCheckUtils]: 172: Hoare triple {64001#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64001#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:08,547 INFO L273 TraceCheckUtils]: 173: Hoare triple {64001#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {64002#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:08,550 INFO L273 TraceCheckUtils]: 174: Hoare triple {64002#(<= main_~i~0 42)} assume true; {64002#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:08,550 INFO L273 TraceCheckUtils]: 175: Hoare triple {64002#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64002#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:08,553 INFO L273 TraceCheckUtils]: 176: Hoare triple {64002#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64002#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:08,553 INFO L273 TraceCheckUtils]: 177: Hoare triple {64002#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {64003#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:08,555 INFO L273 TraceCheckUtils]: 178: Hoare triple {64003#(<= main_~i~0 43)} assume true; {64003#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:08,555 INFO L273 TraceCheckUtils]: 179: Hoare triple {64003#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64003#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:08,557 INFO L273 TraceCheckUtils]: 180: Hoare triple {64003#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64003#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:08,557 INFO L273 TraceCheckUtils]: 181: Hoare triple {64003#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {64004#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:08,559 INFO L273 TraceCheckUtils]: 182: Hoare triple {64004#(<= main_~i~0 44)} assume true; {64004#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:08,559 INFO L273 TraceCheckUtils]: 183: Hoare triple {64004#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64004#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:08,562 INFO L273 TraceCheckUtils]: 184: Hoare triple {64004#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64004#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:08,562 INFO L273 TraceCheckUtils]: 185: Hoare triple {64004#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {64005#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:08,564 INFO L273 TraceCheckUtils]: 186: Hoare triple {64005#(<= main_~i~0 45)} assume true; {64005#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:08,564 INFO L273 TraceCheckUtils]: 187: Hoare triple {64005#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64005#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:08,566 INFO L273 TraceCheckUtils]: 188: Hoare triple {64005#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64005#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:08,566 INFO L273 TraceCheckUtils]: 189: Hoare triple {64005#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {64006#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:08,568 INFO L273 TraceCheckUtils]: 190: Hoare triple {64006#(<= main_~i~0 46)} assume true; {64006#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:08,568 INFO L273 TraceCheckUtils]: 191: Hoare triple {64006#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64006#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:08,570 INFO L273 TraceCheckUtils]: 192: Hoare triple {64006#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64006#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:08,570 INFO L273 TraceCheckUtils]: 193: Hoare triple {64006#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {64007#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:08,572 INFO L273 TraceCheckUtils]: 194: Hoare triple {64007#(<= main_~i~0 47)} assume true; {64007#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:08,572 INFO L273 TraceCheckUtils]: 195: Hoare triple {64007#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64007#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:08,575 INFO L273 TraceCheckUtils]: 196: Hoare triple {64007#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64007#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:08,575 INFO L273 TraceCheckUtils]: 197: Hoare triple {64007#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {64008#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:08,577 INFO L273 TraceCheckUtils]: 198: Hoare triple {64008#(<= main_~i~0 48)} assume true; {64008#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:08,577 INFO L273 TraceCheckUtils]: 199: Hoare triple {64008#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64008#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:08,579 INFO L273 TraceCheckUtils]: 200: Hoare triple {64008#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64008#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:08,579 INFO L273 TraceCheckUtils]: 201: Hoare triple {64008#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {64009#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:08,581 INFO L273 TraceCheckUtils]: 202: Hoare triple {64009#(<= main_~i~0 49)} assume true; {64009#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:08,581 INFO L273 TraceCheckUtils]: 203: Hoare triple {64009#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64009#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:08,583 INFO L273 TraceCheckUtils]: 204: Hoare triple {64009#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64009#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:08,583 INFO L273 TraceCheckUtils]: 205: Hoare triple {64009#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {64010#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:08,585 INFO L273 TraceCheckUtils]: 206: Hoare triple {64010#(<= main_~i~0 50)} assume true; {64010#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:08,585 INFO L273 TraceCheckUtils]: 207: Hoare triple {64010#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64010#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:08,587 INFO L273 TraceCheckUtils]: 208: Hoare triple {64010#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64010#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:08,587 INFO L273 TraceCheckUtils]: 209: Hoare triple {64010#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {64011#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:08,590 INFO L273 TraceCheckUtils]: 210: Hoare triple {64011#(<= main_~i~0 51)} assume true; {64011#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:08,590 INFO L273 TraceCheckUtils]: 211: Hoare triple {64011#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64011#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:08,592 INFO L273 TraceCheckUtils]: 212: Hoare triple {64011#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64011#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:08,592 INFO L273 TraceCheckUtils]: 213: Hoare triple {64011#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {64012#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:08,595 INFO L273 TraceCheckUtils]: 214: Hoare triple {64012#(<= main_~i~0 52)} assume true; {64012#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:08,595 INFO L273 TraceCheckUtils]: 215: Hoare triple {64012#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64012#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:08,598 INFO L273 TraceCheckUtils]: 216: Hoare triple {64012#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64012#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:08,598 INFO L273 TraceCheckUtils]: 217: Hoare triple {64012#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {64013#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:08,601 INFO L273 TraceCheckUtils]: 218: Hoare triple {64013#(<= main_~i~0 53)} assume true; {64013#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:08,601 INFO L273 TraceCheckUtils]: 219: Hoare triple {64013#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64013#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:08,603 INFO L273 TraceCheckUtils]: 220: Hoare triple {64013#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64013#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:08,603 INFO L273 TraceCheckUtils]: 221: Hoare triple {64013#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {64014#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:08,605 INFO L273 TraceCheckUtils]: 222: Hoare triple {64014#(<= main_~i~0 54)} assume true; {64014#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:08,605 INFO L273 TraceCheckUtils]: 223: Hoare triple {64014#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64014#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:08,607 INFO L273 TraceCheckUtils]: 224: Hoare triple {64014#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64014#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:08,607 INFO L273 TraceCheckUtils]: 225: Hoare triple {64014#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {64015#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:08,609 INFO L273 TraceCheckUtils]: 226: Hoare triple {64015#(<= main_~i~0 55)} assume true; {64015#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:08,609 INFO L273 TraceCheckUtils]: 227: Hoare triple {64015#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64015#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:08,612 INFO L273 TraceCheckUtils]: 228: Hoare triple {64015#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64015#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:08,612 INFO L273 TraceCheckUtils]: 229: Hoare triple {64015#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {64016#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:08,614 INFO L273 TraceCheckUtils]: 230: Hoare triple {64016#(<= main_~i~0 56)} assume true; {64016#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:08,614 INFO L273 TraceCheckUtils]: 231: Hoare triple {64016#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64016#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:08,617 INFO L273 TraceCheckUtils]: 232: Hoare triple {64016#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64016#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:08,617 INFO L273 TraceCheckUtils]: 233: Hoare triple {64016#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {64017#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:08,619 INFO L273 TraceCheckUtils]: 234: Hoare triple {64017#(<= main_~i~0 57)} assume true; {64017#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:08,619 INFO L273 TraceCheckUtils]: 235: Hoare triple {64017#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64017#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:08,622 INFO L273 TraceCheckUtils]: 236: Hoare triple {64017#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64017#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:08,622 INFO L273 TraceCheckUtils]: 237: Hoare triple {64017#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {64018#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:08,624 INFO L273 TraceCheckUtils]: 238: Hoare triple {64018#(<= main_~i~0 58)} assume true; {64018#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:08,624 INFO L273 TraceCheckUtils]: 239: Hoare triple {64018#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64018#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:08,627 INFO L273 TraceCheckUtils]: 240: Hoare triple {64018#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {64018#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:08,627 INFO L273 TraceCheckUtils]: 241: Hoare triple {64018#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {64019#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:08,629 INFO L273 TraceCheckUtils]: 242: Hoare triple {64019#(<= main_~i~0 59)} assume true; {64019#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:08,629 INFO L273 TraceCheckUtils]: 243: Hoare triple {64019#(<= main_~i~0 59)} assume !(~i~0 < 100000); {63959#false} is VALID [2018-11-18 22:59:08,629 INFO L273 TraceCheckUtils]: 244: Hoare triple {63959#false} havoc ~x~0;~x~0 := 0; {63959#false} is VALID [2018-11-18 22:59:08,629 INFO L273 TraceCheckUtils]: 245: Hoare triple {63959#false} assume true; {63959#false} is VALID [2018-11-18 22:59:08,629 INFO L273 TraceCheckUtils]: 246: Hoare triple {63959#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {63959#false} is VALID [2018-11-18 22:59:08,629 INFO L256 TraceCheckUtils]: 247: Hoare triple {63959#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {63959#false} is VALID [2018-11-18 22:59:08,630 INFO L273 TraceCheckUtils]: 248: Hoare triple {63959#false} ~cond := #in~cond; {63959#false} is VALID [2018-11-18 22:59:08,630 INFO L273 TraceCheckUtils]: 249: Hoare triple {63959#false} assume 0 == ~cond; {63959#false} is VALID [2018-11-18 22:59:08,630 INFO L273 TraceCheckUtils]: 250: Hoare triple {63959#false} assume !false; {63959#false} is VALID [2018-11-18 22:59:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:08,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:59:08,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2018-11-18 22:59:08,694 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 251 [2018-11-18 22:59:08,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:59:08,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states. [2018-11-18 22:59:08,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:08,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-18 22:59:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-18 22:59:08,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-18 22:59:08,979 INFO L87 Difference]: Start difference. First operand 256 states and 316 transitions. Second operand 63 states. [2018-11-18 22:59:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:09,903 INFO L93 Difference]: Finished difference Result 274 states and 337 transitions. [2018-11-18 22:59:09,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-18 22:59:09,904 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 251 [2018-11-18 22:59:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:59:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 22:59:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 337 transitions. [2018-11-18 22:59:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 22:59:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 337 transitions. [2018-11-18 22:59:09,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 337 transitions. [2018-11-18 22:59:10,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:10,216 INFO L225 Difference]: With dead ends: 274 [2018-11-18 22:59:10,216 INFO L226 Difference]: Without dead ends: 262 [2018-11-18 22:59:10,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-18 22:59:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-18 22:59:10,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-18 22:59:10,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:59:10,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 260 states. [2018-11-18 22:59:10,268 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 260 states. [2018-11-18 22:59:10,268 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 260 states. [2018-11-18 22:59:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:10,272 INFO L93 Difference]: Finished difference Result 262 states and 324 transitions. [2018-11-18 22:59:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 324 transitions. [2018-11-18 22:59:10,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:10,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:10,273 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 262 states. [2018-11-18 22:59:10,273 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 262 states. [2018-11-18 22:59:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:10,277 INFO L93 Difference]: Finished difference Result 262 states and 324 transitions. [2018-11-18 22:59:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 324 transitions. [2018-11-18 22:59:10,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:10,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:10,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:59:10,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:59:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-18 22:59:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 321 transitions. [2018-11-18 22:59:10,281 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 321 transitions. Word has length 251 [2018-11-18 22:59:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:59:10,281 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 321 transitions. [2018-11-18 22:59:10,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-18 22:59:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 321 transitions. [2018-11-18 22:59:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-18 22:59:10,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:59:10,283 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:59:10,283 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:59:10,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:59:10,283 INFO L82 PathProgramCache]: Analyzing trace with hash 24929706, now seen corresponding path program 60 times [2018-11-18 22:59:10,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:59:10,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:59:10,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:10,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:59:10,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:11,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {65970#true} call ULTIMATE.init(); {65970#true} is VALID [2018-11-18 22:59:11,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {65970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {65970#true} is VALID [2018-11-18 22:59:11,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {65970#true} assume true; {65970#true} is VALID [2018-11-18 22:59:11,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {65970#true} {65970#true} #57#return; {65970#true} is VALID [2018-11-18 22:59:11,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {65970#true} call #t~ret4 := main(); {65970#true} is VALID [2018-11-18 22:59:11,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {65970#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {65972#(= main_~i~0 0)} is VALID [2018-11-18 22:59:11,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {65972#(= main_~i~0 0)} assume true; {65972#(= main_~i~0 0)} is VALID [2018-11-18 22:59:11,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {65972#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65972#(= main_~i~0 0)} is VALID [2018-11-18 22:59:11,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {65972#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65972#(= main_~i~0 0)} is VALID [2018-11-18 22:59:11,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {65972#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {65973#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:11,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {65973#(<= main_~i~0 1)} assume true; {65973#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:11,999 INFO L273 TraceCheckUtils]: 11: Hoare triple {65973#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65973#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:11,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {65973#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65973#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:12,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {65973#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {65974#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {65974#(<= main_~i~0 2)} assume true; {65974#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,001 INFO L273 TraceCheckUtils]: 15: Hoare triple {65974#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65974#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {65974#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65974#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {65974#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {65975#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,003 INFO L273 TraceCheckUtils]: 18: Hoare triple {65975#(<= main_~i~0 3)} assume true; {65975#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,003 INFO L273 TraceCheckUtils]: 19: Hoare triple {65975#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65975#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,004 INFO L273 TraceCheckUtils]: 20: Hoare triple {65975#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65975#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,004 INFO L273 TraceCheckUtils]: 21: Hoare triple {65975#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {65976#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,005 INFO L273 TraceCheckUtils]: 22: Hoare triple {65976#(<= main_~i~0 4)} assume true; {65976#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {65976#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65976#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,006 INFO L273 TraceCheckUtils]: 24: Hoare triple {65976#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65976#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,007 INFO L273 TraceCheckUtils]: 25: Hoare triple {65976#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {65977#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {65977#(<= main_~i~0 5)} assume true; {65977#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,008 INFO L273 TraceCheckUtils]: 27: Hoare triple {65977#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65977#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {65977#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65977#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {65977#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {65978#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {65978#(<= main_~i~0 6)} assume true; {65978#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {65978#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65978#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {65978#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65978#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,011 INFO L273 TraceCheckUtils]: 33: Hoare triple {65978#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {65979#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {65979#(<= main_~i~0 7)} assume true; {65979#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,012 INFO L273 TraceCheckUtils]: 35: Hoare triple {65979#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65979#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,012 INFO L273 TraceCheckUtils]: 36: Hoare triple {65979#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65979#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,013 INFO L273 TraceCheckUtils]: 37: Hoare triple {65979#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {65980#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,014 INFO L273 TraceCheckUtils]: 38: Hoare triple {65980#(<= main_~i~0 8)} assume true; {65980#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,014 INFO L273 TraceCheckUtils]: 39: Hoare triple {65980#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65980#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,015 INFO L273 TraceCheckUtils]: 40: Hoare triple {65980#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65980#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,015 INFO L273 TraceCheckUtils]: 41: Hoare triple {65980#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {65981#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,016 INFO L273 TraceCheckUtils]: 42: Hoare triple {65981#(<= main_~i~0 9)} assume true; {65981#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,016 INFO L273 TraceCheckUtils]: 43: Hoare triple {65981#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65981#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,017 INFO L273 TraceCheckUtils]: 44: Hoare triple {65981#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65981#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,017 INFO L273 TraceCheckUtils]: 45: Hoare triple {65981#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {65982#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,018 INFO L273 TraceCheckUtils]: 46: Hoare triple {65982#(<= main_~i~0 10)} assume true; {65982#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,018 INFO L273 TraceCheckUtils]: 47: Hoare triple {65982#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65982#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,019 INFO L273 TraceCheckUtils]: 48: Hoare triple {65982#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65982#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,020 INFO L273 TraceCheckUtils]: 49: Hoare triple {65982#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {65983#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,020 INFO L273 TraceCheckUtils]: 50: Hoare triple {65983#(<= main_~i~0 11)} assume true; {65983#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,021 INFO L273 TraceCheckUtils]: 51: Hoare triple {65983#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65983#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,021 INFO L273 TraceCheckUtils]: 52: Hoare triple {65983#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65983#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,022 INFO L273 TraceCheckUtils]: 53: Hoare triple {65983#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {65984#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,022 INFO L273 TraceCheckUtils]: 54: Hoare triple {65984#(<= main_~i~0 12)} assume true; {65984#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,023 INFO L273 TraceCheckUtils]: 55: Hoare triple {65984#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65984#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,023 INFO L273 TraceCheckUtils]: 56: Hoare triple {65984#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65984#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,024 INFO L273 TraceCheckUtils]: 57: Hoare triple {65984#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {65985#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,024 INFO L273 TraceCheckUtils]: 58: Hoare triple {65985#(<= main_~i~0 13)} assume true; {65985#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,025 INFO L273 TraceCheckUtils]: 59: Hoare triple {65985#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65985#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,025 INFO L273 TraceCheckUtils]: 60: Hoare triple {65985#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65985#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,026 INFO L273 TraceCheckUtils]: 61: Hoare triple {65985#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {65986#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,026 INFO L273 TraceCheckUtils]: 62: Hoare triple {65986#(<= main_~i~0 14)} assume true; {65986#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,027 INFO L273 TraceCheckUtils]: 63: Hoare triple {65986#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65986#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,027 INFO L273 TraceCheckUtils]: 64: Hoare triple {65986#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65986#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,028 INFO L273 TraceCheckUtils]: 65: Hoare triple {65986#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {65987#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,028 INFO L273 TraceCheckUtils]: 66: Hoare triple {65987#(<= main_~i~0 15)} assume true; {65987#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,029 INFO L273 TraceCheckUtils]: 67: Hoare triple {65987#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65987#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,029 INFO L273 TraceCheckUtils]: 68: Hoare triple {65987#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65987#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,030 INFO L273 TraceCheckUtils]: 69: Hoare triple {65987#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {65988#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,031 INFO L273 TraceCheckUtils]: 70: Hoare triple {65988#(<= main_~i~0 16)} assume true; {65988#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,031 INFO L273 TraceCheckUtils]: 71: Hoare triple {65988#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65988#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,032 INFO L273 TraceCheckUtils]: 72: Hoare triple {65988#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65988#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,032 INFO L273 TraceCheckUtils]: 73: Hoare triple {65988#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {65989#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,033 INFO L273 TraceCheckUtils]: 74: Hoare triple {65989#(<= main_~i~0 17)} assume true; {65989#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,033 INFO L273 TraceCheckUtils]: 75: Hoare triple {65989#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65989#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,034 INFO L273 TraceCheckUtils]: 76: Hoare triple {65989#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65989#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,035 INFO L273 TraceCheckUtils]: 77: Hoare triple {65989#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {65990#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,035 INFO L273 TraceCheckUtils]: 78: Hoare triple {65990#(<= main_~i~0 18)} assume true; {65990#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,035 INFO L273 TraceCheckUtils]: 79: Hoare triple {65990#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65990#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,036 INFO L273 TraceCheckUtils]: 80: Hoare triple {65990#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65990#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,037 INFO L273 TraceCheckUtils]: 81: Hoare triple {65990#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {65991#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,037 INFO L273 TraceCheckUtils]: 82: Hoare triple {65991#(<= main_~i~0 19)} assume true; {65991#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,038 INFO L273 TraceCheckUtils]: 83: Hoare triple {65991#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65991#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,038 INFO L273 TraceCheckUtils]: 84: Hoare triple {65991#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65991#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,039 INFO L273 TraceCheckUtils]: 85: Hoare triple {65991#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {65992#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,039 INFO L273 TraceCheckUtils]: 86: Hoare triple {65992#(<= main_~i~0 20)} assume true; {65992#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,040 INFO L273 TraceCheckUtils]: 87: Hoare triple {65992#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65992#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,040 INFO L273 TraceCheckUtils]: 88: Hoare triple {65992#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65992#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,041 INFO L273 TraceCheckUtils]: 89: Hoare triple {65992#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {65993#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,041 INFO L273 TraceCheckUtils]: 90: Hoare triple {65993#(<= main_~i~0 21)} assume true; {65993#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,042 INFO L273 TraceCheckUtils]: 91: Hoare triple {65993#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65993#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,042 INFO L273 TraceCheckUtils]: 92: Hoare triple {65993#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65993#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,043 INFO L273 TraceCheckUtils]: 93: Hoare triple {65993#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {65994#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,043 INFO L273 TraceCheckUtils]: 94: Hoare triple {65994#(<= main_~i~0 22)} assume true; {65994#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,044 INFO L273 TraceCheckUtils]: 95: Hoare triple {65994#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65994#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,044 INFO L273 TraceCheckUtils]: 96: Hoare triple {65994#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65994#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,045 INFO L273 TraceCheckUtils]: 97: Hoare triple {65994#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {65995#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,045 INFO L273 TraceCheckUtils]: 98: Hoare triple {65995#(<= main_~i~0 23)} assume true; {65995#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,046 INFO L273 TraceCheckUtils]: 99: Hoare triple {65995#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65995#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,046 INFO L273 TraceCheckUtils]: 100: Hoare triple {65995#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65995#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,047 INFO L273 TraceCheckUtils]: 101: Hoare triple {65995#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {65996#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,048 INFO L273 TraceCheckUtils]: 102: Hoare triple {65996#(<= main_~i~0 24)} assume true; {65996#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,048 INFO L273 TraceCheckUtils]: 103: Hoare triple {65996#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65996#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,049 INFO L273 TraceCheckUtils]: 104: Hoare triple {65996#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65996#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,049 INFO L273 TraceCheckUtils]: 105: Hoare triple {65996#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {65997#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,050 INFO L273 TraceCheckUtils]: 106: Hoare triple {65997#(<= main_~i~0 25)} assume true; {65997#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,050 INFO L273 TraceCheckUtils]: 107: Hoare triple {65997#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65997#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,051 INFO L273 TraceCheckUtils]: 108: Hoare triple {65997#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65997#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,051 INFO L273 TraceCheckUtils]: 109: Hoare triple {65997#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {65998#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,052 INFO L273 TraceCheckUtils]: 110: Hoare triple {65998#(<= main_~i~0 26)} assume true; {65998#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,052 INFO L273 TraceCheckUtils]: 111: Hoare triple {65998#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65998#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,053 INFO L273 TraceCheckUtils]: 112: Hoare triple {65998#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65998#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,054 INFO L273 TraceCheckUtils]: 113: Hoare triple {65998#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {65999#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,054 INFO L273 TraceCheckUtils]: 114: Hoare triple {65999#(<= main_~i~0 27)} assume true; {65999#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,055 INFO L273 TraceCheckUtils]: 115: Hoare triple {65999#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65999#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,055 INFO L273 TraceCheckUtils]: 116: Hoare triple {65999#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65999#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,056 INFO L273 TraceCheckUtils]: 117: Hoare triple {65999#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {66000#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,056 INFO L273 TraceCheckUtils]: 118: Hoare triple {66000#(<= main_~i~0 28)} assume true; {66000#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,057 INFO L273 TraceCheckUtils]: 119: Hoare triple {66000#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66000#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,057 INFO L273 TraceCheckUtils]: 120: Hoare triple {66000#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66000#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,058 INFO L273 TraceCheckUtils]: 121: Hoare triple {66000#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {66001#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,058 INFO L273 TraceCheckUtils]: 122: Hoare triple {66001#(<= main_~i~0 29)} assume true; {66001#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,059 INFO L273 TraceCheckUtils]: 123: Hoare triple {66001#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66001#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,059 INFO L273 TraceCheckUtils]: 124: Hoare triple {66001#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66001#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,060 INFO L273 TraceCheckUtils]: 125: Hoare triple {66001#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {66002#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,061 INFO L273 TraceCheckUtils]: 126: Hoare triple {66002#(<= main_~i~0 30)} assume true; {66002#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,061 INFO L273 TraceCheckUtils]: 127: Hoare triple {66002#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66002#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,062 INFO L273 TraceCheckUtils]: 128: Hoare triple {66002#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66002#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,062 INFO L273 TraceCheckUtils]: 129: Hoare triple {66002#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {66003#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,063 INFO L273 TraceCheckUtils]: 130: Hoare triple {66003#(<= main_~i~0 31)} assume true; {66003#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,063 INFO L273 TraceCheckUtils]: 131: Hoare triple {66003#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66003#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,064 INFO L273 TraceCheckUtils]: 132: Hoare triple {66003#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66003#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,064 INFO L273 TraceCheckUtils]: 133: Hoare triple {66003#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {66004#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,065 INFO L273 TraceCheckUtils]: 134: Hoare triple {66004#(<= main_~i~0 32)} assume true; {66004#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,065 INFO L273 TraceCheckUtils]: 135: Hoare triple {66004#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66004#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,066 INFO L273 TraceCheckUtils]: 136: Hoare triple {66004#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66004#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,066 INFO L273 TraceCheckUtils]: 137: Hoare triple {66004#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {66005#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,067 INFO L273 TraceCheckUtils]: 138: Hoare triple {66005#(<= main_~i~0 33)} assume true; {66005#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,067 INFO L273 TraceCheckUtils]: 139: Hoare triple {66005#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66005#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,068 INFO L273 TraceCheckUtils]: 140: Hoare triple {66005#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66005#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,069 INFO L273 TraceCheckUtils]: 141: Hoare triple {66005#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {66006#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,069 INFO L273 TraceCheckUtils]: 142: Hoare triple {66006#(<= main_~i~0 34)} assume true; {66006#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,070 INFO L273 TraceCheckUtils]: 143: Hoare triple {66006#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66006#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,070 INFO L273 TraceCheckUtils]: 144: Hoare triple {66006#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66006#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,071 INFO L273 TraceCheckUtils]: 145: Hoare triple {66006#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {66007#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,071 INFO L273 TraceCheckUtils]: 146: Hoare triple {66007#(<= main_~i~0 35)} assume true; {66007#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,072 INFO L273 TraceCheckUtils]: 147: Hoare triple {66007#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66007#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,072 INFO L273 TraceCheckUtils]: 148: Hoare triple {66007#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66007#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,073 INFO L273 TraceCheckUtils]: 149: Hoare triple {66007#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {66008#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,073 INFO L273 TraceCheckUtils]: 150: Hoare triple {66008#(<= main_~i~0 36)} assume true; {66008#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,074 INFO L273 TraceCheckUtils]: 151: Hoare triple {66008#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66008#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,074 INFO L273 TraceCheckUtils]: 152: Hoare triple {66008#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66008#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,075 INFO L273 TraceCheckUtils]: 153: Hoare triple {66008#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {66009#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,076 INFO L273 TraceCheckUtils]: 154: Hoare triple {66009#(<= main_~i~0 37)} assume true; {66009#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,076 INFO L273 TraceCheckUtils]: 155: Hoare triple {66009#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66009#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,077 INFO L273 TraceCheckUtils]: 156: Hoare triple {66009#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66009#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,077 INFO L273 TraceCheckUtils]: 157: Hoare triple {66009#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {66010#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:12,078 INFO L273 TraceCheckUtils]: 158: Hoare triple {66010#(<= main_~i~0 38)} assume true; {66010#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:12,078 INFO L273 TraceCheckUtils]: 159: Hoare triple {66010#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66010#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:12,079 INFO L273 TraceCheckUtils]: 160: Hoare triple {66010#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66010#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:12,079 INFO L273 TraceCheckUtils]: 161: Hoare triple {66010#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {66011#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:12,080 INFO L273 TraceCheckUtils]: 162: Hoare triple {66011#(<= main_~i~0 39)} assume true; {66011#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:12,080 INFO L273 TraceCheckUtils]: 163: Hoare triple {66011#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66011#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:12,081 INFO L273 TraceCheckUtils]: 164: Hoare triple {66011#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66011#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:12,082 INFO L273 TraceCheckUtils]: 165: Hoare triple {66011#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {66012#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:12,082 INFO L273 TraceCheckUtils]: 166: Hoare triple {66012#(<= main_~i~0 40)} assume true; {66012#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:12,083 INFO L273 TraceCheckUtils]: 167: Hoare triple {66012#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66012#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:12,083 INFO L273 TraceCheckUtils]: 168: Hoare triple {66012#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66012#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:12,084 INFO L273 TraceCheckUtils]: 169: Hoare triple {66012#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {66013#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:12,084 INFO L273 TraceCheckUtils]: 170: Hoare triple {66013#(<= main_~i~0 41)} assume true; {66013#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:12,085 INFO L273 TraceCheckUtils]: 171: Hoare triple {66013#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66013#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:12,085 INFO L273 TraceCheckUtils]: 172: Hoare triple {66013#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66013#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:12,086 INFO L273 TraceCheckUtils]: 173: Hoare triple {66013#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {66014#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:12,086 INFO L273 TraceCheckUtils]: 174: Hoare triple {66014#(<= main_~i~0 42)} assume true; {66014#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:12,087 INFO L273 TraceCheckUtils]: 175: Hoare triple {66014#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66014#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:12,087 INFO L273 TraceCheckUtils]: 176: Hoare triple {66014#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66014#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:12,088 INFO L273 TraceCheckUtils]: 177: Hoare triple {66014#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {66015#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:12,089 INFO L273 TraceCheckUtils]: 178: Hoare triple {66015#(<= main_~i~0 43)} assume true; {66015#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:12,089 INFO L273 TraceCheckUtils]: 179: Hoare triple {66015#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66015#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:12,090 INFO L273 TraceCheckUtils]: 180: Hoare triple {66015#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66015#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:12,090 INFO L273 TraceCheckUtils]: 181: Hoare triple {66015#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {66016#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:12,091 INFO L273 TraceCheckUtils]: 182: Hoare triple {66016#(<= main_~i~0 44)} assume true; {66016#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:12,091 INFO L273 TraceCheckUtils]: 183: Hoare triple {66016#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66016#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:12,092 INFO L273 TraceCheckUtils]: 184: Hoare triple {66016#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66016#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:12,092 INFO L273 TraceCheckUtils]: 185: Hoare triple {66016#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {66017#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:12,093 INFO L273 TraceCheckUtils]: 186: Hoare triple {66017#(<= main_~i~0 45)} assume true; {66017#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:12,093 INFO L273 TraceCheckUtils]: 187: Hoare triple {66017#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66017#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:12,094 INFO L273 TraceCheckUtils]: 188: Hoare triple {66017#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66017#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:12,095 INFO L273 TraceCheckUtils]: 189: Hoare triple {66017#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {66018#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:12,095 INFO L273 TraceCheckUtils]: 190: Hoare triple {66018#(<= main_~i~0 46)} assume true; {66018#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:12,096 INFO L273 TraceCheckUtils]: 191: Hoare triple {66018#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66018#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:12,096 INFO L273 TraceCheckUtils]: 192: Hoare triple {66018#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66018#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:12,097 INFO L273 TraceCheckUtils]: 193: Hoare triple {66018#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {66019#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:12,097 INFO L273 TraceCheckUtils]: 194: Hoare triple {66019#(<= main_~i~0 47)} assume true; {66019#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:12,098 INFO L273 TraceCheckUtils]: 195: Hoare triple {66019#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66019#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:12,098 INFO L273 TraceCheckUtils]: 196: Hoare triple {66019#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66019#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:12,099 INFO L273 TraceCheckUtils]: 197: Hoare triple {66019#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {66020#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:12,099 INFO L273 TraceCheckUtils]: 198: Hoare triple {66020#(<= main_~i~0 48)} assume true; {66020#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:12,100 INFO L273 TraceCheckUtils]: 199: Hoare triple {66020#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66020#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:12,100 INFO L273 TraceCheckUtils]: 200: Hoare triple {66020#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66020#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:12,101 INFO L273 TraceCheckUtils]: 201: Hoare triple {66020#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {66021#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:12,102 INFO L273 TraceCheckUtils]: 202: Hoare triple {66021#(<= main_~i~0 49)} assume true; {66021#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:12,102 INFO L273 TraceCheckUtils]: 203: Hoare triple {66021#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66021#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:12,102 INFO L273 TraceCheckUtils]: 204: Hoare triple {66021#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66021#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:12,103 INFO L273 TraceCheckUtils]: 205: Hoare triple {66021#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {66022#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:12,104 INFO L273 TraceCheckUtils]: 206: Hoare triple {66022#(<= main_~i~0 50)} assume true; {66022#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:12,104 INFO L273 TraceCheckUtils]: 207: Hoare triple {66022#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66022#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:12,105 INFO L273 TraceCheckUtils]: 208: Hoare triple {66022#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66022#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:12,105 INFO L273 TraceCheckUtils]: 209: Hoare triple {66022#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {66023#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:12,106 INFO L273 TraceCheckUtils]: 210: Hoare triple {66023#(<= main_~i~0 51)} assume true; {66023#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:12,106 INFO L273 TraceCheckUtils]: 211: Hoare triple {66023#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66023#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:12,107 INFO L273 TraceCheckUtils]: 212: Hoare triple {66023#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66023#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:12,108 INFO L273 TraceCheckUtils]: 213: Hoare triple {66023#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {66024#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:12,108 INFO L273 TraceCheckUtils]: 214: Hoare triple {66024#(<= main_~i~0 52)} assume true; {66024#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:12,109 INFO L273 TraceCheckUtils]: 215: Hoare triple {66024#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66024#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:12,109 INFO L273 TraceCheckUtils]: 216: Hoare triple {66024#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66024#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:12,110 INFO L273 TraceCheckUtils]: 217: Hoare triple {66024#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {66025#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:12,110 INFO L273 TraceCheckUtils]: 218: Hoare triple {66025#(<= main_~i~0 53)} assume true; {66025#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:12,111 INFO L273 TraceCheckUtils]: 219: Hoare triple {66025#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66025#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:12,111 INFO L273 TraceCheckUtils]: 220: Hoare triple {66025#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66025#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:12,112 INFO L273 TraceCheckUtils]: 221: Hoare triple {66025#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {66026#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:12,112 INFO L273 TraceCheckUtils]: 222: Hoare triple {66026#(<= main_~i~0 54)} assume true; {66026#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:12,113 INFO L273 TraceCheckUtils]: 223: Hoare triple {66026#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66026#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:12,113 INFO L273 TraceCheckUtils]: 224: Hoare triple {66026#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66026#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:12,114 INFO L273 TraceCheckUtils]: 225: Hoare triple {66026#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {66027#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:12,115 INFO L273 TraceCheckUtils]: 226: Hoare triple {66027#(<= main_~i~0 55)} assume true; {66027#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:12,115 INFO L273 TraceCheckUtils]: 227: Hoare triple {66027#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66027#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:12,116 INFO L273 TraceCheckUtils]: 228: Hoare triple {66027#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66027#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:12,116 INFO L273 TraceCheckUtils]: 229: Hoare triple {66027#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {66028#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:12,117 INFO L273 TraceCheckUtils]: 230: Hoare triple {66028#(<= main_~i~0 56)} assume true; {66028#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:12,117 INFO L273 TraceCheckUtils]: 231: Hoare triple {66028#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66028#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:12,118 INFO L273 TraceCheckUtils]: 232: Hoare triple {66028#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66028#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:12,118 INFO L273 TraceCheckUtils]: 233: Hoare triple {66028#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {66029#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:12,119 INFO L273 TraceCheckUtils]: 234: Hoare triple {66029#(<= main_~i~0 57)} assume true; {66029#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:12,119 INFO L273 TraceCheckUtils]: 235: Hoare triple {66029#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66029#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:12,120 INFO L273 TraceCheckUtils]: 236: Hoare triple {66029#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66029#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:12,120 INFO L273 TraceCheckUtils]: 237: Hoare triple {66029#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {66030#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:12,121 INFO L273 TraceCheckUtils]: 238: Hoare triple {66030#(<= main_~i~0 58)} assume true; {66030#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:12,121 INFO L273 TraceCheckUtils]: 239: Hoare triple {66030#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66030#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:12,122 INFO L273 TraceCheckUtils]: 240: Hoare triple {66030#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66030#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:12,123 INFO L273 TraceCheckUtils]: 241: Hoare triple {66030#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {66031#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:12,123 INFO L273 TraceCheckUtils]: 242: Hoare triple {66031#(<= main_~i~0 59)} assume true; {66031#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:12,124 INFO L273 TraceCheckUtils]: 243: Hoare triple {66031#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66031#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:12,124 INFO L273 TraceCheckUtils]: 244: Hoare triple {66031#(<= main_~i~0 59)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66031#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:12,125 INFO L273 TraceCheckUtils]: 245: Hoare triple {66031#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {66032#(<= main_~i~0 60)} is VALID [2018-11-18 22:59:12,125 INFO L273 TraceCheckUtils]: 246: Hoare triple {66032#(<= main_~i~0 60)} assume true; {66032#(<= main_~i~0 60)} is VALID [2018-11-18 22:59:12,126 INFO L273 TraceCheckUtils]: 247: Hoare triple {66032#(<= main_~i~0 60)} assume !(~i~0 < 100000); {65971#false} is VALID [2018-11-18 22:59:12,126 INFO L273 TraceCheckUtils]: 248: Hoare triple {65971#false} havoc ~x~0;~x~0 := 0; {65971#false} is VALID [2018-11-18 22:59:12,126 INFO L273 TraceCheckUtils]: 249: Hoare triple {65971#false} assume true; {65971#false} is VALID [2018-11-18 22:59:12,126 INFO L273 TraceCheckUtils]: 250: Hoare triple {65971#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {65971#false} is VALID [2018-11-18 22:59:12,127 INFO L256 TraceCheckUtils]: 251: Hoare triple {65971#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {65971#false} is VALID [2018-11-18 22:59:12,127 INFO L273 TraceCheckUtils]: 252: Hoare triple {65971#false} ~cond := #in~cond; {65971#false} is VALID [2018-11-18 22:59:12,127 INFO L273 TraceCheckUtils]: 253: Hoare triple {65971#false} assume 0 == ~cond; {65971#false} is VALID [2018-11-18 22:59:12,127 INFO L273 TraceCheckUtils]: 254: Hoare triple {65971#false} assume !false; {65971#false} is VALID [2018-11-18 22:59:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:12,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:59:12,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:59:12,184 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:59:12,394 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-11-18 22:59:12,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:59:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:12,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:59:12,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {65970#true} call ULTIMATE.init(); {65970#true} is VALID [2018-11-18 22:59:12,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {65970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {65970#true} is VALID [2018-11-18 22:59:12,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {65970#true} assume true; {65970#true} is VALID [2018-11-18 22:59:12,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {65970#true} {65970#true} #57#return; {65970#true} is VALID [2018-11-18 22:59:12,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {65970#true} call #t~ret4 := main(); {65970#true} is VALID [2018-11-18 22:59:12,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {65970#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {66051#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:12,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {66051#(<= main_~i~0 0)} assume true; {66051#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:12,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {66051#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66051#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:12,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {66051#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66051#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:12,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {66051#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {65973#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:12,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {65973#(<= main_~i~0 1)} assume true; {65973#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:12,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {65973#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65973#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:12,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {65973#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65973#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:12,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {65973#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {65974#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {65974#(<= main_~i~0 2)} assume true; {65974#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {65974#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65974#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {65974#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65974#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {65974#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {65975#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {65975#(<= main_~i~0 3)} assume true; {65975#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {65975#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65975#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {65975#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65975#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {65975#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {65976#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {65976#(<= main_~i~0 4)} assume true; {65976#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,891 INFO L273 TraceCheckUtils]: 23: Hoare triple {65976#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65976#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {65976#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65976#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,892 INFO L273 TraceCheckUtils]: 25: Hoare triple {65976#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {65977#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {65977#(<= main_~i~0 5)} assume true; {65977#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,893 INFO L273 TraceCheckUtils]: 27: Hoare triple {65977#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65977#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {65977#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65977#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {65977#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {65978#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {65978#(<= main_~i~0 6)} assume true; {65978#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {65978#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65978#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {65978#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65978#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,896 INFO L273 TraceCheckUtils]: 33: Hoare triple {65978#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {65979#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {65979#(<= main_~i~0 7)} assume true; {65979#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,897 INFO L273 TraceCheckUtils]: 35: Hoare triple {65979#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65979#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {65979#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65979#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {65979#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {65980#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,899 INFO L273 TraceCheckUtils]: 38: Hoare triple {65980#(<= main_~i~0 8)} assume true; {65980#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,900 INFO L273 TraceCheckUtils]: 39: Hoare triple {65980#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65980#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,900 INFO L273 TraceCheckUtils]: 40: Hoare triple {65980#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65980#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,901 INFO L273 TraceCheckUtils]: 41: Hoare triple {65980#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {65981#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,901 INFO L273 TraceCheckUtils]: 42: Hoare triple {65981#(<= main_~i~0 9)} assume true; {65981#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,902 INFO L273 TraceCheckUtils]: 43: Hoare triple {65981#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65981#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,902 INFO L273 TraceCheckUtils]: 44: Hoare triple {65981#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65981#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,903 INFO L273 TraceCheckUtils]: 45: Hoare triple {65981#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {65982#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,903 INFO L273 TraceCheckUtils]: 46: Hoare triple {65982#(<= main_~i~0 10)} assume true; {65982#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,904 INFO L273 TraceCheckUtils]: 47: Hoare triple {65982#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65982#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,904 INFO L273 TraceCheckUtils]: 48: Hoare triple {65982#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65982#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,905 INFO L273 TraceCheckUtils]: 49: Hoare triple {65982#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {65983#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,906 INFO L273 TraceCheckUtils]: 50: Hoare triple {65983#(<= main_~i~0 11)} assume true; {65983#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,906 INFO L273 TraceCheckUtils]: 51: Hoare triple {65983#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65983#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,907 INFO L273 TraceCheckUtils]: 52: Hoare triple {65983#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65983#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,907 INFO L273 TraceCheckUtils]: 53: Hoare triple {65983#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {65984#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,908 INFO L273 TraceCheckUtils]: 54: Hoare triple {65984#(<= main_~i~0 12)} assume true; {65984#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,908 INFO L273 TraceCheckUtils]: 55: Hoare triple {65984#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65984#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,909 INFO L273 TraceCheckUtils]: 56: Hoare triple {65984#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65984#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,910 INFO L273 TraceCheckUtils]: 57: Hoare triple {65984#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {65985#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,910 INFO L273 TraceCheckUtils]: 58: Hoare triple {65985#(<= main_~i~0 13)} assume true; {65985#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,911 INFO L273 TraceCheckUtils]: 59: Hoare triple {65985#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65985#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,911 INFO L273 TraceCheckUtils]: 60: Hoare triple {65985#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65985#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,912 INFO L273 TraceCheckUtils]: 61: Hoare triple {65985#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {65986#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,912 INFO L273 TraceCheckUtils]: 62: Hoare triple {65986#(<= main_~i~0 14)} assume true; {65986#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,913 INFO L273 TraceCheckUtils]: 63: Hoare triple {65986#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65986#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,913 INFO L273 TraceCheckUtils]: 64: Hoare triple {65986#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65986#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,914 INFO L273 TraceCheckUtils]: 65: Hoare triple {65986#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {65987#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,914 INFO L273 TraceCheckUtils]: 66: Hoare triple {65987#(<= main_~i~0 15)} assume true; {65987#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,915 INFO L273 TraceCheckUtils]: 67: Hoare triple {65987#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65987#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,915 INFO L273 TraceCheckUtils]: 68: Hoare triple {65987#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65987#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,916 INFO L273 TraceCheckUtils]: 69: Hoare triple {65987#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {65988#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,917 INFO L273 TraceCheckUtils]: 70: Hoare triple {65988#(<= main_~i~0 16)} assume true; {65988#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,917 INFO L273 TraceCheckUtils]: 71: Hoare triple {65988#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65988#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,918 INFO L273 TraceCheckUtils]: 72: Hoare triple {65988#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65988#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,918 INFO L273 TraceCheckUtils]: 73: Hoare triple {65988#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {65989#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,919 INFO L273 TraceCheckUtils]: 74: Hoare triple {65989#(<= main_~i~0 17)} assume true; {65989#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,919 INFO L273 TraceCheckUtils]: 75: Hoare triple {65989#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65989#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,920 INFO L273 TraceCheckUtils]: 76: Hoare triple {65989#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65989#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,920 INFO L273 TraceCheckUtils]: 77: Hoare triple {65989#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {65990#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,921 INFO L273 TraceCheckUtils]: 78: Hoare triple {65990#(<= main_~i~0 18)} assume true; {65990#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,921 INFO L273 TraceCheckUtils]: 79: Hoare triple {65990#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65990#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,922 INFO L273 TraceCheckUtils]: 80: Hoare triple {65990#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65990#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,923 INFO L273 TraceCheckUtils]: 81: Hoare triple {65990#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {65991#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,923 INFO L273 TraceCheckUtils]: 82: Hoare triple {65991#(<= main_~i~0 19)} assume true; {65991#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,924 INFO L273 TraceCheckUtils]: 83: Hoare triple {65991#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65991#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,924 INFO L273 TraceCheckUtils]: 84: Hoare triple {65991#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65991#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,925 INFO L273 TraceCheckUtils]: 85: Hoare triple {65991#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {65992#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,925 INFO L273 TraceCheckUtils]: 86: Hoare triple {65992#(<= main_~i~0 20)} assume true; {65992#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,926 INFO L273 TraceCheckUtils]: 87: Hoare triple {65992#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65992#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,926 INFO L273 TraceCheckUtils]: 88: Hoare triple {65992#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65992#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,927 INFO L273 TraceCheckUtils]: 89: Hoare triple {65992#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {65993#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,927 INFO L273 TraceCheckUtils]: 90: Hoare triple {65993#(<= main_~i~0 21)} assume true; {65993#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,928 INFO L273 TraceCheckUtils]: 91: Hoare triple {65993#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65993#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,928 INFO L273 TraceCheckUtils]: 92: Hoare triple {65993#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65993#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,929 INFO L273 TraceCheckUtils]: 93: Hoare triple {65993#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {65994#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,930 INFO L273 TraceCheckUtils]: 94: Hoare triple {65994#(<= main_~i~0 22)} assume true; {65994#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,930 INFO L273 TraceCheckUtils]: 95: Hoare triple {65994#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65994#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,931 INFO L273 TraceCheckUtils]: 96: Hoare triple {65994#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65994#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,931 INFO L273 TraceCheckUtils]: 97: Hoare triple {65994#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {65995#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,932 INFO L273 TraceCheckUtils]: 98: Hoare triple {65995#(<= main_~i~0 23)} assume true; {65995#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,932 INFO L273 TraceCheckUtils]: 99: Hoare triple {65995#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65995#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,933 INFO L273 TraceCheckUtils]: 100: Hoare triple {65995#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65995#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,934 INFO L273 TraceCheckUtils]: 101: Hoare triple {65995#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {65996#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,934 INFO L273 TraceCheckUtils]: 102: Hoare triple {65996#(<= main_~i~0 24)} assume true; {65996#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,935 INFO L273 TraceCheckUtils]: 103: Hoare triple {65996#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65996#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,935 INFO L273 TraceCheckUtils]: 104: Hoare triple {65996#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65996#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,936 INFO L273 TraceCheckUtils]: 105: Hoare triple {65996#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {65997#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,936 INFO L273 TraceCheckUtils]: 106: Hoare triple {65997#(<= main_~i~0 25)} assume true; {65997#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,937 INFO L273 TraceCheckUtils]: 107: Hoare triple {65997#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65997#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,937 INFO L273 TraceCheckUtils]: 108: Hoare triple {65997#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65997#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,938 INFO L273 TraceCheckUtils]: 109: Hoare triple {65997#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {65998#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,938 INFO L273 TraceCheckUtils]: 110: Hoare triple {65998#(<= main_~i~0 26)} assume true; {65998#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,939 INFO L273 TraceCheckUtils]: 111: Hoare triple {65998#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65998#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,939 INFO L273 TraceCheckUtils]: 112: Hoare triple {65998#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65998#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,940 INFO L273 TraceCheckUtils]: 113: Hoare triple {65998#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {65999#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,941 INFO L273 TraceCheckUtils]: 114: Hoare triple {65999#(<= main_~i~0 27)} assume true; {65999#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,941 INFO L273 TraceCheckUtils]: 115: Hoare triple {65999#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65999#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,942 INFO L273 TraceCheckUtils]: 116: Hoare triple {65999#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {65999#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,942 INFO L273 TraceCheckUtils]: 117: Hoare triple {65999#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {66000#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,943 INFO L273 TraceCheckUtils]: 118: Hoare triple {66000#(<= main_~i~0 28)} assume true; {66000#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,943 INFO L273 TraceCheckUtils]: 119: Hoare triple {66000#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66000#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,944 INFO L273 TraceCheckUtils]: 120: Hoare triple {66000#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66000#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,944 INFO L273 TraceCheckUtils]: 121: Hoare triple {66000#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {66001#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,945 INFO L273 TraceCheckUtils]: 122: Hoare triple {66001#(<= main_~i~0 29)} assume true; {66001#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,946 INFO L273 TraceCheckUtils]: 123: Hoare triple {66001#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66001#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,946 INFO L273 TraceCheckUtils]: 124: Hoare triple {66001#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66001#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,947 INFO L273 TraceCheckUtils]: 125: Hoare triple {66001#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {66002#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,947 INFO L273 TraceCheckUtils]: 126: Hoare triple {66002#(<= main_~i~0 30)} assume true; {66002#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,948 INFO L273 TraceCheckUtils]: 127: Hoare triple {66002#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66002#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,948 INFO L273 TraceCheckUtils]: 128: Hoare triple {66002#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66002#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,949 INFO L273 TraceCheckUtils]: 129: Hoare triple {66002#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {66003#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,949 INFO L273 TraceCheckUtils]: 130: Hoare triple {66003#(<= main_~i~0 31)} assume true; {66003#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,950 INFO L273 TraceCheckUtils]: 131: Hoare triple {66003#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66003#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,950 INFO L273 TraceCheckUtils]: 132: Hoare triple {66003#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66003#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,951 INFO L273 TraceCheckUtils]: 133: Hoare triple {66003#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {66004#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,952 INFO L273 TraceCheckUtils]: 134: Hoare triple {66004#(<= main_~i~0 32)} assume true; {66004#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,952 INFO L273 TraceCheckUtils]: 135: Hoare triple {66004#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66004#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,953 INFO L273 TraceCheckUtils]: 136: Hoare triple {66004#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66004#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,953 INFO L273 TraceCheckUtils]: 137: Hoare triple {66004#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {66005#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,954 INFO L273 TraceCheckUtils]: 138: Hoare triple {66005#(<= main_~i~0 33)} assume true; {66005#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,954 INFO L273 TraceCheckUtils]: 139: Hoare triple {66005#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66005#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,955 INFO L273 TraceCheckUtils]: 140: Hoare triple {66005#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66005#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,955 INFO L273 TraceCheckUtils]: 141: Hoare triple {66005#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {66006#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,956 INFO L273 TraceCheckUtils]: 142: Hoare triple {66006#(<= main_~i~0 34)} assume true; {66006#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,956 INFO L273 TraceCheckUtils]: 143: Hoare triple {66006#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66006#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,959 INFO L273 TraceCheckUtils]: 144: Hoare triple {66006#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66006#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,959 INFO L273 TraceCheckUtils]: 145: Hoare triple {66006#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {66007#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,960 INFO L273 TraceCheckUtils]: 146: Hoare triple {66007#(<= main_~i~0 35)} assume true; {66007#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,960 INFO L273 TraceCheckUtils]: 147: Hoare triple {66007#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66007#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,961 INFO L273 TraceCheckUtils]: 148: Hoare triple {66007#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66007#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,961 INFO L273 TraceCheckUtils]: 149: Hoare triple {66007#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {66008#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,961 INFO L273 TraceCheckUtils]: 150: Hoare triple {66008#(<= main_~i~0 36)} assume true; {66008#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,962 INFO L273 TraceCheckUtils]: 151: Hoare triple {66008#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66008#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,962 INFO L273 TraceCheckUtils]: 152: Hoare triple {66008#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66008#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,962 INFO L273 TraceCheckUtils]: 153: Hoare triple {66008#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {66009#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,963 INFO L273 TraceCheckUtils]: 154: Hoare triple {66009#(<= main_~i~0 37)} assume true; {66009#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,963 INFO L273 TraceCheckUtils]: 155: Hoare triple {66009#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66009#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,964 INFO L273 TraceCheckUtils]: 156: Hoare triple {66009#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66009#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,965 INFO L273 TraceCheckUtils]: 157: Hoare triple {66009#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {66010#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:12,965 INFO L273 TraceCheckUtils]: 158: Hoare triple {66010#(<= main_~i~0 38)} assume true; {66010#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:12,966 INFO L273 TraceCheckUtils]: 159: Hoare triple {66010#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66010#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:12,966 INFO L273 TraceCheckUtils]: 160: Hoare triple {66010#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66010#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:12,967 INFO L273 TraceCheckUtils]: 161: Hoare triple {66010#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {66011#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:12,967 INFO L273 TraceCheckUtils]: 162: Hoare triple {66011#(<= main_~i~0 39)} assume true; {66011#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:12,968 INFO L273 TraceCheckUtils]: 163: Hoare triple {66011#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66011#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:12,968 INFO L273 TraceCheckUtils]: 164: Hoare triple {66011#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66011#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:12,969 INFO L273 TraceCheckUtils]: 165: Hoare triple {66011#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {66012#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:12,969 INFO L273 TraceCheckUtils]: 166: Hoare triple {66012#(<= main_~i~0 40)} assume true; {66012#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:12,970 INFO L273 TraceCheckUtils]: 167: Hoare triple {66012#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66012#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:12,970 INFO L273 TraceCheckUtils]: 168: Hoare triple {66012#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66012#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:12,971 INFO L273 TraceCheckUtils]: 169: Hoare triple {66012#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {66013#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:12,972 INFO L273 TraceCheckUtils]: 170: Hoare triple {66013#(<= main_~i~0 41)} assume true; {66013#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:12,972 INFO L273 TraceCheckUtils]: 171: Hoare triple {66013#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66013#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:12,973 INFO L273 TraceCheckUtils]: 172: Hoare triple {66013#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66013#(<= main_~i~0 41)} is VALID [2018-11-18 22:59:12,973 INFO L273 TraceCheckUtils]: 173: Hoare triple {66013#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {66014#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:12,974 INFO L273 TraceCheckUtils]: 174: Hoare triple {66014#(<= main_~i~0 42)} assume true; {66014#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:12,974 INFO L273 TraceCheckUtils]: 175: Hoare triple {66014#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66014#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:12,975 INFO L273 TraceCheckUtils]: 176: Hoare triple {66014#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66014#(<= main_~i~0 42)} is VALID [2018-11-18 22:59:12,975 INFO L273 TraceCheckUtils]: 177: Hoare triple {66014#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {66015#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:12,976 INFO L273 TraceCheckUtils]: 178: Hoare triple {66015#(<= main_~i~0 43)} assume true; {66015#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:12,976 INFO L273 TraceCheckUtils]: 179: Hoare triple {66015#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66015#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:12,977 INFO L273 TraceCheckUtils]: 180: Hoare triple {66015#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66015#(<= main_~i~0 43)} is VALID [2018-11-18 22:59:12,978 INFO L273 TraceCheckUtils]: 181: Hoare triple {66015#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {66016#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:12,978 INFO L273 TraceCheckUtils]: 182: Hoare triple {66016#(<= main_~i~0 44)} assume true; {66016#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:12,979 INFO L273 TraceCheckUtils]: 183: Hoare triple {66016#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66016#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:12,980 INFO L273 TraceCheckUtils]: 184: Hoare triple {66016#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66016#(<= main_~i~0 44)} is VALID [2018-11-18 22:59:12,980 INFO L273 TraceCheckUtils]: 185: Hoare triple {66016#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {66017#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:12,981 INFO L273 TraceCheckUtils]: 186: Hoare triple {66017#(<= main_~i~0 45)} assume true; {66017#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:12,981 INFO L273 TraceCheckUtils]: 187: Hoare triple {66017#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66017#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:12,982 INFO L273 TraceCheckUtils]: 188: Hoare triple {66017#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66017#(<= main_~i~0 45)} is VALID [2018-11-18 22:59:12,983 INFO L273 TraceCheckUtils]: 189: Hoare triple {66017#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {66018#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:12,983 INFO L273 TraceCheckUtils]: 190: Hoare triple {66018#(<= main_~i~0 46)} assume true; {66018#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:12,984 INFO L273 TraceCheckUtils]: 191: Hoare triple {66018#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66018#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:12,984 INFO L273 TraceCheckUtils]: 192: Hoare triple {66018#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66018#(<= main_~i~0 46)} is VALID [2018-11-18 22:59:12,985 INFO L273 TraceCheckUtils]: 193: Hoare triple {66018#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {66019#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:12,985 INFO L273 TraceCheckUtils]: 194: Hoare triple {66019#(<= main_~i~0 47)} assume true; {66019#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:12,986 INFO L273 TraceCheckUtils]: 195: Hoare triple {66019#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66019#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:12,987 INFO L273 TraceCheckUtils]: 196: Hoare triple {66019#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66019#(<= main_~i~0 47)} is VALID [2018-11-18 22:59:12,987 INFO L273 TraceCheckUtils]: 197: Hoare triple {66019#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {66020#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:12,988 INFO L273 TraceCheckUtils]: 198: Hoare triple {66020#(<= main_~i~0 48)} assume true; {66020#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:12,988 INFO L273 TraceCheckUtils]: 199: Hoare triple {66020#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66020#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:12,989 INFO L273 TraceCheckUtils]: 200: Hoare triple {66020#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66020#(<= main_~i~0 48)} is VALID [2018-11-18 22:59:12,990 INFO L273 TraceCheckUtils]: 201: Hoare triple {66020#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {66021#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:12,990 INFO L273 TraceCheckUtils]: 202: Hoare triple {66021#(<= main_~i~0 49)} assume true; {66021#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:12,991 INFO L273 TraceCheckUtils]: 203: Hoare triple {66021#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66021#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:12,991 INFO L273 TraceCheckUtils]: 204: Hoare triple {66021#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66021#(<= main_~i~0 49)} is VALID [2018-11-18 22:59:12,992 INFO L273 TraceCheckUtils]: 205: Hoare triple {66021#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {66022#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:12,992 INFO L273 TraceCheckUtils]: 206: Hoare triple {66022#(<= main_~i~0 50)} assume true; {66022#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:12,993 INFO L273 TraceCheckUtils]: 207: Hoare triple {66022#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66022#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:12,993 INFO L273 TraceCheckUtils]: 208: Hoare triple {66022#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66022#(<= main_~i~0 50)} is VALID [2018-11-18 22:59:12,994 INFO L273 TraceCheckUtils]: 209: Hoare triple {66022#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {66023#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:12,994 INFO L273 TraceCheckUtils]: 210: Hoare triple {66023#(<= main_~i~0 51)} assume true; {66023#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:12,995 INFO L273 TraceCheckUtils]: 211: Hoare triple {66023#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66023#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:12,995 INFO L273 TraceCheckUtils]: 212: Hoare triple {66023#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66023#(<= main_~i~0 51)} is VALID [2018-11-18 22:59:12,996 INFO L273 TraceCheckUtils]: 213: Hoare triple {66023#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {66024#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:12,997 INFO L273 TraceCheckUtils]: 214: Hoare triple {66024#(<= main_~i~0 52)} assume true; {66024#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:12,997 INFO L273 TraceCheckUtils]: 215: Hoare triple {66024#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66024#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:12,998 INFO L273 TraceCheckUtils]: 216: Hoare triple {66024#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66024#(<= main_~i~0 52)} is VALID [2018-11-18 22:59:12,998 INFO L273 TraceCheckUtils]: 217: Hoare triple {66024#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {66025#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:12,999 INFO L273 TraceCheckUtils]: 218: Hoare triple {66025#(<= main_~i~0 53)} assume true; {66025#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:12,999 INFO L273 TraceCheckUtils]: 219: Hoare triple {66025#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66025#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:13,000 INFO L273 TraceCheckUtils]: 220: Hoare triple {66025#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66025#(<= main_~i~0 53)} is VALID [2018-11-18 22:59:13,001 INFO L273 TraceCheckUtils]: 221: Hoare triple {66025#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {66026#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:13,001 INFO L273 TraceCheckUtils]: 222: Hoare triple {66026#(<= main_~i~0 54)} assume true; {66026#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:13,002 INFO L273 TraceCheckUtils]: 223: Hoare triple {66026#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66026#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:13,002 INFO L273 TraceCheckUtils]: 224: Hoare triple {66026#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66026#(<= main_~i~0 54)} is VALID [2018-11-18 22:59:13,003 INFO L273 TraceCheckUtils]: 225: Hoare triple {66026#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {66027#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:13,003 INFO L273 TraceCheckUtils]: 226: Hoare triple {66027#(<= main_~i~0 55)} assume true; {66027#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:13,004 INFO L273 TraceCheckUtils]: 227: Hoare triple {66027#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66027#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:13,004 INFO L273 TraceCheckUtils]: 228: Hoare triple {66027#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66027#(<= main_~i~0 55)} is VALID [2018-11-18 22:59:13,005 INFO L273 TraceCheckUtils]: 229: Hoare triple {66027#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {66028#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:13,009 INFO L273 TraceCheckUtils]: 230: Hoare triple {66028#(<= main_~i~0 56)} assume true; {66028#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:13,009 INFO L273 TraceCheckUtils]: 231: Hoare triple {66028#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66028#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:13,010 INFO L273 TraceCheckUtils]: 232: Hoare triple {66028#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66028#(<= main_~i~0 56)} is VALID [2018-11-18 22:59:13,010 INFO L273 TraceCheckUtils]: 233: Hoare triple {66028#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {66029#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:13,011 INFO L273 TraceCheckUtils]: 234: Hoare triple {66029#(<= main_~i~0 57)} assume true; {66029#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:13,011 INFO L273 TraceCheckUtils]: 235: Hoare triple {66029#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66029#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:13,011 INFO L273 TraceCheckUtils]: 236: Hoare triple {66029#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66029#(<= main_~i~0 57)} is VALID [2018-11-18 22:59:13,012 INFO L273 TraceCheckUtils]: 237: Hoare triple {66029#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {66030#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:13,012 INFO L273 TraceCheckUtils]: 238: Hoare triple {66030#(<= main_~i~0 58)} assume true; {66030#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:13,012 INFO L273 TraceCheckUtils]: 239: Hoare triple {66030#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66030#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:13,013 INFO L273 TraceCheckUtils]: 240: Hoare triple {66030#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66030#(<= main_~i~0 58)} is VALID [2018-11-18 22:59:13,013 INFO L273 TraceCheckUtils]: 241: Hoare triple {66030#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {66031#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:13,014 INFO L273 TraceCheckUtils]: 242: Hoare triple {66031#(<= main_~i~0 59)} assume true; {66031#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:13,014 INFO L273 TraceCheckUtils]: 243: Hoare triple {66031#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {66031#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:13,015 INFO L273 TraceCheckUtils]: 244: Hoare triple {66031#(<= main_~i~0 59)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {66031#(<= main_~i~0 59)} is VALID [2018-11-18 22:59:13,016 INFO L273 TraceCheckUtils]: 245: Hoare triple {66031#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {66032#(<= main_~i~0 60)} is VALID [2018-11-18 22:59:13,016 INFO L273 TraceCheckUtils]: 246: Hoare triple {66032#(<= main_~i~0 60)} assume true; {66032#(<= main_~i~0 60)} is VALID [2018-11-18 22:59:13,017 INFO L273 TraceCheckUtils]: 247: Hoare triple {66032#(<= main_~i~0 60)} assume !(~i~0 < 100000); {65971#false} is VALID [2018-11-18 22:59:13,017 INFO L273 TraceCheckUtils]: 248: Hoare triple {65971#false} havoc ~x~0;~x~0 := 0; {65971#false} is VALID [2018-11-18 22:59:13,017 INFO L273 TraceCheckUtils]: 249: Hoare triple {65971#false} assume true; {65971#false} is VALID [2018-11-18 22:59:13,017 INFO L273 TraceCheckUtils]: 250: Hoare triple {65971#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {65971#false} is VALID [2018-11-18 22:59:13,017 INFO L256 TraceCheckUtils]: 251: Hoare triple {65971#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {65971#false} is VALID [2018-11-18 22:59:13,018 INFO L273 TraceCheckUtils]: 252: Hoare triple {65971#false} ~cond := #in~cond; {65971#false} is VALID [2018-11-18 22:59:13,018 INFO L273 TraceCheckUtils]: 253: Hoare triple {65971#false} assume 0 == ~cond; {65971#false} is VALID [2018-11-18 22:59:13,018 INFO L273 TraceCheckUtils]: 254: Hoare triple {65971#false} assume !false; {65971#false} is VALID [2018-11-18 22:59:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:13,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:59:13,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2018-11-18 22:59:13,099 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 255 [2018-11-18 22:59:13,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:59:13,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2018-11-18 22:59:13,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:13,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-18 22:59:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-18 22:59:13,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-18 22:59:13,357 INFO L87 Difference]: Start difference. First operand 260 states and 321 transitions. Second operand 64 states. [2018-11-18 22:59:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:14,553 INFO L93 Difference]: Finished difference Result 278 states and 342 transitions. [2018-11-18 22:59:14,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-18 22:59:14,553 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 255 [2018-11-18 22:59:14,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:59:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 22:59:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 342 transitions. [2018-11-18 22:59:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 22:59:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 342 transitions. [2018-11-18 22:59:14,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states and 342 transitions.